ABSTRACT. Grimmett’s random-orientation percolation is formulated as follows. The square lattice is used to generate an oriented graph such that each edge is oriented rightwards (resp. upwards) with probability p and leftwards (resp. downwards) otherwise. We consider a variation of Grimmett’s model proposed by Hegarty, in which edges are oriented away from the origin with probability p, and towards it with probability 1 − p, which implies rotational instead of translational symmetry. We show that both models could be considered as special cases of random-oriented percolation in the NE-quadrant, provided that the critical value for the latter is 12. As a corollary, we unconditionally obtain a non-trivial lower bound for the critical value of...
Let a random geometric graph be defined in the supercritical regime for the existence of a unique in...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
Zhang found a simple, elegant argument deducing the nonexistence of an infinite open cluster in cert...
Grimmett's random-orientation percolation is formulated as follows. The square lattice is used to ge...
Grimmett\u27s random-orientation percolation is formulated as follows. The square lattice is used to...
We consider a percolation model which consists of oriented lines placed randomly on the plane. The l...
A new site percolation model, directed spiral percolation (DSP), under both directional and rotation...
Directed spiral percolation (DSP), percolation under both directional and rotational constraints, is...
We consider independent edge percolation models on Z, with edge occupation probabilities. We prove t...
Percolation under rotational constraint is studied on the square and triangular lattices by three di...
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of...
We consider random walk and self-avoiding walk whose 1-step distribu-tion is given by D, and oriente...
We make use of the recent proof that the critical probability for percolation on random Voronoi tess...
We consider an inhomogeneous oriented percolation model introduced by de Lima, Rolla and Valesin. In...
We investigate the percolation thresholds of both random and invasion percolation in two and three d...
Let a random geometric graph be defined in the supercritical regime for the existence of a unique in...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
Zhang found a simple, elegant argument deducing the nonexistence of an infinite open cluster in cert...
Grimmett's random-orientation percolation is formulated as follows. The square lattice is used to ge...
Grimmett\u27s random-orientation percolation is formulated as follows. The square lattice is used to...
We consider a percolation model which consists of oriented lines placed randomly on the plane. The l...
A new site percolation model, directed spiral percolation (DSP), under both directional and rotation...
Directed spiral percolation (DSP), percolation under both directional and rotational constraints, is...
We consider independent edge percolation models on Z, with edge occupation probabilities. We prove t...
Percolation under rotational constraint is studied on the square and triangular lattices by three di...
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of...
We consider random walk and self-avoiding walk whose 1-step distribu-tion is given by D, and oriente...
We make use of the recent proof that the critical probability for percolation on random Voronoi tess...
We consider an inhomogeneous oriented percolation model introduced by de Lima, Rolla and Valesin. In...
We investigate the percolation thresholds of both random and invasion percolation in two and three d...
Let a random geometric graph be defined in the supercritical regime for the existence of a unique in...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
Zhang found a simple, elegant argument deducing the nonexistence of an infinite open cluster in cert...