Related papers: The Yule distribution and frailty--a note on spuri…

We introduce a new type of preferential attachment tree that includes choices in its evolution, like with Achlioptas processes. At each step in the growth of the graph, a new vertex is introduced. Two possible neighbor vertices are selected…

A Yule tree is the result of a branching process with constant birth and death rates. Such a process serves as an instructive null model of many empirical systems, for instance, the evolution of species leading to a phylogenetic tree.…

A preferential attachment model for a growing network incorporating deletion of edges is studied and the expected asymptotic degree distribution is analyzed. At each time step $t=1,2,\ldots$, with probability $\pi_1>0$ a new vertex with one…

Preferential attachment is an appealing edge generating mechanism for modeling social networks. It provides both an intuitive description of network growth and an explanation for the observed power laws in degree distributions. However,…

We introduce a collection of complex networks generated by a combination of preferential attachment and a previously unexamined process of "splitting" nodes of degree $k$ into $k$ nodes of degree 1. Four networks are considered, each…

A family of models of growing hypergraphs with preferential rules of new linking is introduced and studied. The model hypergraphs evolve via the hyperedge-based growth as well as the node-based one, thus generalizing the…

In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…

We propose a new preferential attachment-based network growth model in order to explain two properties of growing networks: (1) the power-law growth of node degrees and (2) the decay of node relevance. In preferential attachment models, the…

In now classic work, David Kendall (1966) recognized that the Yule process and Poisson process could be related by a (random) time change. Furthermore, he showed that the Yule population size rescaled by its mean has an almost sure…

Popularity is attractive -- this is the formula underlying preferential attachment, a popular explanation for the emergence of scaling in growing networks. If new connections are made preferentially to more popular nodes, then the resulting…

We study preferential attachment mechanisms in random graphs that are parameterized by (i) a constant bias affecting the degree-biased distribution on the vertex set and (ii) the distribution of times at which new vertices are created by…

We study an asymptotical behavior of the maximal degree in the degree distribution in an evolving tree model combining the local choice and the Mori's preferential attachment. In the considered model, the random graph is constructed in the…

Paper proposes a model of large networks based on a random preferential attachment graph with addition of complete subgraphs (cliques). The proposed model refers to models of random graphs following the nonlinear preferential attachment…

We introduce a network growth model in which the preferential attachment probability includes the fitness vertex and the Euclidean distance between nodes. We grow a planar network around its barycenter. Each new site is fixed in space by…

In this work we introduce a variant of the Yule-Simon model for preferential growth by incorporating a finite kernel to model the effects of bounded memory. We characterize the properties of the model combining analytical arguments with…

We study the growth of a directed network, in which the growth is constrained by the cost of adding links to the existing nodes. We propose a new preferential-attachment scheme, in which a new node attaches to an existing node i with…

Complex systems can be characterized by classes of equivalency of their elements defined according to system specific rules. We propose a generalized preferential attachment model to describe the class size distribution. The model…

We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…

The purpose of this work is to describe a duality between a fragmentation associated to certain Dirichlet distributions and a natural random coagulation. The dual fragmentation and coalescent chains arising in this setting appear in the…

The network properties of a graph ensemble subject to the constraints imposed by the expected degree sequence are studied. It is found that the linear preferential attachment is a fundamental rule, as it keeps the maximal entropy in sparse…