Generating Scale-free Networks with Adjustable Clustering Coefficient Via Random Walks
arXiv:1105.3347
Abstract
This paper presents an algorithm for generating scale-free networks with adjustable clustering coefficient. The algorithm is based on a random walk procedure combined with a triangle generation scheme which takes into account genetic factors; this way, preferential attachment and clustering control are implemented using only local information. Simulations are presented which support the validity of the scheme, characterizing its tuning capabilities.
References in corpus (19)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Random graphs with arbitrary degree distributions and their applications
- Structure and tie strengths in mobile communication networks
- How Popular is Your Paper? An Empirical Study of the Citation Distribution
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Growing Scale-Free Networks with Tunable Clustering
- Organization of Growing Random Networks
- Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
- Emergence of a small world from local interactions: Modeling acquaintance networks
- Model of Genetic Variation in Human Social Networks
- A Model for Social Networks
- Random graphs containing arbitrary distributions of subgraphs
- Tuning clustering in random networks with arbitrary degree distributions
- Scale-Free Networks Generated By Random Walkers
- Evolving networks with distance preferences
- Scale Free Networks from Self-Organisation
- Emergence of Global Preferential Attachment From Local Interaction