Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs

DOI10.48550/arXiv.2006.03284zbMath1482.62013arXiv2006.03284OpenAlexW4211244437MaRDI QIDQ136800

Yi Yu, Yaofang Hu, Wanjie Wang, Wanjie Wang, Yi Yu, Yaofang Hu

Publication date: 5 June 2020

Published in: Statistics and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.03284

zbMATH Keywords

graph matchingstochastic block modelsdegree profilepartially-overlapping graphs correlated Bernoulli networks

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (1)

GMPro

Uses Software

• R
• igraph

Cites Work

• Unnamed Item
• Unnamed Item
• Fast community detection by SCORE
• Coauthorship and citation networks for statisticians
• Improved random graph isomorphism
• Efficient random graph matching via degree profiles
• An Algorithm for Subgraph Isomorphism
• A distance measure between attributed relational graphs for pattern recognition
• Vertex nomination via seeded graph matching
• Seeded graph matching for correlated Erd\H{o}s-R\'enyi graphs
• Random Dot Product Graph Models for Social Networks
• Power balance and apportionment algorithms for the United States Congress

This page was built for publication: Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs