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...
Main Author: | Gamarnik, David |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | en_US |
Published: |
Springer Berlin Heidelberg
2014
|
Online Access: | http://hdl.handle.net/1721.1/87698 https://orcid.org/0000-0001-8898-8778 |
Similar Items
-
On the max-cut of sparse random graphs
by: Gamarnik, David, et al.
Published: (2019) -
Limits of local algorithms over sparse random graphs
by: Gamarnik, David, et al.
Published: (2014) -
An Lp theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
by: Borgs, Christian, et al.
Published: (2020) -
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
by: Bayati, Mohsen, et al.
Published: (2011) -
Topology Discovery of Sparse Random Graphs With Few Participants
by: Anandkumar, Animashree, et al.
Published: (2012)