Related papers: Percolation is Odd
Site-occupancy disorder, defined as the non-periodic occupation of lattice sites in a crystal structure, is a ubiquitous phenomenon in solid-state physics and chemistry. Examples are mineral solid solutions, synthetic non-stoichiometric…
A square lattice distribution of coupled oscillators that have heteroclinic cycle attractors is studied. In this system, we find a novel type of patterns that is spatially disordered and periodic in time. These patterns are limit cycle…
Percolation and jamming phenomena are investigated for random sequential deposition of rectangular needles on $d=2$ square lattices. Associated thresholds $p_c^{perc}$ and $p_c^{jam}$ are determined for various needle sizes. Their ratios…
We study the percolation of randomly rotating patchy particles on $11$ Archimedean lattices in two dimensions. Each vertex of the lattice is occupied by a particle, and in each model the patch size and number are monodisperse. When there…
We identify a structure in the spectra of 1d lattice models of interacting electrons, characterised by an anomalous gapped branch of elementary excitations. Focusing on a family of Bethe ansatz solvable models, where all excitations are…
Native protein folds often have a high degree of symmetry. We study the relationship between the symmetries of native proteins, and their designabilities -- how many different sequences encode a given native structure. Using a…
We present the results of study of random sequential adsorption of linear segments (needles) on sites of a square lattice. We show that the percolation threshold is a nonmonotonic function of the length of the adsorbed needle, showing a…
If a partition of a lattice in R^d is selfsimilar, it is called lattice substitution system (LSS). Such sets represent nonperiodic, but highly ordered structures. An important property of such structures is, whether they are model sets or…
We introduce a bond percolation procedure on a $D$-dimensional lattice where two neighbouring sites are connected by $N$ channels, each operated by valves at both ends. Out of a total of $N$, randomly chosen $n$ valves are open at every…
This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…
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…
Multilayer infrastructure is often interdependent, with nodes in one layer depending on nearby nodes in another layer to function. The links in each layer are often of limited length, due to the construction cost of longer links. Here, we…
Extension of symplectic geometry on manifolds to the supersymmetric case is considered. In the even case it leads to the even symplectic geometry (or, equivalently, to the geometry on supermanifolds endowed with a non-degenerate Poisson…
We study bond percolation in $\mathbb{Z}^d$ with an unbounded family of enhancements that enable additional bonds to act as open. A natural question is whether percolation occurs in this model if and only if percolation also occurs in the…
We show that the XYZ spin chain along the special line of couplings J_xJ_y+J_xJ_z+J_yJ_z=0 possesses a hidden N=(2,2) supersymmetry. This lattice supersymmetry is non-local and changes the number of sites. It extends to the full transfer…
We consider a correlated site percolation problem on a cubic lattice of size $L^3$, with $16\le L\le 512$. The sites of an initially full lattice are removed by a random walk of ${\cal N}=uL^3$ steps. When the parameter $u$ crosses a…
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…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
We calculate the dynamical behaviour of a hole in various spin backgrounds in infinite dimensions, where it can be determined exactly. We consider hypercubic lattices with two different types of spin backgrounds. On one hand we study an…
I calculated the exact site and bond percolation probability on lattice-like graphs for given dimension d: site percolation probability is 1/d and bond percolation probability is 0.5(d-1)^{-1/2}