Related papers: Loop vs. Bernoulli percolation on trees: strict in…
Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…
We study Poisson--Voronoi percolation and its discrete analogue Bernoulli--Voronoi percolation in spaces with a non-amenable product structure. We develop a new method of proving smallness of the uniqueness threshold $p_u(\lambda)$ at small…
The percolation threshold of the network model by Barabasi and Albert (BA-model) [Science 286, 509 (1999)] has thus far only been 'guessed' based on simulations and comparison with other models. Due to the still uncertain influence of…
In this note we discuss vacant set level set percolation on a transient weighted graph. It interpolates between the percolation of the vacant set of random interlacements and the level set percolation of the Gaussian free field. We employ…
We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…
We analyze the geometry of scaling limits of near-critical 2D percolation, i.e., for $p=p_c+\lambda\delta^{1/\nu}$, with $\nu=4/3$, as the lattice spacing $\delta \to 0$. Our proposed framework extends previous analyses for $p=p_c$, based…
Proofs of sharp phase transition and noise sensitivity in percolation have been significantly simplified by the use of randomized algorithms, via the OSSS inequality (proved by O'Donnell, Saks, Schramm and Servedio (2005)) and the…
We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…
The couplings between the Ising model and its graphical representations, the random-cluster, random current and loop $\mathrm{O}(1)$ models, are put on common footing through a generalization of the Swendsen-Wang-Edwards-Sokal coupling. A…
The close analogy between cluster percolation and string proliferation in the context of critical phenomena is studied. Like clusters in percolation theory, closed strings, which can be either finite-temperature worldlines or topological…
We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…
A split tree of cardinality $n$ is constructed by distributing $n$ "balls" in a subset of vertices of an infinite tree which encompasses many types of random trees such as $m$-ary search trees, quad trees, median-of-$(2k+1)$ trees,…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…
We consider the biased random walk on a critical Galton-Watson tree conditioned to survive, and confirm that this model with trapping belongs to the same universality class as certain one-dimensional trapping models with slowly-varying…
In this paper, we consider random trees associated with the genealogy of Crump-Mode-Jagers processes and perform Bernoulli bond-percolation whose parameter depends on the size of the tree. Our purpose is to show the existence of a giant…
The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system.…
We define a graph process $\mathcal{G}(p,q)$ based on a discrete branching process with deletions and mergers, which is inspired by the 4-cycle structure of both the hypercube $Q_d$ and the lattice $\mathbb{Z}^d$ for large $d$. Individuals…
We define a class of random matrix ensembles that pertain to random looped polymers. Such random looped polymers are a possible model for bio-polymers such as chromatin in the cell nucleus. It is shown that the distribution of the largest…
We show that, conditioned on the (empirical) particle density exceeding the critical value, the finite volume Bose loop soup converges to the superposition of the Bosonic loop soup (on the whole space) and the Poisson point process of…