We prove a quantitative Russo-Seymour-Welsh (RSW) type result for random walks on two natural examples of random planar graphs: the supercritical percolation cluster in the square lattice and the ...

Existing random graph models introduce unwanted features such as multiple edges and directed cycles when randomizing directed acyclic networks. This paper proposes a new random graph model for ...

MARC NOY, VLADY RAVELOMANANA, JUANJO RUÉ, ON THE PROBABILITY OF PLANARITY OF A RANDOM GRAPH NEAR THE CRITICAL POINT, Proceedings of the American Mathematical Society, Vol. 143, No. 3 (MARCH 2015), pp.

Random graphs constitute one specific case — a random graph can be thought of as a random subset of the set of all possible edges — but there are many other objects that fall within the conjecture’s ...

Chatterjee et al. (2011) established the consistency of the maximum likelihood estimator in the β-model for undirected random graphs when the number of vertices goes to infinity. By approximating the ...

Time-varying data with irregular structures can be described by finite time-vertex graph signals (FTVGS), which represent potential temporal and spatial relationships among multiple sources. While ...