Scale-Free Networks Generated By Random Walkers

Abstract

We present a simple mechanism for generating undirected scale-free networks using random walkers, where the network growth is determined by choosing parent vertices by sequential random walks. We show that this mechanism produces scale-free networks with degree exponent gamma=3 and clustering coefficients depending on random walk length. The mechanism can be interpreted in terms of preferential attachment without explicit knowledge of node degrees.

10 pages, 3 figures

References in corpus (17)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Community structure in social and biological networks
• The diameter of the world wide web
• Evolution of networks
• Classes of behavior of small-world networks
• Hierarchical Organization in Complex Networks
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Connectivity of Growing Random Networks
• Efficient Immunization Strategies for Computer Networks and Populations
• Growing Scale-Free Networks with Tunable Clustering
• Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
• Pseudofractal Scale-free Web
• Highly clustered scale-free networks
• Growing Scale-Free Networks with Small World Behavior
• Generic scale of the "scale-free" growing networks
• Structural transitions in scale-free networks

Cited by in corpus (33)

• Characterizing and Modeling the Dynamics of Activity and Popularity
• Combining complex networks and data mining: why and how
• Mean-field diffusive dynamics on weighted networks
• Scale Free Networks from Self-Organisation
• Exact Solution for the Time Evolution of Network Rewiring Models
• Ring structures and mean first passage time in networks
• Complex Networks
• Modelling Citation Networks
• Scale-free networks as an epiphenomenon of memory
• Local-world evolving networks with tunable clustering
• Complex scale-free networks with tunable power-law exponent and clustering
• Growing Scale-free Networks by a Mediation-Driven Attachment Rule
• Degree Distribution, Rank-size Distribution, and Leadership Persistence in Mediation-Driven Attachment Networks
• Emergence of Global Preferential Attachment From Local Interaction
• Identifying time dependence in network growth
• Link-space formalism for network analysis
• Longest Path in the Price Model
• What do we learn from correlations of local and global network properties?
• Complex networks with scale-free nature and hierarchical modularity
• Exact Solutions for Models of Cultural Transmission and Network Rewiring
• A random walker's view of networks whose growth it shapes
• Generating Scale-free Networks with Adjustable Clustering Coefficient Via Random Walks
• A phase transition creates the geometry of the continuum from discrete space
• Compressibility of random walker trajectories on growing networks
• Dynamic Scaling, Data-collapse and Self-Similarity in Mediation-Driven Attachment Networks
• Gaussian Networks Generated by Random Walks
• Co-evolution of networks and quantum dynamics: a generalization of preferential attachment
• Building your path to escape from home
• The Evolution of the Cuban HIV/AIDS Network
• Link-Space and Network Analysis
• Growing Attributed Networks through Local Processes
• Modeling random walkers on growing random networks
• Random walk attachment graphs