Positive association of the oriented percolation cluster in randomly oriented graphs
From MaRDI portal
Publication:5222557
DOI10.1017/S0963548319000191zbMath1434.60033arXiv1711.08815WikidataQ127589723 ScholiaQ127589723MaRDI QIDQ5222557
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.08815
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Percolation (82B43)
Cites Work
- Unnamed Item
- Fundamentals of Stein's method
- Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
- Oriented percolation in two dimensions
- Correlation inequalities on some partially ordered sets
- Connections in Randomly Oriented Graphs
- An inequality for the weights of two families of sets, their unions and intersections
- Association of Random Variables, with Applications
This page was built for publication: Positive association of the oriented percolation cluster in randomly oriented graphs