Percolation and first-passage percolation on oriented graphs
From MaRDI portal
Abstract: We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for the existence of an infinite cluster may be direction-dependent. Then, we prove that the phase transition in a given direction is sharp, and study the links between percolation and first-passage percolation on these oriented graphs.
Recommendations
Cites work
- 50 Years of First-Passage Percolation
- A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- A new proof of the sharpness of the phase transition for Bernoulli percolation on \(\mathbb{Z}^d\)
- Convex Analysis
- Correction to: ``A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- Domination by product measures
- First-passage percolation, network flows and electrical resistances
- scientific article; zbMATH DE number 3971949 (Why is no real title available?)
- Percolation
- Some limit theorems for percolation processes with necessary and sufficient conditions
- Survival of discrete time growth models, with applications to oriented percolation
- The supercritical phase of percolation is well behaved
Cited in
(18)- Oriented percolation in a random environment
- Poisson percolation on the oriented square lattice
- On a property of random-oriented percolation in a quadrant
- Infinite paths in randomly oriented lattices
- First passage percolation on locally treelike networks. I. Dense random graphs
- scientific article; zbMATH DE number 4070918 (Why is no real title available?)
- scientific article; zbMATH DE number 1380617 (Why is no real title available?)
- Competing first passage percolation on random regular graphs
- Monotonicity and phase diagram for multirange percolation on oriented trees
- Asymptotics of First-Passage Percolation on One-Dimensional Graphs
- Forward clusters for degenerate random environments
- On the random-oriented percolation
- Oriented percolation in one-dimensional \(1/|x - y|^2\) percolation models
- A note on oriented percolation with inhomogeneities and strict inequalities
- A non-oriented first passage percolation model and statistical invariance by time reversal
- The number of open paths in oriented percolation
- Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
- First passage percolation on nilpotent Cayley graphs and beyond
This page was built for publication: Percolation and first-passage percolation on oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064863)