Related papers: A Generalized Preferential Attachment Model for Co…

Modeling complex networks has been the focus of much research for over a decade. Preferential attachment (PA) is considered a common explanation to the self organization of evolving networks, suggesting that new nodes prefer to attach to…

The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree…

At a continuous transition into a nonunique absorbing state, particle systems may exhibit nonuniversal critical behavior, in apparent violation of hyperscaling. We propose a generalized scaling theory for dynamic critical behavior at a…

Identifying power-law scaling in real networks - indicative of preferential attachment - has proved controversial. Critics argue that measuring the temporal evolution of a network directly is better than measuring the degree distribution…

We highlight intriguing features of complex networks that are grown by \emph{redirection}. In this mechanism, a target node is chosen uniformly at random from the pre-existing network nodes and the new node attaches either to this initial…

In the field of complex networks, hypergraph models have so far received significantly less attention than graphs. However, many real-life networks feature multiary relations (co-authorship, protein reactions) may therefore be modeled way…

We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, the probability to get connected to a site at…

We find assimpotics for the first $k$ highest degrees of the degree distribution in an evolving tree model combining the local choice and the preferential attachment. In the considered model, the random graph is constructd in the following…

We propose a generalized model for uniform recursive tree (URT) by introducing an imperfect growth process, which may generate disconnected components (clusters). The model undergoes an interesting phase transition from a singly connected…

Ever since the Barab\'{a}si-Albert (BA) scale-free network has been proposed, network modeling has been studied intensively in light of the network growth and the preferential attachment (PA). However, numerous real systems are featured…

In this paper, we propose a new class of distributions by exponentiating the random variables associated with the probability density functions of composite distributions. We also derive some mathematical properties of this new class of…

Preferential attachment models were shown to be very effective in predicting such important properties of real-world networks as the power-law degree distribution, small diameter, etc. Many different models are based on the idea of…

We show that to explain the growth of the citation network by preferential attachment (PA), one has to accept that individual nodes exhibit heterogeneous fitness values that decay with time. While previous PA-based models assumed either…

We propose and study a model of scale-free growing networks that gives a degree distribution dominated by a power-law behavior with a model-dependent, hence tunable, exponent. The model represents a hybrid of the growing networks based on…

We study three preferential attachment models where the parameters are such that the asymptotic degree distribution has infinite variance. Every edge is equipped with a non-negative i.i.d. weight. We study the weighted distance between two…

Every network scientist knows that preferential attachment combines with growth to produce networks with power-law in-degree distributions. How, then, is it possible for the network of American Physical Society journal collection citations…

Discriminating between competing explanatory models as to which is more likely responsible for the growth of a network is a problem of fundamental importance for network science. The rules governing this growth are attributed to mechanisms…

A generalization of a distribution increases the flexibility particularly in studying of a phenomenon and its properties. Many generalizations of continuous univariate distributions are available in literature. In this study, an…

We provide a general analytic solution to Herbert Simon's 1955 model for time-evolving novelty functions. This has far-reaching consequences: Simon's is a pre-cursor model for Barabasi's 1999 preferential attachment model for growing social…

In most networks, the connection between a pair of nodes is the result of their mutual affinity and attachment. In this letter, we will propose a Mutual Attraction Model to characterize weighted evolving networks. By introducing the initial…