相关论文: Invasion percolation on regular trees

Invasion percolation is a stochastic growth model that follows a greedy algorithm. After assigning i.i.d. uniform random variables (weights) to all edges of $\mathbb{Z}^d$, the growth starts at the origin. At each step, we adjoin to the…

We present a random-matrix realization of a two-dimensional percolation model with the occupation probability $p$. We find that the behavior of the model is governed by the two first extreme eigenvalues. While the second extreme eigenvalue…

We describe the effect of power-law initial distributions of clusters on ordinary percolation and its generalizations, specifically, models of explosive percolation processes based on local optimization. These aggregation processes were…

Deep neural networks exhibit empirical neural scaling laws, with error decreasing as a power law with increasing model or data size, across a wide variety of architectures, tasks, and datasets. This universality suggests that scaling laws…

The dynamical properties of the invasion percolation on the square lattice are investigated with emphasis on the geometrical properties on the growing cluster of infected sites. The exterior frontier of this cluster forms a critical loop…

We analyze a simple model for growing tree networks and find that although it never percolates, there is an anomalously large cluster at finite size. We study the growth of both the maximal cluster and the cluster containing the original…

We study the asymptotic behavior the exit times of random walk from Euclidean balls around the origin of the incipient infinite cluster in a manner inspired by [26]. We do this by obtaining bounds on the effective resistance between the…

We prove that the Minimal Spanning Tree and the Invasion Percolation Tree on a version of the triangular lattice in the complex plane have unique scaling limits, which are invariant under rotations, scalings, and, in the case of the MST,…

Let ${\cal G}$ be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree $n_0+1$. We obtain estimates for the transition density of the continuous time simple random walk $Y$ on ${\cal G}$; the process…

Percolation refers to the emergence of a giant connected cluster in a disordered system when the number of connections between nodes exceeds a critical value. The percolation phase transitions were believed to be continuous until recently…

We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…

We consider critical percolation on Galton-Watson trees and prove quenched analogues of classical theorems of critical branching processes. We show that the probability critical percolation reaches depth $n$ is asymptotic to a…

In the context of percolation in a regular tree, we study the size of the largest cluster and the length of the longest run starting within the first d generations. As d tends to infinity, we prove almost sure and weak convergence results.

We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of…

We study the percolation properties of the growing clusters model. In this model, a number of seeds placed on random locations on a lattice are allowed to grow with a constant velocity to form clusters. When two or more clusters eventually…

Percolation theory is usually applied to lattices with a uniform probability p that a site is occupied or that a bond is closed. The more general case, where p is a function of the position x, has received less attention. Previous studies…

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 study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…

Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of…

An explosive percolation transition is the abrupt emergence of a giant cluster at a threshold caused by a suppression of the growth of large clusters. In this paper, we consider the information entropy of the cluster size distribution,…