Features and heterogeneities in growing network models
arXiv:1111.3652 · doi:10.1103/PhysRevE.85.066110
Abstract
Many complex networks from the World-Wide-Web to biological networks are growing taking into account the heterogeneous features of the nodes. The feature of a node might be a discrete quantity such as a classification of a URL document as personal page, thematic website, news, blog, search engine, social network, ect. or the classification of a gene in a functional module. Moreover the feature of a node can be a continuous variable such as the position of a node in the embedding space. In order to account for these properties, in this paper we provide a generalization of growing network models with preferential attachment that includes the effect of heterogeneous features of the nodes. The main effect of heterogeneity is the emergence of an "effective fitness" for each class of nodes, determining the rate at which nodes acquire new links. The degree distribution exhibits a multiscaling behaviour analogous to the the fitness model. This property is robust with respect to variations in the model, as long as links are assigned through effective preferential attachment. Beyond the degree distribution, in this paper we give a full characterization of the other relevant properties of the model. We evaluate the clustering coefficient and show that it disappears for large network size, a property shared with the Barabási-Albert model. Negative degree correlations are also present in the studied class of models, along with non-trivial mixing patterns among features. We therefore conclude that both small clustering coefficients and disassortative mixing are outcomes of the preferential attachment mechanism in general growing networks.
arXiv comment16 pages, 6 figures, revtex
References in corpus (29)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Community structure in social and biological networks
- Mixing patterns in networks
- Resolution limit in community detection
- Spatial Networks
- Mean-field theory for scale-free random networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Topology of evolving networks: local events and universality
- Connectivity of Growing Random Networks
- Identity and Search in Social Networks
- Organization of Growing Random Networks
- Bose-Einstein condensation in complex networks
- Modeling the Internet's Large-Scale Topology
- Crossover from Scale-Free to Spatial Networks
- Assessing the relevance of node features for network structure
- Mean field solution of the Ising model on a Barabasi-Albert network
- Modulated Scale-free Network in the Euclidean Space
- Curvature and temperature of complex networks
- Mean-field theory for clustering coefficients in Barabasi-Albert networks
- Evolving networks with disadvantaged long-range connections
- Multifractal Network Generator
- Human Sexual Contact Network as a Bipartite Graph
- A preferential attachment model with random initial degrees
- An extended formalism for preferential attachment in heterogeneous complex networks
- Preferential attachment in growing spatial networks
- Emergence of multiscaling in heterogeneous complex networks
- Simple rules govern finite-size effects in scale-free networks
Cited by in corpus (4)
- Ex-ante measure of patent quality reveals intrinsic fitness for citation-network growth
- Condensation and topological phase transitions in a dynamical network model with rewiring of the links
- Duality between preferential attachment and static random networks on hyperbolic spaces
- Modeling Friendship Networks among Agents with Personality Traits