Aligning random graphs with a sub-tree similarity message-passing algorithm
From MaRDI portal
Publication:5093855
DOI10.1088/1742-5468/ac70d2OpenAlexW4226414607MaRDI QIDQ5093855
Gabriele Sicuro, Lenka Zdeborová, Giovanni Piccioli, Guilhem Semerjian
Publication date: 1 August 2022
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.13079
Related Items (1)
Cites Work
- Belief propagation, robust reconstruction and optimal recovery of block models
- The quadratic assignment problem. Theory and algorithms
- The number of trees
- Efficient random graph matching via degree profiles
- The ?(2) limit in the random assignment problem
- Community Detection and Stochastic Block Models
- On the asymmetry of random regular graphs and random graphs
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- Seeded graph matching via large neighborhood statistics
- Seeded graph matching for correlated Erd\H{o}s-R\'enyi graphs
This page was built for publication: Aligning random graphs with a sub-tree similarity message-passing algorithm