Seeded graph matching for correlated Erd\H{o}s-R\'enyi graphs
From MaRDI portal
Publication:5249582
zbMath1310.68166arXiv1304.7844MaRDI QIDQ5249582
Donniell E. Fishkind, Carey E. Priebe, Vince Lyzinski
Publication date: 6 May 2015
Full work available at URL: https://arxiv.org/abs/1304.7844
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (11)
Dynamic Stochastic Blockmodel Regression for Network Data: Application to International Militarized Conflicts ⋮ Correlated randomly growing graphs ⋮ Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming ⋮ Efficient random graph matching via degree profiles ⋮ Aligning random graphs with a sub-tree similarity message-passing algorithm ⋮ Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis ⋮ Matching recovery threshold for correlated random graphs ⋮ Unnamed Item ⋮ Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs ⋮ On a complete and sufficient statistic for the correlated Bernoulli random graph model ⋮ Vertex nomination via seeded graph matching
This page was built for publication: Seeded graph matching for correlated Erd\H{o}s-R\'enyi graphs
