Efficient random graph matching via degree profiles

Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erdős-Rényi graphs G ( n , d n ) . This can be viewed as an average-case and noisy version of the graph isom...

Full description

Saved in:

Bibliographic Details
Published in:	Probability theory and related fields Vol. 179; no. 1-2; pp. 29 - 115
Main Authors:	Ding, Jian, Ma, Zongming, Wu, Yihong, Xu, Jiaming
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2021 Springer Nature B.V
Subjects:	Algorithms Economics Finance Graph matching Graph theory Graphs Insurance Isomorphism Management Mathematical and Computational Biology Mathematical and Computational Physics Mathematics Mathematics and Statistics Maximum likelihood estimators Operations research Operations Research/Decision Theory Polynomials Probability Probability Theory and Stochastic Processes Quantitative Finance Statistics for Business Theoretical Primary 05C80 Erdős-Rényi graph Random graph isomorphism Quadratic assignment problem Secondary 68Q87 Degree profiles Graph matching
ISSN:	0178-8051, 1432-2064
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!