相关论文: Invasion percolation on regular trees
A approach of finite size scaling theory for discontinous percolation with multiple giant clusters is developed in this paper. The percolation in generalized Bohman-Frieze-Wormald (BFW) model has already been proved to be discontinuous…
The size of large cliff failures may be described in several ways, for instance considering the horizontal eroded area at the cliff top and the maximum local retreat of the coastline. Field studies suggest that, for large failures, the…
In this work we demonstrate the ability of the Minimal Spanning Tree to duplicate the information contained within a percolation analysis for a point dataset. We show how to construct the percolation properties from the Minimal Spanning…
The uniform spanning tree (UST) and the loop-erased random walk (LERW) are related probabilistic processes. We consider the limits of these models on a fine grid in the plane, as the mesh goes to zero. Although the existence of scaling…
Percolation is a cornerstone concept in physics, providing crucial insights into critical phenomena and phase transitions. In this study, we adopt a kinetic perspective to reveal the scaling behaviors of higher-order gaps in the largest…
We announce our recent proof that, for independent bond percolation in high dimensions, the scaling limits of the incipient infinite cluster's two-point and three-point functions are those of integrated super-Brownian excursion (ISE). The…
Many exotic species combine low probability of establishment at each introduction with rapid population growth once introduction does succeed. To analyze this phenomenon, we note that invaders often cluster spatially when rare, and…
We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate…
We consider invasion percolation on the randomly-weighted complete graph $K_n$, started from some number $k(n)$ of distinct source vertices. The outcome of the process is a forest consisting of $k(n)$ trees, each containing exactly one…
The finite-size scaling theory for continuous phase transition plays an important role in determining critical point and critical exponents from the size-dependent behaviors of quantities in the thermodynamic limit. For percolation phase…
Size varies. Small things are typically more frequent than large things. The logarithm of frequency often declines linearly with the logarithm of size. That power law relation forms one of the common patterns of nature. Why does the…
We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
The percolation transitions on hyperbolic lattices are investigated numerically using finite-size scaling methods. The existence of two distinct percolation thresholds is verified. At the lower threshold, an unbounded cluster appears and…
We define a notion of stochastic domination between trees, where one tree dominates another if when the vertices of each are labeled with independent, identically distributed random variables, one tree is always more likely to contain a…
Percolation is a concept widely used in many fields of research and refers to the propagation of substances through porous media (e.g., coffee filtering), or the behaviour of complex networks (e.g., spreading of diseases). Percolation…
Research done during the previous century established our Standard Cosmological Model. There are many details still to be filled in, but few would seriously doubt the basic premise. Past surveys have revealed that the large-scale…
Transport in weighted networks is dominated by the minimum spanning tree (MST), the tree connecting all nodes with the minimum total weight. We find that the MST can be partitioned into two distinct components, having significantly…
The growth of ballistic aggregates on deterministic fractal substrates is studied by means of numerical simulations. First, we attempt the description of the evolving interface of the aggregates by applying the well-established…