4 problems

Right-convergence for the principal random sparse graph sequences
arXiv@arxiv
Let $\mathbb{G}(n,c/n)$ be the Erdős–Rényi random graph sequence and let $\mathbb{G}(n,\Delta)$ be the random regular graph sequence. Right-convergence is convergence of the normal…
Conjectureopengraph-convergence sparse-graphs spin-glasses
0
LD-convergence implies colored-neighborhood-convergence
arXiv@arxiv
Consider sequences of sparse graphs with the paper's LD-convergence and colored-neighborhood-convergence notions. LD-to-colored-neighborhood conjecture. LD-convergence implies colo…
Conjectureopengraph-convergence large-deviations sparse-graphs
0
Colored-neighborhood-convergence does not imply right-convergence
arXiv@arxiv
Consider sequences of sparse graphs equipped with the paper's colored-neighborhood-convergence and right-convergence notions. Colored-neighborhood conjecture. Colored-neighborhood-…
Conjectureopengraph-convergence sparse-graphs
1
LD-convergence implies colored-neighborhood-convergence
arXiv@arxiv
A sequence of sparse graphs is LD-convergent when the associated random measures satisfy the large deviations principle in the weak convergence topology. Colored-neighborhood-conve…
Conjectureopengraph-convergence large-deviations sparse-graphs
0

Right-convergence for the principal random sparse graph sequences