相关论文: Incipient Spanning Clusters in Square and Cubic Pe…

Following H. Tomita and C. Murakami we propose an analytical model to predict critical probability of percolation. It is based on the excursion set theory which allows us to consider N-dimensional bounded regions. Details are given for the…

Crossing probabilities for critical 2-D percolation on large but finite lattices have been derived via boundary conformal field theory. These predictions agree very well with numerical results. However, their derivation is heuristic and…

We present exact calculations of the average number of connected clusters per site, $<k>$, as a function of bond occupation probability $p$, for the bond percolation problem on infinite-length strips of finite width $L_y$, of the square,…

A scaling theory is used to derive the dependence of the average number <k> of spanning clusters at threshold on the lattice size L. This number should become independent of L for dimensions d<6, and vary as log L at d=6. The predictions…

A random recursive cell splitting scheme of the $2$-dimensional unit sphere is considered, which is the spherical analogue of the STIT tessellation process from Euclidean stochastic geometry. First-order moments are computed for a large…

Percolation models with multiple percolating clusters have attracted much attention in recent years. Here we use Monte Carlo simulations to study bond percolation on $L_{1}\times L_{2}$ planar random lattices, duals of random lattices, and…

We simulate structural phase behavior of polymer-grafted colloidal particles by molecular Monte Carlo technique. Interparticle potential, which has a finite repulsive square-step outside a rigid core of the colloid, was previously confirmed…

We present structural properties of two-dimensional polymers as far as they can be described by percolation theory. The percolation threshold, critical exponents and fractal dimensions of clusters are determined by computer simulation and…

Consider the problem of determining the maximal induced subgraph in a random $d$-regular graph such that its components remain bounded as the size of the graph becomes arbitrarily large. We show, for asymptotically large $d$, that any such…

Using conformal field theory, we derive several new crossing formulas at the two-dimensional percolation point. High-precision simulation confirms these results. Integrating them gives a unified derivation of Cardy's formula for the…

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…

Percolation, a paradigmatic geometric system in various branches of physical sciences, is known to possess logarithmic factors in its correlators. Starting from its definition, as the $Q\rightarrow1$ limit of the $Q$-state Potts model with…

The site percolation problem is one of the core topics in statistical physics. Evaluation of the percolation threshold, which separates two phases (sometimes described as conducting and insulating), is useful for a range of problems from…

The aim of the paper is to present numerical results supporting the presence of conformal invariance in three dimensional statistical mechanics models at criticality and to elucidate the geometric aspects of universality. As a case study we…

We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…

The dynamics of a 2D site percolation model on a square lattice is studied using the hierarchical approach introduced by Gabrielov et al., Phys. Rev. E, 60, 5293-5300, 1999. The key elements of the approach are the tree representation of…

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…

In this paper, the 60-year-old concept of long-range interaction in percolation problems introduced by Dalton, Domb, and Sykes, is reconsidered. With Monte Carlo simulation -- based on Newman-Ziff algorithm and finite-size scaling…

The intrinsic geometry of the critical percolation cluster induced by the level set of the metric Gaussian free field on $\mathbb{Z}^{d}$ has been the subject of much recent activity. (Lupu, 2016) established that the critical percolation…

We develop a scheme for generating a universal qubit cluster state using probabilistic Bell measurements without the need for feed-forward or long-time quantum memories. Borrowing ideas from percolation theory we numerically show that using…