We study competition of two spreading colors starting from single sources on the configuration model with i.i.d. degrees following a power-law distribution with exponent τ ∈ (2, 3). In this model two colors spread with a fixed but not necessarily equal speed on the unweighted random graph. We show that if the speeds are not equal, then the faster color paints almost all vertices, while the slower color can paint only a random subpolynomial fraction of the vertices. We investigate the case when the speeds are equal and typical distances in a follow-up paper
We study first passage percolation on the configuration model. Assuming that each edge has an indepe...
We consider a conditionally Poisson random-graph model in which the mean degrees, “capacities,” foll...
In this paper we study a random graph with N nodes, where node j has degree Dj and {Dj} N j=1 are i....
Abstract. We study competition of two spreading colors starting from single sources on the configura...
\u3cp\u3eWe study competition of two spreading colors starting from single sources on the configurat...
We study competition of two spreading colors starting from single sources on the configuration model...
We prove nonuniversality results for first-passage percolation on the configuration model with indep...
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in th...
We prove results for first-passage percolation on the configuration model with degrees having asympt...
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in th...
In this thesis we introduce and study two probabilistic models of competition and their applications...
A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the ...
We study first passage percolation on the configuration model. Assuming that each edge has an indepe...
We consider a conditionally Poisson random-graph model in which the mean degrees, “capacities,” foll...
In this paper we study a random graph with N nodes, where node j has degree Dj and {Dj} N j=1 are i....
Abstract. We study competition of two spreading colors starting from single sources on the configura...
\u3cp\u3eWe study competition of two spreading colors starting from single sources on the configurat...
We study competition of two spreading colors starting from single sources on the configuration model...
We prove nonuniversality results for first-passage percolation on the configuration model with indep...
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in th...
We prove results for first-passage percolation on the configuration model with degrees having asympt...
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in th...
In this thesis we introduce and study two probabilistic models of competition and their applications...
A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the ...
We study first passage percolation on the configuration model. Assuming that each edge has an indepe...
We consider a conditionally Poisson random-graph model in which the mean degrees, “capacities,” foll...
In this paper we study a random graph with N nodes, where node j has degree Dj and {Dj} N j=1 are i....