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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Probability theory and related fields Ročník 179; číslo 1-2; s. 29 - 115
Hlavní autori:	Ding, Jian, Ma, Zongming, Wu, Yihong, Xu, Jiaming
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2021 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!