Mixing Time of Random Walk on Poisson Geometry Small World

From MaRDI portal



Abstract: This paper focuses on the problem of modeling for small world effect on complex networks. Let's consider the supercritical Poisson continuous percolation on d-dimensional torus Tnd with volume nd. By adding "long edges (short cuts)" randomly to the largest percolation cluster, we obtain a random graph mathscrGn. In the present paper, we first prove that the diameter of mathscrGn grows at most polynomially fast in lnn and we call it the Poisson Geometry Small World. Secondly, we prove that the random walk on mathscrGn possesses the rapid mixing property, namely, the random walk mixes in time at most polynomially large in lnn.












This page was built for publication: Mixing Time of Random Walk on Poisson Geometry Small World

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389690)