Related papers: On the oddness of percolation
Inspired by Bruggesser-Mani's line shellings of polytopes, we introduce line shellings for the lattice of flats of a matroid: given a normal complex for a Bergman fan of a matroid induced by a building set, we show that the lexicographic…
We consider a generalised oriented site percolation model (GOSP) on $\mathbb Z^d$ with arbitrary neighbourhood. The key additional difficulties as compared to standard oriented percolation (OP) are the lack of symmetry and, in two…
We give a geometrically exact treatment of percolation through voids around assemblies of randomly placed impermeable barrier particles, introducing a computationally inexpensive approach to finding critical barrier density thresholds…
We state and prove a form of Bott periodicity (for $U(n)$) in an algebraic setting (so, $GL(n)$) which makes sense over $\mathbb{Z}$, which also specializes to Bott periodicity in the usual sense (hence giving yet another proof of classical…
This paper is an up-to-date introduction to the problem of uniqueness versus non-uniqueness of infinite clusters for percolation on ${\mathbb{Z}}^d$ and, more generally, on transitive graphs. For iid percolation on ${\mathbb{Z}}^d$,…
Effective action of center vortices in SU(2) lattice gauge theory is investigated by studying the correlation between the action density on their worldsheets and their geometric properties. It turns out that center vortices are rigid,…
We show that a site percolation is a stronger model than a bond percolation. We use the van den Berg -- Kesten (vdBK) inequality to prove that site percolation on a neighborhood of a vertex of degree $4$ cannot be simulated even…
This article presents a Monte Carlo study on bond percolation in distorted square and triangular lattices. The distorted lattices are generated by dislocating the sites from their regular positions. The amount and direction of the…
Equip the edges of the lattice $\mathbb{Z}^2$ with i.i.d. random capacities. A law of large numbers is known for the maximal flow crossing a rectangle in $\mathbb{R}^2$ when the side lengths of the rectangle go to infinity. We prove that…
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…
Numerical simulations and finite-size scaling analysis have been carried out to study standard and inverse percolation of straight rigid rods on triangular lattices. In the case of standard (inverse) percolation, the lattice is initially…
Percolation theory is usually applied to lattices with a uniform probability p that a site is occupied or that a bond is closed. The more general case, where p is a function of the position x, has received less attention. Previous studies…
Mixed-wet percolation was introduced recently in the context of two-phase flow in porous media. In this model, the sites of the primal lattice are occupied with a certain probability $p$, and bonds are placed on the dual lattice between two…
We investigate variations of the well-known Achlioptas percolation problem, which uses the method of probing sites when building up a lattice system, or probing links when building a network, ultimately resulting in the delay of the…
In order to investigate the dependence on lattice size of several observables in percolation, the Hoshen-Kopelman algorithm was modified so that growing lattices could be simulated. By this way, when simulating a lattice of size L, lattices…
We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are…
A novel type of self-organized lattice in which chaotic defects are arranged periodically is reported for a coupled map model of open flow. We find that temporally chaotic defects are followed by spatial relaxation to an almost periodic…
A systematic program is developed for analyzing and cancelling local anomalies on networks of intersecting orbifold planes in the context of M-theory. Through a delicate balance of factors, it is discovered that local anomaly matching on…
We report some novel properties of a square lattice filled with white sites, randomly occupied by black sites (with probability $p$). We consider connections up to second nearest neighbours, according to the following rule. Edge-sharing…
We analyze the problem of quadrangulating a $n$-sided patch, each side at its boundary subdivided into a given number of edges, using a single irregular vertex (or none, when $n = 4$) that breaks the otherwise fully regular lattice. We…