arXiv:1304.2016 [math.PR]AbstractReferencesReviewsResources
First critical probability for a problem on random orientations in $G(n,p)$
Sven Erick Alm, Svante Janson, Svante Linusson
Published 2013-04-07Version 1
We study the random graph $G(n,p)$ with a random orientation. For three fixed vertices $s,a,b$ in $G(n,p)$ we study the correlation of the events $a \to s$ and $s\to b$. We prove that asymptotically the correlation is negative for small $p$, $p<\frac{C_1}n$, where $C_1\approx0.3617$, positive for $\frac{C_1}n<p<\frac2n$ and up to $p=p_2(n)$. Computer aided computations suggest that $p_2(n)=\frac{C_2}n$, with $C_2\approx7.5$. We conjecture that the correlation then stays negative for $p$ up to the previously known zero at $\frac12$; for larger $p$ it is positive.
Comments: 15 pages, 3 figures
Related articles: Most relevant | Search more
arXiv:0804.1656 [math.PR] (Published 2008-04-10)
On percolation in random graphs with given vertex degrees
arXiv:0908.3778 [math.PR] (Published 2009-08-26)
Extremal Subgraphs of Random Graphs: an Extended Version
arXiv:1207.6717 [math.PR] (Published 2012-07-28)
On the triangle space of a random graph