Related papers: Distance evolutions in growing preferential attach…
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…
We consider the random walk attachment graph introduced by Saram\"{a}ki and Kaski and proposed as a mechanism to explain how behaviour similar to preferential attachment may appear requiring only local knowledge. We show that if the length…
Analytical results are presented for the structure of networks that evolve via a preferential-attachment-random-deletion (PARD) model in the regime of overall network growth and in the regime of overall contraction. The phase transition…
Given any two vertices u, v of a random geometric graph, denote by d_E(u,v) their Euclidean distance and by d_G(u,v) their graph distance. The problem of finding upper bounds on d_G(u,v) in terms of d_E(u,v) has received a lot of attention…
In this paper we consider a population process evolving on a dynamic random graph. The dynamic random graph is an Erd\H{o}s--R\'enyi graph that is resampled every time unit, independently of the previous ones, with `edge existence…
Using a simple model with link removals as well as link additions, we show that an evolving network is scale free with a degree exponent in the range of (2, 4]. We then establish a relation between the network evolution and a set of…
We introduce a new model of correlated randomly growing graphs and study the fundamental questions of detecting correlation and estimating aspects of the correlated structure. The model is simple and starts with any model of randomly…
We present analytical results for the effect of preferential node deletion on the structure of networks that evolve via node addition and preferential attachment. To this end, we consider a preferential-attachment-preferential-deletion…
There has been considerable recent interest in the properties of networks, such as citation networks and the worldwide web, that grow by the addition of vertices, and a number of simple solvable models of network growth have been studied.…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or…
We study diffusion-type equations supported on structures that are randomly varying in time. After settling the issue of well-posedness, we focus on the asymptotic behavior of solutions: our main result gives sufficient conditions for…
We study the time evolution of wave packets at the mobility edge of disordered non-interacting electrons in two and three spatial dimensions. The results of numerical calculations are found to agree with the predictions of scaling theory.…
We study logical limit laws for preferential attachment random graphs. In this random graph model, vertices and edges are introduced recursively: at time $1$, we start with vertices $0,1$ and $m$ edges between them. At step $n+1$ the vertex…
Stochasticity is introduced to a well studied class of recursively grown graphs: $(u,v)$-flower nets, which have power-law degree distributions as well as small-world properties (when $u=1$). The stochastic variant interpolates between…
When modeling a directed social network, one choice is to use the traditional preferential attachment model, which generates power-law tail distributions. In a traditional directed preferential attachment, every new edge is added…
The number of common friends (or connections) in a graph is a commonly used measure of proximity between two nodes. Such measures are used in link prediction algorithms and recommendation systems in large online social networks. We obtain…
The Newman-Watts model is given by taking a cycle graph of n vertices and then adding each possible edge $(i,j), |i-j|\neq 1 \mod n$ with probability $\rho/n$ for some $\rho>0$ constant. In this paper we add i.i.d. exponential edge weights…
We investigate spatial random graphs defined on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the…
Recently several authors have proposed stochastic evolutionary models for the growth of complex networks that give rise to power-law distributions. These models are based on the notion of preferential attachment leading to the ``rich get…