相关论文: Diameters in preferential attachment models
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 consider a model for complex networks that was recently proposed as a model for complex networks by Krioukov et al. In this model, nodes are chosen randomly inside a disk in the hyperbolic plane and two nodes are connected if they are at…
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…
We propose a random graph model with preferential attachment rule and \emph{edge-step functions} that govern the growth rate of the vertex set. We study the effect of these functions on the empirical degree distribution of these random…
We generalize the scale-free network model of Barab\`asi and Albert [Science 286, 509 (1999)] by proposing a class of stochastic models for scale-free interdependent networks in which interdependent nodes are not randomly connected but…
We propose a simple preferential attachment model of growing network using the complementary probability of Barab\'asi-Albert (BA) model, i.e., $\Pi(k_i) \propto 1-\frac{k_i}{\sum_j k_j}$. In this network, new nodes are preferentially…
We investigate two asymptotic properties of a spatial preferential-attachment model introduced by E. Jacob and P. M\"orters (2013). First, in a regime of strong linear reinforcement, we show that typical distances are at most of…
The preferential attachment model is a natural and popular random graph model for a growing network that contains very well-connected ``hubs''. We study the higher-order connectivity of such a network by investigating the topological…
In this paper, we analyze the local clustering coefficient of preferential attachment models. A general approach to preferential attachment was introduced in earlier, where a wide class of models (PA-class) was defined in terms of…
The spatial preferred attachment (SPA) model is a model for networked information spaces such as domains of the World Wide Web, citation graphs, and on-line social networks. It uses a metric space to model the hidden attributes of the…
Identifying the generating mechanism of a network is challenging as, more often than not, only snapshots are available, but not the full evolution. One candidate for the generating mechanism is preferential attachment which, in its simplest…
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is central in fine-grained complexity. In undirected graphs, the Strong Exponential Time Hypothesis (SETH) yields a lower bound on the time vs.…
In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent $\tau \in (2,3)$. We assign independent and identically distributed (i.i.d.)\ weights to…
Preferential attachment networks with power law exponent $\tau>3$ are known to exhibit a phase transition. There is a value $\rho_{\rm c}>0$ such that, for small edge densities $\rho\leq \rho_c$ every component of the graph comprises an…
Global degree/strength based preferential attachment is widely used as an evolution mechanism of networks. But it is hard to believe that any individual can get global information and shape the network architecture based on it. In this…
We propose a model that generates a new class of networks exhibiting power-law degree distribution with a spectrum of exponents depending on the number of links ($m$) with which incoming nodes join the existing network. Unlike the…
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…
The conditional diameter of a connected graph $\Gamma=(V,E)$ is defined as follows: given a property ${\cal P}$ of a pair $(\Gamma_1, \Gamma_2)$ of subgraphs of $\Gamma$, the so-called \emph{conditional diameter} or ${\cal P}$-{\em…
We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…
Preferential attachment is often suggested to be the underlying mechanism of the growth of a network, largely due to that many real networks are, to a certain extent, scale-free. However, such attribution is usually made under debatable…