Related papers: On the evolution of scale-free graphs
We study the synchronization transition in scale-free networks that display power-law asymptotic behaviors in their degree distributions. The critical coupling strength and the order-parameter critical exponent derived by the mean field…
We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics---the double-edge swap, corresponding to degree-preserving randomization of the…
A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the…
We consider a class of scale-free inhomogeneous random graphs, which includes some long-range percolation models. We study the maximum degree in such graphs in a growing observation window and show that its limiting distribution is Frechet.…
We introduce perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equations. These models are local, in the sense that at each step…
A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…
We propose a random bipartite graph with weights assigned to both parts of the vertex sets. Edges are formed independently with probabilities that depend on these weights. This bipartite graph naturally gives rise to a random intersection…
We show how scale-free degree distributions can emerge naturally from growing networks by using random walks for selecting vertices for attachment. This result holds for several variants of the walk algorithm and for a wide range of…
We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numerically. The obtained analytical solutions show that the…
The emergence of clustering and coarsening in crowded ensembles of self-propelled agents is studied using a lattice model in one-dimension. The persistent exclusion process, where particles move at directions that change randomly at a low…
A majority of studied models for scale-free networks have degree distributions with exponents greater than $2$. Real networks, however, can demonstrate essentially more heavy-tailed degree distributions. We explore two models of scale-free…
We consider an infinite spatial inhomogeneous random graph model with an integrable connection kernel that interpolates nicely between existing spatial random graph models. Key examples are versions of the weight-dependent random connection…
In this paper we investigate geometric properties of graphs generated by a preferential attachment random graph model with edge-steps. More precisely, at each time $t\in\mathbb{N}$, with probability $p$ a new vertex is added to the graph (a…
We study stochastic processes that generate non-growing complex networks without self-loops and multiple edges (simple graphs). The work concentrates on understanding and formulation of constraints which keep the rewiring stochastic…
For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…
The rate equations are used to study the scale-free behavior of the weight distribution in evolving networks whose topology is determined only by degrees of preexisting vertices. An analysis of these equations shows that the degree…
Suppose that you add rigid bars between points in the plane, and suppose that a constant fraction $q$ of the points moves freely in the whole plane; the remaining fraction is constrained to move on fixed lines called sliders. When does a…
A recent paper "Emergence of scaling in random networks" (cond-mat/9910332) by Barabasi and Albert proposes a growth mechanism to produce a stationary scale free distribution of the number of edges per node in large networks such as the…
Geometric scale-free random graphs are popular models for networks that exhibit as heavy-tailed degree distributions, small-worldness and high clustering. In these models, vertices have weights that cause the heavy-tailed degrees and are…