Phase transition in random distance graphs on the torus
Probability
2016-11-18 v1
Abstract
We apply here methods of inhomogeneous random graphs to a class of random distance graphs. This provides an example outside of the rank 1 models which is still solvable as long as the largest connected component is concerned. In particular, we show that some random distance graphs behave exactly as the classical Erd\H{o}s-R\'enyi model not only in the supercritical phase (as was already known) but in the subcritical case as well.
Cite
@article{arxiv.1611.05771,
title = {Phase transition in random distance graphs on the torus},
author = {Fioralba Ajazi and George M. Napolitano and Tatyana Turova},
journal= {arXiv preprint arXiv:1611.05771},
year = {2016}
}