Related papers: Random graph asymptotics on high-dimensional tori
Define the scale-free Gilbert graph based on a Boolean model with heavy-tailed radius distribution on the $d$-dimensional torus by connecting two centers of balls by an edge if at least one of the balls contains the center of the other. We…
Based on the field theoretic formulation of the general epidemic process we study logarithmic corrections to scaling in dynamic isotropic percolation at the upper critical dimension d=6. Employing renormalization group methods we determine…
We study the uniform random graph $\mathsf{C}_n$ with $n$ vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\mathsf{C}_n / \sqrt{n}$ converges to the Brownian Continuum Random Tree…
We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the…
We study critical bond percolation on periodic four-dimensional (4D) and five-dimensional (5D) hypercubes by Monte Carlo simulations. By classifying the occupied bonds into branches, junctions and non-bridges, we construct the whole, the…
Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-1 type having finite variance but infinite third moment degrees was obtained (see previous work by Bhamidi, van der Hofstad and van Leeuwaarden).…
The fractal structure and scaling properties of a 2d slice of the 3d Ising model is studied using Monte Carlo techniques. The percolation transition of geometric spin (GS) clusters is found to occur at the Curie point, reflecting the…
In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it…
In $r$-neighbour bootstrap percolation, vertices (sites) of a graph $G$ are infected, round-by-round, if they have $r$ neighbours already infected. Once infected, they remain infected. An initial set of infected sites is said to percolate…
In composite materials composed of soft polymer matrix and stiff, high-aspect-ratio particles, the composite undergoes a transition in mechanical strength when the inclusion phase surpasses a critical density. This phenomenon (rheological…
We prove that nearest-neighbor percolation in dimensions $d\geq 11$ displays mean-field behavior by proving that the infrared bound holds, in turn implying the finiteness of the percolation triangle diagram. The finiteness of the triangle…
We study the appearance of the giant component in random subgraphs of a given large finite graph G=(V,E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then…
We consider the percolation problem of sites on an $L\times L$ square lattice with periodic boundary conditions which were unvisited by a random walk of $N=uL^2$ steps, i.e. are vacant. Most of the results are obtained from numerical…
The cover time of a graph is a celebrated example of a parameter that is easy to approximate using a randomized algorithm, but for which no constant factor deterministic polynomial time approximation is known. A breakthrough due to Kahn,…
We study the transport properties of directed percolation clusters at the upper critical dimension $d_{c} = 4+1$, where critical fluctuations induce logarithmic corrections to the leading (mean-field) scaling behavior. Employing field…
In this paper, site percolation on random $\Phi^{3}$ planar graphs is studied by Monte-Carlo numerical techniques. The method consists in randomly removing a fraction $q=1-p$ of vertices from graphs generated by Monte-Carlo simulations,…
We study the two-dimensional domain morphology of twisted nematic liquid crystals during their phase-ordering kinetics [R. A. L. Almeida, Phys. Rev. Lett. 131 (2023) 268101], which is a physical candidate to self-generate critical clusters…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…
The random Lorentz gas (RLG) is a minimal model for transport in disordered media. Despite the broad relevance of the model, theoretical grasp over its properties remains weak. For instance, the scaling with dimension d of its localization…