Right-convergence of sparse random graphs

The paper is devoted to the problem of establishing right-convergence of sparse random graphs. This concerns the convergence of the logarithm of number of homomorphisms from graphs or hyper-graphs GN,N≥1 to some target graph W . The theory of dense graph convergence, including random dense graphs, i...

Повний опис

Бібліографічні деталі
Автор: Gamarnik, David
Інші автори: Sloan School of Management
Формат: Стаття
Мова:en_US
Опубліковано: Springer Berlin Heidelberg 2014
Онлайн доступ:http://hdl.handle.net/1721.1/87698
https://orcid.org/0000-0001-8898-8778