Related papers: Characterization of the threshold for multi-range …
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
We investigate the phase transition in a non-planar correlated percolation model with long-range dependence, obtained by considering level sets of a Gaussian free field with mass above a given height $h$. The dependence present in the model…
We evaluate the percolation threshold values for a realistic model of continuum segregated systems, where random spherical inclusions forbid the percolating objects, modellized by hard-core spherical particles surrounded by penetrable…
The arboreal gas is the probability measure on (unrooted spanning) forests of a graph in which each forest is weighted by a factor $\beta>0$ per edge. It arises as the $q\to 0$ limit of the $q$-state random cluster model with $p=\beta q$.…
We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…
Every realistic instance of a percolation problem is faced with some degree of polydispersity, e.g., the pore-size distribution of an inhomogeneous medium, the size distribution of filler particles in composite materials, or the vertex…
We present a numerical study of topological descriptors of initially Gaussian and scale-free density perturbations evolving via gravitational instability in an expanding universe. We carefully evaluate and avoid numerical contamination in…
In Bernoulli bond percolation on the Cartesian product graph of a $d$-regular tree and a line, we give an upper bound for the critical probability $p_c$.
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
Tree models for rigidity percolation are introduced and solved. A probability vector describes the propagation of rigidity outward from a rigid border. All components of this ``vector order parameter'' are singular at the same rigidity…
We consider the level-sets of continuous Gaussian fields on $\mathbb{R}^d$ above a certain level $-\ell\in \mathbb{R}$, which defines a percolation model as $\ell$ varies. We assume that the covariance kernel satisfies certain regularity,…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
In this paper, we study the k-neighbor bootstrap percolation process on the d-dimensional grid [n]^d, and show that the minimum number of initial vertices that percolate is (1-d/k)n^d + O(n^{d-1})$ when d<=k<=2d. This confirms a conjecture…
We show that critical percolation on a product of two regular trees of degree $\ge$ 3 satisfies the triangle condition. The proof does not examine the degrees of vertices and is not "perturbative" in any sense. It relies on an unpublished…
It is known that there is an alternative characterization of characteristic vertices for trees with positive weights on their edges via Perron values and Perron branches. Moreover, the algebraic connectivity of a tree with positive edge…
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…
We present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that…
We establish the scaling limit of the geodesics to the root for the first passage percolation distance on random planar maps. We first describe the scaling limit of the number of faces along the geodesics. This result enables us to compare…
We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…
The Horton-Strahler number -- also called the register function -- is a combinatorial tool that quantifies the branching complexity of a rooted tree. We study the law of the Horton-Strahler number of stable Galton-Watson trees conditioned…