Fetching the paper…
Reading the bibliography…
Given a graph $G$, we consider the model where $G$ is given a random orientation by giving each edge a random direction.
Theodore E. Harris, A lower bound for the critical probability in a certain percolation process. Proc. Cambridge Philos. Soc
1960
Earlier work this paper cites.
Colin Mc Diarmid, General Percolation and random Adv. Appl. Prob
1981
Earlier work this paper cites.
Eric Babson, Anders Björner, Svante Linusson, John Shareshian, and Volkmar Welker, Complexes of not i i -connected graphs
1999
Earlier work this paper cites.
Geoffrey R. Grimmett, Percolation
1999
Earlier work this paper cites.
Jacob van den Berg and Jeff Kahn, A correlation inequality for connection events in percolation, Annals of Probability
2001
Cited alongside, same era.
Geoffrey R. Grimmett, Infinite Paths in Randomly Oriented Lattices, Random Structures and Algorithms
2001
Cited alongside, same era.
Olle Häggström, Probability on Bunkbed Graphs, Proceedings of FPSAC’03, Formal Power Series and Algebraic Combinatorics
2003
Cited alongside, same era.
Jacob van den Berg, Olle Häggström and Jeff Kahn, Some conditional correlation inequalities for percolation on related prcesses, Rand. Structures Algorithms
2006
Cited alongside, same era.
Jakob Jonsson, Simplicial Complexes of Graphs
2008
Later among the works it cites.
Svante Linusson, On percolation and the bunkbed conjecture, Preprint 2008
2008
Later among the works it cites.
Sven Erick Alm and Svante Linusson, A counter-intuitive correlation in a random tournament, Preprint 2009
2009
Closest in time.
Sven Erick Alm and Svante Linusson, Correlations for paths in random orientations of G ( n , p ) G(n,p) , Preprint 2009
2009
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…