Positive association of the oriented percolation cluster in randomly oriented graphs

Abstract : Consider any fixed graph whose edges have been randomly and independently oriented, and write {S ⇝ i} to indicate that there is an oriented path going from a vertex s ∈ S to vertex i. Narayanan (2016) proved that for any set S and any two vertices i and j, {S ⇝ i} and {S ⇝ j} are positively correlated. His proof relies on the Ahlswede-Daykin inequality, a rather advanced tool of probabilistic combinatorics. In this short note, I give an elementary proof of the following, stronger result: writing V for the vertex set of the graph, for any source set S, the events {S ⇝ i}, i ∈ V , are positively associated – meaning that the expectation of the product of increasing functionals of the family {S ⇝ i} for i ∈ V is greater than the product of their expectations. To show how this result can be used in concrete calculations, I also detail the example of percolation from the leaves of the randomly oriented complete binary tree of height n. Positive association makes it possible to use the Stein–Chen method to find conditions for the size of the percolation cluster to be Poissonian in the limit as n goes to infinity.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01649325
Contributor : François Bienvenu <>
Submitted on : Monday, November 27, 2017 - 2:24:04 PM
Last modification on : Thursday, April 4, 2019 - 1:18:21 AM

File

ms.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01649325, version 1
  • ARXIV : 1711.08815

Citation

François Bienvenu. Positive association of the oriented percolation cluster in randomly oriented graphs. 2017. ⟨hal-01649325⟩

Share

Metrics

Record views

303

Files downloads

29