1 January 2009 in Electronic Journal of Probability
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and then have a closer look at the temporal evolution of the degrees of individual vertices, which we describe in terms of large and moderate deviation principles. Using these results, we expose an interesting phase transition: in cases of strong preference of large degrees, eventually a single vertex emerges forever as vertex of maximal degree, whereas in cases of weak preference, the vertex of maximal degree is changing infinitely often. Loosely speaking, the transition between the two phases occurs in the case when a new edge is attached to an existing vertex with a probability proportional to the root of its current degree.
1 April 2015 in The Annals of Applied Probability
We define a class of growing networks in which new nodes are given a spatial position and are connected to existing nodes with a probability mechanism favoring short distances and high degrees. The competition of preferential attachment and spatial clustering gives this model a range of interesting properties. Empirical degree distributions converge to a limit law, which can be a power law with any exponent $\tau>2$. The average clustering coefficient of the networks converges to a positive limit. Finally, a phase transition occurs in the global clustering coefficients and empirical distribution of edge lengths when the power-law exponent crosses the critical value $\tau=3$. Our main tool in the proof of these results is a general weak law of large numbers in the spirit of Penrose and Yukich.
1 January 2009 in The Annals of Probability
The parabolic Anderson problem is the Cauchy problem for the heat equation ∂tu(t, z)=Δu(t, z)+ξ(z)u(t, z) on (0, ∞)×ℤd with random potential (ξ(z):z∈ℤd). We consider independent and identically distributed potentials, such that the distribution function of ξ(z) converges polynomially at infinity. If u is initially localized in the origin, that is, if $u(0,{z})=𝟙_{0}({z})$, we show that, as time goes to infinity, the solution is completely localized in two points almost surely and in one point with high probability. We also identify the asymptotic behavior of the concentration sites in terms of a weak limit theorem.
1 January 2013 in The Annals of Probability
We study a dynamical random network model in which at every construction step a new vertex is introduced and attached to every existing vertex independently with a probability proportional to a concave function $f$ of its current degree. We give a criterion for the existence of a giant component, which is both necessary and sufficient, and which becomes explicit when $f$ is linear. Otherwise it allows the derivation of explicit necessary and sufficient conditions, which are often fairly close. We give an explicit criterion to decide whether the giant component is robust under random removal of edges. We also determine asymptotically the size of the giant component and the empirical distribution of component sizes in terms of the survival probability and size distribution of a multitype branching random walk associated with $f$.
3 August 2006 in Communications in Mathematical Physics