Related papers: Growing Random Networks with Fitness

We propose a network model with a fixed number of nodes and links with a dynamics which favors links between nodes differing in connectivity. Parameter regimes where the degree distributions follow power-laws, P(k) ~ k^-gamma, high…

Several studies on real complex networks from different fields as biology, economy, or sociology have shown that the degree of nodes (number of edges connected to each node) follows a scale-free power-law distribution like $P(k)\approx…

We introduce a growing network evolution model with nodal attributes. The model describes the interactions between potentially violent V and non-violent N agents who have different affinities in establishing connections within their own…

Large real-life complex networks are often modeled by various random graph constructions and hundreds of further references therein. In many cases it is not at all clear how the modeling strength of differently generated random graph model…

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…

A network is scale-free if its connectivity density function is proportional to a power-law distribution. Scale-free networks may provide an explanation for the robustness observed in certain physical and biological phenomena, since the…

In a recent paper, Krapivsky and Redner (Phys. Rev. E, 71 (2005) 036118) proposed a new growing network model with new nodes being attached to a randomly selected node, as well to all ancestors of the target node. The model leads to a…

This study proposes a novel network growth model named ComAwareNetGrowth which aims to mimic evolution of real-world social networks. The model works in discrete time. At each timestep, a new link (I) within-community or (II) anywhere in…

Based on the formation of triad junctions, the proposed mechanism generates networks that exhibit extended rather than single power law behavior. Triad formation guarantees strong neighborhood clustering and community-level characteristics…

The structure and the properties of complex networks essentially depend on the way how nodes get connected to each other. We assume here that each node has a feature which attracts the others. We model the situation by assigning two numbers…

We found that models of evolving random networks exhibit dynamic scaling similar to scaling of growing surfaces. It is demonstrated by numerical simulations of two variants of the model in which nodes are added as well as removed [Phys.…

The value of a social network is generally determined by its size and the connectivity of its nodes. But since some of the nodes may be fake ones and others that are dormant, the question of validating the node counts by statistical tests…

We evolve network topology of an asymmetrically connected threshold network by a simple local rewiring rule: quiet nodes grow links, active nodes lose links. This leads to convergence of the average connectivity of the network towards the…

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…

Are biological networks different from other large complex networks? Both large biological and non-biological networks exhibit power-law graphs (number of nodes with degree k, N(k) ~ k-b) yet the exponents, b, fall into different ranges.…

The evolution of complex networks is governed by both growing rules and internal properties. Most evolving network models (e.g. preferential attachment) emphasize on the growing strategy, while neglecting the characteristics of individual…

We study the dynamical properties of a finite dynamical network composed of two interacting populations, namely; extrovert ($a$) and introvert ($b$). In our model, each group is characterized by its size ($N_a$ and $N_b$) and preferred…

We study a network formation game where agents receive benefits by forming connections to other agents but also incur both direct and indirect costs from the formed connections. Specifically, once the agents have purchased their…

Scale-free (SF) networks and small world networks have been found to occur in very diverse contexts. It is this striking universality which makes one look for widely applicable mechanisms which lead to the formation of such networks. In…

Although recent research on social networks emphasizes microscopic dynamics such as retweets and social connectivity of an individual user, we focus on macroscopic growth dynamics of social network link formation. Rather than focusing on…