相关论文: Local versus Global Knowledge in the Barabasi-Albe…

We perform an empirical study of the preferential attachment phenomenon in temporal networks and show that on the Web, networks follow a nonlinear preferential attachment model in which the exponent depends on the type of network…

Most of the networks observed in real life obey power-law degree distribution. It is hypothesized that the emergence of such a degree distribution is due to preferential attachment of the nodes. Barabasi-Albert model is a generative…

We propose a scale-free network model with a tunable power-law exponent. The Poisson growth model, as we call it, is an offshoot of the celebrated model of Barab\'{a}si and Albert where a network is generated iteratively from a small seed…

This paper presents the development of a new class of algorithms that accurately implement the preferential attachment mechanism of the Barab\'asi-Albert (BA) model to generate scale-free graphs. Contrary to existing approximate…

Most real complex networks -- such as protein interactions, social contacts, the internet -- are only partially known and available to us. While the process of exploring such networks in many cases resembles a random walk, it becomes a key…

Complex networks in different areas exhibit degree distributions with heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential…

We introduce a minimal network model which generates a modular structure in a self-organized way. To this end, we modify the Barabasi-Albert model into the one evolving under the principle of division and independence as well as growth and…

This paper mainly discusses the diffusion on complex networks with time-varying couplings. We propose a model to describe the adaptive diffusion process of local topological and dynamical information, and find that the Barabasi-Albert…

Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weight-driven models are considered.…

We define a class of growing networks in which new nodes are given a spatial position and are connected to existing nodes with a probability mechanism favoring short distances and high degrees. The competition of preferential attachment and…

We offer an example of an network model with a power law degree distribution, P(k) ~ k^{-alpha}, for nodes but which nevertheless has a well-defined geography and a nonzero threshold percolation probability for alpha>2, the range of…

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…

In recent years there has been considerable interest in the structure and dynamics of complex networks. One of the most studied networks is the linear Barab\'asi-Albert model. Here we investigate the nonlinear Barab\'asi-Albert growing…

In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…

The ability to sample random networks that can accurately represent real social contact networks is essential to the study of viral epidemics. The Barab\'asi-Albert model and its extensions attempt to capture reality by generating networks…

We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power law distribution of degree, linear preferential attachment of new links and a negative…

Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its…

Dating back to two famous experiments by the social-psychologist, Stanley Milgram, in the 1960s, the small-world phenomenon is the idea that all people are connected through a short chain of acquaintances that can be used to route messages.…

Reciprocity characterizes the information exchange between users in a network, and some empirical studies have revealed that social networks have a high proportion of reciprocal edges. Classical directed preferential attachment (PA) models,…

We introduce a site-wise domination criterion for local percolation models, which enables the comparison of one-arm probabilities even in the absence of stochastic domination. The method relies on a local-to-global principle: if, at each…