Related papers: The scaling limit of critical hypercube percolatio…
We investigate a critical scaling law for the cluster heterogeneity $H$ in site and bond percolations in $d$-dimensional lattices with $d=2,...,6$. The cluster heterogeneity is defined as the number of distinct cluster sizes. As an…
We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the…
In this paper we investigate the critical probability $p_c(Q_n,r)$ for bootstrap percolation with the infection threshold $r$ on the $n$-dimensional hypercube $Q_n$ with vertex set $V(Q_n)=\{0,1\}^n$ and edges connecting the pairs at…
We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in high dimensions, or when d>6 for sufficient spread-out percolation. We use a relatively simple…
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent $\tau \in (2,3)$. It is well known…
We discuss scaling limits of large bipartite planar maps. If p is a fixed integer strictly greater than 1, we consider a random planar map M(n) which is uniformly distributed over the set of all 2p-angulations with n faces. Then, at least…
We consider supercritical site percolation on the $d$-dimensional hypercube $Q^d$. We show that typically all components in the percolated hypercube, besides the giant, are of size $O(d)$. This resolves a conjecture of Bollob\'as,…
The explosive percolation problem on the complete graph is investigated via extensive numerical simulations. We obtain the cluster-size distribution at the moment when the cluster size heterogeneity becomes maximum. The distribution is…
We study critical site percolation on the triangular lattice. We find the difference of the probabilities of having a percolation interface to the right and to the left of two given points in the scaling limit. This generalizes both Cardy's…
We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…
Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by…
To understand mesoscopic scaling in networks, we study the hierarchical configuration model (HCM), a random graph model with community structure. The connections between the communities are formed as in a configuration model. We study the…
We apply the critical geometry approach for bounded critical phenomena [1] to $3d$ percolation. The functional shape of the order parameter profile $\phi$ is related via the fractional Yamabe equation to its scaling dimension…
We consider the strongly connected components (SCCs) of a uniform directed graph on $n$ vertices with i.i.d. in- and out-degree pairs distributed as $(D^-,D^+)$, with $\mathbb E[D^+]=\mathbb E[D^-]=\mu$. We condition on equal total in- and…
The Hamming torus of dimension $d$ is the graph with vertices $\{1,\dots,n\}^d$ and an edge between any two vertices that differ in a single coordinate. Bootstrap percolation with threshold $\theta$ starts with a random set of open…
A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
We develop a general universality technique for establishing metric scaling limits of critical random discrete structures exhibiting mean-field behavior that requires four ingredients: (i) from the barely subcritical regime to the critical…
We identify the asymptotic distribution of the chemical distance in high-dimensional critical Bernoulli percolation. Namely, we show that the distance between the origin and a distant vertex conditioned to lie in the cluster of the origin…