Abstract. We study random graphs, both G(n, p) and G(n,m), with random orien-tations on the edges. For three fixed distinct vertices s, a, b we study the correlation, in the combined probability space, of the events {a → s} and {s → b}. For G(n, p), we prove that there is a pc = 1/2 such that for a fixed p < pc the correlation is negative for large enough n and for p> pc the correlation is positive for large enough n. We conjecture that for a fixed n ≥ 27 the correlation changes sign three times for three critical values of p. For G(n,m) it is similarly proved that, with p = m/
We investigate degree-degree correlations for scale-free graph sequences. The main conclusion of thi...
Barabási and Albert [1] suggested modeling scale-free networks by the following random graph process...
We recently introduced a robust approach to the derivation of sharp asymptotic formula for correlati...
We study the random graph G(n, p) with a random orientation. For three fixed vertices s, a, b in G(n...
We study the random graph G (n,p) with a random orientation. For three fixed vertices s, a, b in G(n...
Abstract. Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertice...
We prove that in a random tournament the events $\{s\rightarrow a\}$ (meaning that there is a direct...
In this thesis we consider models of random graphs where, unlike in the classical models G (n, p) t...
The following two conjectures arose in the work of Grimmett and Winkler, and Pemantle: the uniforml...
We study correlations in the multispecies TASEP on a ring. Results on the correlation of two adjacen...
A numerical study of optimal paths in the directed polymer model shows that the paths are similar t...
AbstractGiven a bipartite connected finite graph G=(V, E) and a vertex v0∈V, we consider a uniform p...
AbstractLet G(n, p) be a graph on n vertices in which each possible edge is presented independently ...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be ve...
We investigate degree-degree correlations for scale-free graph sequences. The main conclusion of thi...
Barabási and Albert [1] suggested modeling scale-free networks by the following random graph process...
We recently introduced a robust approach to the derivation of sharp asymptotic formula for correlati...
We study the random graph G(n, p) with a random orientation. For three fixed vertices s, a, b in G(n...
We study the random graph G (n,p) with a random orientation. For three fixed vertices s, a, b in G(n...
Abstract. Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertice...
We prove that in a random tournament the events $\{s\rightarrow a\}$ (meaning that there is a direct...
In this thesis we consider models of random graphs where, unlike in the classical models G (n, p) t...
The following two conjectures arose in the work of Grimmett and Winkler, and Pemantle: the uniforml...
We study correlations in the multispecies TASEP on a ring. Results on the correlation of two adjacen...
A numerical study of optimal paths in the directed polymer model shows that the paths are similar t...
AbstractGiven a bipartite connected finite graph G=(V, E) and a vertex v0∈V, we consider a uniform p...
AbstractLet G(n, p) be a graph on n vertices in which each possible edge is presented independently ...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be ve...
We investigate degree-degree correlations for scale-free graph sequences. The main conclusion of thi...
Barabási and Albert [1] suggested modeling scale-free networks by the following random graph process...
We recently introduced a robust approach to the derivation of sharp asymptotic formula for correlati...