Related papers: $N$-cluster correlations in four- and five-dimensi…
We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in high dimensions, or when d>6 for sufficient spread-out percolation. We use a relatively simple…
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…
Higher order statistics are investigated in ($\Omega$)CDM universes by analyzing $500\mpc$ high resolution tree N-body simulations with both $\Omega = 1$, and $\Omega < 1$. The amplitudes of the N-point correlation functions are calculated…
By use of conformal field theory, we discover several exact factorizations of higher-order density correlation functions in critical two-dimensional percolation. Our formulas are valid in the upper half-plane, or any conformally equivalent…
There have been several spectral bounds for the percolation transition in networks, using spectrum of matrices associated with the network such as the adjacency matrix and the non-backtracking matrix. However they are far from being tight…
We exactly reformulate the lattice CP(N-1) spin model on a D dimensional torus as a loop model whose configurations correspond to the complete set of strong coupling graphs of the original system. A Monte Carlo algorithm is described and…
We study the expansion of the surface thickness in the 2-dimensional lattice Sine Gordon model in powers of the fugacity z. Using the expansion to order z**2, we derive lines of constant physics in the rough phase. We describe and test a…
Jamming and percolation transitions in the standard random sequential adsorption of particles on regular lattices are characterized by a universal set of critical exponents. The universality class is preserved even in the presence of…
We perform Monte Carlo simulations to determine the average excluded area $<A_{ex}>$ of randomly oriented squares, randomly oriented widthless sticks and aligned squares in two dimensions. We find significant differences between our results…
We use the single-cluster Monte Carlo update algorithm to simulate the Ising model on two-dimensional Poissonian random lattices with up to 80,000 sites which are linked together according to the Voronoi/Delaunay prescription. In one set of…
The spontaneous symmetry breaking in the Ising model can be equivalently described in terms of percolation of Wolff clusters. In O(n) spin models similar clusters can be built in a general way, and they are currently used to update these…
The pair contact process with diffusion (PCPD) is studied with a standard Monte Carlo approach and with simulations at fixed densities. A standard analysis of the simulation results, based on the particle densities or on the pair densities,…
In this article, we investigate both site and bond percolation on a weighted planar stochastic lattice (WPSL) which is a multi-multifractal and whose dual is a scale-free network. The characteristic properties of percolation is that it…
Series expansion methods are used to study directed bond percolation clusters on the square lattice whose lateral growth is restricted by a wall parallel to the growth direction. The percolation threshold $p_c$ is found to be the same as…
We consider long-range Bernoulli bond percolation on the $d$-dimensional hierarchical lattice in which each pair of points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $0<\alpha<d$ is…
We use SLE(6) paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice -- that is, the…
We study critical bond percolation on a seven-dimensional (7D) hypercubic lattice with periodic boundary conditions and on the complete graph (CG) of finite volume $V$. We numerically confirm that for both cases, the critical number density…
We have investigated both site and bond percolation on two dimensional lattice under the random rule and the product rule respectively. With the random rule, sites or bonds are added randomly into the lattice. From two candidates picked…
We derive the critical nearest-neighbor connectivity $g_n$ as $3/4$, $3(7-9p_c^{tri})/[4(5-4p_c^{tri})]$, and $3(2+7p_c^{tri})/[4(5-p_c^{tri})]$ for bond percolation on the square, honeycomb and triangular lattice respectively, where…
We consider geometrical clusters (i.e. domains of parallel spins) in the square lattice random field Ising model by varying the strength of the Gaussian random field, $\Delta$. In agreement with the conclusion of previous investigation…