Correlated randomly growing graphs
From MaRDI portal
Publication:2135266
DOI10.1214/21-AAP1703zbMath1502.60011arXiv2004.13537OpenAlexW3021385523MaRDI QIDQ2135266
Miklós Z. Rácz, Anirudh Sridhar
Publication date: 6 May 2022
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.13537
random graphspreferential attachmentrandomly growing graphsuniform attachmentcorrelated random graphsinfluence of the seed
Related Items
Root finding algorithms and persistence of Jordan centrality in growing random trees ⋮ Testing correlation of unlabeled random graphs ⋮ Matching recovery threshold for correlated random graphs
Uses Software
Cites Work
- Scaling limits and influence of the seed graph in preferential attachment trees
- Distances in random plane-oriented recursive trees
- Change point detection in network models: preferential attachment and long range dependence
- Discrete minimax estimation with trees
- From trees to seeds: on the inference of the seed from large trees in the uniform attachment model
- Basic models and questions in statistical network analysis
- Asymptotic behavior and distributional limits of preferential attachment graphs
- The graph matching problem
- Finding the seed of uniform attachment trees
- Efficient random graph matching via degree profiles
- The degree sequence of a scale-free random graph process
- Finding Rumor Sources on Random Trees
- Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels
- Finding Adam in random growing trees
- Emergence of Scaling in Random Networks
- Random Trees
- Hiding the Rumor Source
- Persistence of centrality in random growing trees
- The Maximum Degree of the Barabási–Albert Random Tree
- Seeded graph matching via large neighborhood statistics
- Seeded graph matching for correlated Erd\H{o}s-R\'enyi graphs
- Rumors in a Network: Who's the Culprit?
- Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs
