Degree Distributions of Growing Networks

Abstract

The in-degree and out-degree distributions of a growing network model are determined. The in-degree is the number of incoming links to a given node (and vice versa for out-degree. The network is built by (i) creation of new nodes which each immediately attach to a pre-existing node, and (ii) creation of new links between pre-existing nodes. This process naturally generates correlated in- and out-degree distributions. When the node and link creation rates are linear functions of node degree, these distributions exhibit distinct power-law forms. By tuning the parameters in these rates to reasonable values, exponents which agree with those of the web graph are obtained.

4 pages, 2 figures, 2-column revtex format

Cited by in corpus (95)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Evolution of networks
• Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
• Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
• Are randomly grown graphs really random?
• Average path length in random networks
• Average path length in uncorrelated random networks with hidden variables
• Preferential attachment in the growth of social networks: the case of Wikipedia
• Giant strongly connected component of directed networks
• Edge direction and the structure of networks
• Subgraphs in random networks
• A Geometric Fractal Growth Model for Scale Free Networks
• Anomalous percolating properties of growing networks
• Growing Random Networks with Fitness
• Scale-Free and Stable Structures in Complex {\em Ad hoc} networks
• Signatures of small-world and scale-free properties in large computer programs
• Growth and structure of Slovenia's scientific collaboration network
• Travel and tourism: Into a complex network
• Weighted Scale-Free Networks with Stochastic Weight Assignments
• Scale Free Networks from Self-Organisation
• Human Sexual Contact Network as a Bipartite Graph
• Weight-driven growing networks
• Modelling Citation Networks
• Complex Networks
• Hidden Symmetries in Real and Theoretical Networks
• Modeling Structure and Resilience of the Dark Network
• Phase transition in the recoverability of network history
• Degree Correlation in Scale-Free Graphs
• Network growth models and genetic regulatory networks
• Exactly solvable scale-free network model
• Accelerating, hyper-accelerating, and decelerating probabilistic networks
• Zipf's law and log-normal distributions in measures of scientific output across fields and institutions: 40 years of Slovenia's research as an example
• Unidirectional Random Growth with Resetting
• A directed network model for World-Wide Web
• Complex scale-free networks with tunable power-law exponent and clustering
• The nature and nurture of network evolution
• Topological phase transition in a network model with preferential attachment and node removal
• Multiple Scale-Free Structures in Complex Ad-Hoc Networks
• Emergence of scale-free close-knit friendship structure in online social networks
• Power-law distributions from additive preferential redistributions
• A Mean-Field Approach to Evolving Spatial Networks, with an Application to Osteocyte Network Formation
• Scale-Free Networks beyond Power-Law Degree Distribution
• Quasistatic Scale-free Networks
• Observability transitions in correlated networks
• Network Growth with Arbitrary Initial Conditions: Analytical Results for Uniform and Preferential Attachment
• The agents' preferences and the topology of networks
• Properties of a random attachment growing network
• Scaling exponents and clustering coefficients of a growing random network
• Robustness of the in-degree exponent for the world-wide web
• Directed Accelerated Growth: Application in Citation Network
• Memory effects induce structure in social networks with activity-driven agents
• A Structure-Centric View of Protein Evolution, Design and Adaptation
• Structural preferential attachment: Stochastic process for the growth of scale-free, modular and self-similar systems
• Percolation properties of growing networks under an Achlioptas process
• Scale-free network on a vertical plane
• Dynamical Stationarity as a Result of Sustained Random Growth
• Partition of Networks into Basins of Attraction
• Scale-free networks with tunable degree distribution exponents
• Large deviations for the degree structure in preferential attachment schemes
• Ecology of active and passive players and their impact on information selection
• Generation of scale-free networks using a simple preferential rewiring dynamics
• Near and Far from Equilibrium Power-Law Statistics
• Diophantine Networks
• Quantum statistics and networks by asymmetric preferential attachment of nodes -- between bosons and fermions
• Scaling Laws for Function Diversity and Specialization Across Socioeconomic and Biological Complex Systems
• The Magic of Networks Grown by Redirection
• Growing Networks: Limit in-degree distribution for arbitrary out-degree one
• Growing random networks under constraints
• Invited review: Epidemics on social networks
• Estimating Formation Mechanisms and Degree Distributions in Mixed Attachment Networks
• Spectral and Dynamic Consequences of Network Specialization
• Disagreement and fragmentation in growing groups
• A generalized theory of preferential linking
• Considerations about multistep community detection
• Quantitative modeling of degree-degree correlation in complex networks
• Equilibrium distributions in entropy driven balanced processes
• Simple evolving random graphs
• Efficient Network Generation Under General Preferential Attachment
• A Social Network Analysis of Articles on Social Network Analysis
• Are Extreme Value Estimation Methods Useful for Network Data?
• Continuum Cascade Model of Directed Random Graphs: Traveling Wave Analysis
• A Simple Model of Scale-free Networks Driven by both Randomness and Adaptability
• Bounding the Bias of Tree-Like Sampling in IP Topologies
• Percolation and depinning transitions in cut-and-paste models of adaptation
• Degree Growth Rates and Index Estimation in a Directed Preferential Attachment Model
• Learning to Generate Networks
• Complex Dependencies in Large Software Systems
• Emergent Probability - A directed Scale-Free Network Approach to Lonergan's Generic Model of Development
• Evolution of grammatical forms: some quantitative approaches
• General Connectivity Distribution Functions for Growing Networks with Preferential Attachment of Fractional Power
• Common Growth Patterns for Regional Social Networks: a Point Process Approach
• Fitting the Linear Preferential Attachment Model
• Scale-Invariant Strength Assortativity of Streaming Butterflies
• Nonparametric estimation of the preferential attachment function from one network snapshot