Related papers: Finite Size Percolation in Regular Trees
We investigate properties of two-dimensional finite-scale percolation systems whose size along the current flow is smaller than the perpendicular size. Successive thresholds of appearing multiple percolation channels in such systems have…
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
For random percolation at p_c, the probability distribution P(n) of the number of spanning clusters (n) has been studied in large scale simulations. The results are compatible with $P(n) \sim \exp(-an^2)$ for all dimensions. We also study…
We prove optimal quantitative estimates on the first-order correctors on supercritical percolation clusters: we show that they are bounded in $d\geq 3$ and have logarithmic growth in $d = 2$, in the sense of stretched exponential moments.…
By measuring or calculating coalescence times for several models of coalescence or evolution, with and without selection, we show that the ratios of these coalescence times become universal in the large size limit and we identify a few…
Percolation on a one-dimensional lattice and fractals such as the Sierpinski gasket is typically considered to be trivial because they percolate only at full bond density. By dressing up such lattices with small-world bonds, a novel…
We investigate the geometric properties of percolation clusters, by studying square-lattice bond percolation on the torus. We show that the density of bridges and nonbridges both tend to 1/4 for large system sizes. Using Monte Carlo…
We determine the maximum distance between any two of the center, centroid, and subtree core among trees with a given order. Corresponding results are obtained for trees with given maximum degree and also for trees with given diameter. The…
Given any regularly varying dislocation measure, we identify a natural self-similar fragmentation tree as scaling limit of discrete fragmentation trees with unit edge lengths. As an application, we obtain continuum random tree limits of…
These lectures give an introduction to the methods of conformal field theory as applied to deriving certain results in two-dimensional critical percolation: namely the probability that there exists at least one cluster connecting two…
We consider Diffusion Limited Aggregation (DLA) in a two-dimensional wedge. We prove that if the angle of the wedge is smaller than $\pi/4$, there is some $a>2$ such that almost surely, for all $R$ large enough, after time $R^a$ all new…
We calculate the distribution of the size of the percolating cluster on a tree in the subcritical, critical and supercritical phase. We do this by exploiting a mapping between continuum trees and Brownian excursions, and arrive at a…
Continuing the program begun by the authors in a previous paper, we develop an exact low-density expansion for the random minimum spanning tree (MST) on a finite graph, and use it to develop a continuum perturbation expansion for the MST on…
We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the…
We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…
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…
We study a model of an i.i.d.~random environment in general dimensions $d\ge 2$, where each site is equipped with one of two environments. The model comes with a parameter $p$ which governs the frequency of the first environment, and for…
We investigate the structure of trees that have greatest maximum eigenvalue among all trees with a given degree sequence. We show that in such an extremal tree the degree sequence is non-increasing with respect to an ordering of the…
In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…
We study the scaling of the average cluster size and percolation strength of geometrical clusters for the two-dimensional Ising model. By means of Monte Carlo simulations and a finite-size scaling analysis we discuss the appearance of…