Saved in:
| Main Authors: | Fishkind, Donniell E., Parker, Felix, Sawczuk, Hamilton, Meng, Lingyao, Bridgeford, Eric, Athreya, Avanti, Priebe, Carey E., Lyzinski, Vince |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2103.00624 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On seeded subgraph-to-subgraph matching: The ssSGM Algorithm and matchability information theory
by: Meng, Lingyao, et al.
Published: (2023)
by: Meng, Lingyao, et al.
Published: (2023)
Gotta match 'em all: Solution diversification in graph matching matched filters
by: Li, Zhirui, et al.
Published: (2023)
by: Li, Zhirui, et al.
Published: (2023)
On the Incommensurability Phenomenon
by: Fishkind, Donniell E., et al.
Published: (2013)
by: Fishkind, Donniell E., et al.
Published: (2013)
Random line graphs and edge-attributed network inference
by: Lubberts, Zachary, et al.
Published: (2021)
by: Lubberts, Zachary, et al.
Published: (2021)
Gaussian mixture models as a proxy for interacting language models
by: Wang, Edward L., et al.
Published: (2025)
by: Wang, Edward L., et al.
Published: (2025)
Vertex misalignment and changepoint localization in network time series
by: Chen, Tianyi, et al.
Published: (2026)
by: Chen, Tianyi, et al.
Published: (2026)
Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)
by: Qi, Tong, et al.
Published: (2025)
by: Qi, Tong, et al.
Published: (2025)
Euclidean mirrors and dynamics in network time series
by: Athreya, Avanti, et al.
Published: (2022)
by: Athreya, Avanti, et al.
Published: (2022)
Dynamic networks clustering via mirror distance
by: Zheng, Runbing, et al.
Published: (2024)
by: Zheng, Runbing, et al.
Published: (2024)
Euclidean mirrors and first-order changepoints in network time series
by: Chen, Tianyi, et al.
Published: (2024)
by: Chen, Tianyi, et al.
Published: (2024)
Optimizing the Induced Correlation in Omnibus Joint Graph Embeddings
by: Pantazis, Konstantinos, et al.
Published: (2024)
by: Pantazis, Konstantinos, et al.
Published: (2024)
Matching and mixing: Matchability of graphs under Markovian error
by: Li, Zhirui, et al.
Published: (2026)
by: Li, Zhirui, et al.
Published: (2026)
Recovering manifold structure in LLM responses through a joint Euclidean mirror
by: Baum, Maximilian, et al.
Published: (2026)
by: Baum, Maximilian, et al.
Published: (2026)
Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labels
by: Saxena, Ayushi, et al.
Published: (2022)
by: Saxena, Ayushi, et al.
Published: (2022)
ACRONYM: Augmented degree corrected, Community Reticulated Organized Network Yielding Model
by: Leinwand, Benjamin, et al.
Published: (2024)
by: Leinwand, Benjamin, et al.
Published: (2024)
Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding
by: Qi, Tong, et al.
Published: (2023)
by: Qi, Tong, et al.
Published: (2023)
Discovering and Deciphering Relationships Across Disparate Data Modalities
by: Vogelstein, Joshua T., et al.
Published: (2016)
by: Vogelstein, Joshua T., et al.
Published: (2016)
Data Kernel Perspective Space Performance Guarantees for Synthetic Data from Transformer Models
by: Browder, Michael, et al.
Published: (2026)
by: Browder, Michael, et al.
Published: (2026)
Lightning graph matching
by: shen, Binrui., et al.
Published: (2023)
by: shen, Binrui., et al.
Published: (2023)
Nonparametric two-sample hypothesis testing for low-rank random graphs of differing sizes
by: Agterberg, Joshua, et al.
Published: (2020)
by: Agterberg, Joshua, et al.
Published: (2020)
Multiple Network Embedding for Anomaly Detection in Time Series of Graphs
by: Chen, Guodong, et al.
Published: (2020)
by: Chen, Guodong, et al.
Published: (2020)
Claw-free minimal matching covered graphs
by: Zhang, Yipei, et al.
Published: (2024)
by: Zhang, Yipei, et al.
Published: (2024)
Covariate-assisted graph matching
by: Dawn, Trisha, et al.
Published: (2025)
by: Dawn, Trisha, et al.
Published: (2025)
Symbolic Listings as Computation
by: Sawczuk, Hamilton, et al.
Published: (2024)
by: Sawczuk, Hamilton, et al.
Published: (2024)
Two Proofs of the Hamiltonian Cycle Identity
by: Sawczuk, Hamilton, et al.
Published: (2025)
by: Sawczuk, Hamilton, et al.
Published: (2025)
Characterizations of undirected 2-quasi best match graphs
by: Korchmaros, Annachiara, et al.
Published: (2025)
by: Korchmaros, Annachiara, et al.
Published: (2025)
Induced matching, ordered matching and Castelnuovo-Mumford regularity of bipartite graphs
by: Jayanthan, A. V., et al.
Published: (2024)
by: Jayanthan, A. V., et al.
Published: (2024)
Investigating social alignment via mirroring in a system of interacting language models
by: McGuinness, Harvey, et al.
Published: (2024)
by: McGuinness, Harvey, et al.
Published: (2024)
$θ$-free matching covered graphs
by: Joshi, Rohinee, et al.
Published: (2024)
by: Joshi, Rohinee, et al.
Published: (2024)
Exact recovery for seeded graph matching
by: Fraiman, Nicolas, et al.
Published: (2026)
by: Fraiman, Nicolas, et al.
Published: (2026)
Tight cuts in matching covered graphs
by: Lu, Fuliang, et al.
Published: (2026)
by: Lu, Fuliang, et al.
Published: (2026)
Rainbow matchings in edge-colored graphs
by: Lu, Hongliang, et al.
Published: (2025)
by: Lu, Hongliang, et al.
Published: (2025)
The average size of maximal matchings in graphs
by: Hertz, Alain, et al.
Published: (2022)
by: Hertz, Alain, et al.
Published: (2022)
Equivariant log-concavity of graph matchings
by: Li, Shiyue
Published: (2022)
by: Li, Shiyue
Published: (2022)
Extremal graphs for average size of maximal matchings in bicyclic graphs
by: Zhang, Kai
Published: (2026)
by: Zhang, Kai
Published: (2026)
Integral bases, perfect matchings, and the Petersen graph
by: Abdi, Ahmad, et al.
Published: (2025)
by: Abdi, Ahmad, et al.
Published: (2025)
Connected matching in graphs with independence number two
by: Chen, Rong, et al.
Published: (2024)
by: Chen, Rong, et al.
Published: (2024)
Finding maximum matchings in RDV graphs efficiently
by: Biedl, Therese, et al.
Published: (2024)
by: Biedl, Therese, et al.
Published: (2024)
Clique-free t-matchings in degree-bounded graphs
by: Paluch, Katarzyna, et al.
Published: (2024)
by: Paluch, Katarzyna, et al.
Published: (2024)
Removable edges in cubic matching covered graphs
by: Fuliang, Lu, et al.
Published: (2022)
by: Fuliang, Lu, et al.
Published: (2022)
Similar Items
-
On seeded subgraph-to-subgraph matching: The ssSGM Algorithm and matchability information theory
by: Meng, Lingyao, et al.
Published: (2023) -
Gotta match 'em all: Solution diversification in graph matching matched filters
by: Li, Zhirui, et al.
Published: (2023) -
On the Incommensurability Phenomenon
by: Fishkind, Donniell E., et al.
Published: (2013) -
Random line graphs and edge-attributed network inference
by: Lubberts, Zachary, et al.
Published: (2021) -
Gaussian mixture models as a proxy for interacting language models
by: Wang, Edward L., et al.
Published: (2025)