Rate equation approach for correlations in growing network models

Abstract

We propose a rate equation approach to compute two vertex correlations in scale-free growing network models based in the preferential attachment mechanism. The formalism, based on previous work of Szabó \textit{et al.} [Phys. Rev. E \textbf{67} 056102 (2002)] for the clustering spectrum, measuring three vertex correlations, is based on a rate equation in the continuous degree and time approximation for the average degree of the nearest neighbors of vertices of degree $k$, with an appropriate boundary condition. We study the properties of both two and three vertex correlations for linear preferential attachment models, and also for a model yielding a large clustering coefficient. The expressions obtained are checked by means of extensive numerical simulations. The rate equation proposed can be generalized to more sophisticated growing network models, and also extended to deal with related correlation measures. As an example, we consider the case of a recently proposed model of weighted networks, for which we are able to compute a weighted two vertex correlation function, taking into account the strength of the interactions between connected vertices.

References in corpus (37)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Error and attack tolerance of complex networks
• Epidemic spreading in scale-free networks
• Lethality and centrality in protein networks
• Assortative mixing in networks
• The diameter of the world wide web
• The architecture of complex weighted networks
• Evolution of networks
• Mixing patterns in networks
• Specificity and stability in topology of protein networks
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Hierarchical Organization in Complex Networks
• Epidemic dynamics and endemic states in complex networks
• Dynamical and correlation properties of the Internet
• 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
• Growing Scale-Free Networks with Tunable Clustering
• Organization of Growing Random Networks
• Scale-Free Networks are Ultrasmall
• Velocity and hierarchical spread of epidemic outbreaks in scale-free networks
• Large-scale topological and dynamical properties of Internet
• Weighted evolving networks: coupling topology and weights dynamics
• Epidemic spreading in correlated complex networks
• Absence of epidemic threshold in scale-free networks with connectivity correlations
• Class of correlated random networks with hidden variables
• Growing Scale-Free Networks with Small World Behavior
• Generic scale of the "scale-free" growing networks
• Modeling the evolution of weighted networks
• Resilience to damage of graphs with degree correlations
• Structural transitions in scale-free networks
• Diffusion-annihilation processes in complex networks
• Topology and correlations in structured scale-free networks
• Absence of kinetic effects in reaction-diffusion processes in scale-free networks
• Disease Spreading in Structured Scale-Free Networks

Cited by in corpus (41)

• Preferential attachment in the growth of social networks: the case of Wikipedia
• Bipartite Graphs as Models of Complex Networks
• Non-equilibrium dynamics of language games on complex networks
• Network analysis identifies weak and strong links in a metapopulation system
• Comparison of voter and Glauber ordering dynamics on networks
• Percolation on correlated networks
• Tuning clustering in random networks with arbitrary degree distributions
• The effects of spatial constraints on the evolution of weighted complex networks
• Evolution of a large online social network
• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• Relating Topological Determinants of Complex Networks to Their Spectral Properties: Structural and Dynamical Effects
• Random walks on complex trees
• Zero Pearson Coefficient for Strongly Correlated Growing Trees
• Random Sierpinski network with scale-free small-world and modular structure
• Evolving small-world scale-free networks consist of cliques
• Correlations in Bipartite Collaboration Networks
• Intrinsic degree-correlations in static model of scale-free networks
• Clustering of random scale-free networks
• Social Diversity Reduces the Complexity and Cost of Fostering Fairness
• Steady-State Dynamics of the Forest Fire Model on Complex Networks
• Clustering Phase Transitions and Hysteresis: Pitfalls in Constructing Network Ensembles
• Walks on weighted networks
• Correlations in random Apollonian network
• Local-world evolving networks with tunable clustering
• Evolving networks by merging cliques
• Slow dynamics and rare-region effects in the contact process on weighted tree networks
• Competition for Popularity in Bipartite Networks
• Generating random networks with given degree-degree correlations and degree-dependent clustering
• Structure of n-clique networks embedded in a complex network
• Clustering in random line graphs
• Probing the network structure of health deficits in human aging
• The Bass diffusion model on finite Barabasi-Albert networks
• Link-space formalism for network analysis
• Mixing properties of growing networks and the Simpson's paradox
• Self-Organization and Complex Networks
• A Generative Hypergraph Model for Double Heterogeneity
• Degree-dependent network growth: From preferential attachment to explosive percolation
• Link-Space and Network Analysis
• Modeling for evolving biological networks with scale-free connectivity, hierarchical modularity, and disassortativity
• Attention Dynamics in Collaborative Knowledge Creation
• Will Scale-free Popularity Develop Scale-free Geo-social Networks?