Related papers: Polynomial sequences for bond percolation critical…
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…
In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…
We study mixed site-bond directed percolation on 2D and 3D lattices by using time-dependent simulations. Our results are compared with rigorous bounds recently obtained by Liggett and by Katori and Tsukahara. The critical fractions…
We simulate directed site percolation on two lattices with 4 spatial and 1 time-like dimensions (simple and body-centered hypercubic in space) with the standard single cluster spreading scheme. For efficiency, the code uses the same…
In this note we classify all triples (a,b,i) such that there is a convex lattice polygon P with area a, and b respectively i lattice points on the boundary respectively in the interior. The crucial lemma for the classification is the…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…
We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…
We present an alternative geometric representation for the eleven Archimedean lattices, in which each site and bond is uniquely labeled by an ordered pair of integers and characterized via a modular function. This structured labeling…
We consider a long-range percolation model on homogeneous oriented trees with several lengths. We obtain the critical surface as the set of zeros of a specific polynomial with coefficients depending explicitly on the lengths and the degree…
We introduce the Weighted Planar Stochastic Porous Lattice (WPSPL), a geometrically disordered substrate generated by iteratively subdividing a unit square. At each step a block is selected with probability proportional to its area, divided…
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…
Consider Bernoulli bond percolation on a locally finite, connected graph $G$ and let $p_{\mathrm{cut}}$ be the threshold corresponding to a "first-moment method" lower bound. Kahn (\textit{Electron.\ Comm.\ Probab.\ Volume 8, 184-187.}…
We studied the rigidity percolation (RP) model for aperiodic (quasi-crystal) lattices. The RP thresholds (for bond dilution) were obtained for several aperiodic lattices via computer simulation using the "pebble game" algorithm. It was…
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…
In this work, we study the critical long-range percolation on $\mathbb{Z}$, where an edge connects $i$ and $j$ independently with probability $1-\exp\{-\beta |i-j|^{-2}\}$ for some fixed $\beta>0$. Viewing this as a random electric network…
The star-triangle transformation is used to obtain an equivalence extending over the set of all (in)homogeneous bond percolation models on the square, triangular and hexagonal lattices. Among the consequences are box-crossing (RSW)…
In many areas of research it is interesting how lattices can be filled with particles that have no nearest neighbors, or they are in limited quantities. Examples may be found in statistical physics, chemistry, materials science, discrete…
Let G_n be a sequence of finite transitive graphs with vertex degree d=d(n) and |G_n|=n. Denote by p^t(v,v) the return probability after t steps of the non-backtracking random walk on G_n. We show that if p^t(v,v) has quasi-random…
We use the finite lattice method to count the number of punctured staircase and self-avoiding polygons with up to three holes on the square lattice. New or radically extended series have been derived for both the perimeter and area…
The problem of percolation along sites of square lattice is studied. The number of contours being external boundaries for finite clusters has been estimated using geometric considerations. This estimation makes it possible to determine more…