Growing Scale-Free Networks with Tunable Clustering

Abstract

We extend the standard scale-free network model to include a ``triad formation step''. We analyze the geometric properties of networks generated by this algorithm both analytically and by numerical calculations, and find that our model possesses the same characteristics as the standard scale-free networks like the power-law degree distribution and the small average geodesic length, but with the high-clustering at the same time. In our model, the clustering coefficient is also shown to be tunable simply by changing a control parameter - the average number of triad formation trials per time step.

Accepted for publication in Phys. Rev. E

References in corpus (1)

• Clustering and preferential attachment in growing networks

Cited by in corpus (216)

• The structure and function of complex networks
• Hierarchical Organization in Complex Networks
• Attack vulnerability of complex networks
• The Kuramoto model in complex networks
• Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
• Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
• Evolutionary dynamics on any population structure
• Random graphs with clustering
• Properties of highly clustered networks
• Layered Complex Networks
• Bipartite Graphs as Models of Complex Networks
• Triadic closure as a basic generating mechanism of communities in complex networks
• Enhancement of cooperation in highly clustered scale-free networks
• Fundamentals of spreading processes in single and multilayer complex networks
• Structure and Time-Evolution of an Internet Dating Community
• A Model for Social Networks
• Congestion and centrality in traffic flow on complex networks
• Non-equilibrium dynamics of language games on complex networks
• Design Space for Graph Neural Networks
• Efficient local strategies for vaccination and network attack
• Combining complex networks and data mining: why and how
• Forman curvature for complex networks
• Exploring complex networks by walking on them
• Structure of a large social network
• Tuning clustering in random networks with arbitrary degree distributions
• Potential Theory for Directed Networks
• Coauthorship and citation in scientific publishing
• Graph Vulnerability and Robustness: A Survey
• Scale-free networks without growth
• Scale-free trees: the skeletons of complex networks
• Structural transitions in scale-free networks
• Solution for the properties of a clustered network
• Scale-Free Networks Generated By Random Walkers
• Effective approach to epidemic containment using link equations in complex networks
• Rate equation approach for correlations in growing network models
• Random Networks with Tunable Degree Distribution and Clustering
• Strategy evolution on dynamic networks
• Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
• Robustness of partially interdependent network formed of clustered networks
• The Ultimatum Game in Complex Networks
• Evolving networks with distance preferences
• Shortest paths and load scaling in scale-free trees
• Triadic closure dynamics drives scaling-laws in social multiplex networks
• The Memory of Science: Inflation, Myopia, and the Knowledge Network
• Structural Transitions in Dense Networks
• Emergence of multiplex communities in collaboration networks
• Higher order clustering coefficients in Barabasi-Albert networks
• Geographical Coarsegraining of Complex Networks
• Exact scaling properties of a hierarchical network model
• Social cohesion, structural holes, and a tale of two measures
• Complete trails of co-authorship network evolution
• Evolution of Cooperation in the Presence of Higher-Order Interactions: from Networks to Hypergraphs
• Spectra of networks containing short loops
• Stochastic Opinion Formation in Scale-Free Networks
• Modeling the clustering in citation networks
• Modeling scientific-citation patterns and other triangle-rich acyclic networks
• Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights
• Enhancing the spectral gap of networks by node removal
• Correlations in Bipartite Collaboration Networks
• Consensus formation on a triad scale-free network
• Effective epidemic containment strategy in hypergraphs
• Growing Scale-free Small-world Networks with Tunable Assortative Coefficient
• Average distance in a hierarchical scale-free network: an exact solution
• The synchronizability of highly clustered scale-free networks
• Clustering Phase Transitions and Hysteresis: Pitfalls in Constructing Network Ensembles
• A directed network model for World-Wide Web
• Identifying vital nodes by Achlioptas process
• Local-world evolving networks with tunable clustering
• Complex scale-free networks with tunable power-law exponent and clustering
• Optimization of the post-crisis recovery plans in scale-free networks
• xDGP: A Dynamic Graph Processing System with Adaptive Partitioning
• Inferring Graphs from Cascades: A Sparse Recovery Framework
• Continuous transition from the extensive to the non-extensive statistics in an agent-based herding model
• Crossover phenomena of percolation transition in evolution networks with hybrid attachment
• Dynamical origins of the community structure of multi-layer societies
• Evolving networks by merging cliques
• Ising model in clustered scale-free networks
• Generating random networks with given degree-degree correlations and degree-dependent clustering
• Spin glass behavior of the antiferromagnetic Ising model on a scale-free network
• Crowdsourcing through Cognitive Opportunistic Networks
• Clustering in random line graphs
• Dimension reduction of dynamical systems on networks with leading and non-leading eigenvectors of adjacency matrices
• Prisoner's dilemma in structured scale-free networks
• Link prediction with continuous-time classical and quantum walks
• Corona graphs as a model of small-world networks
• Coupled dynamics of node and link states in complex networks: A model for language competition
• Evolving Scale-Free Network Model with Tunable Clustering
• Coevolving nonlinear voter model with triadic closure
• Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approach
• Network Topology Mapping from Partial Virtual Coordinates and Graph Geodesics
• Outward-inward information flux in an opinion formation model on different topologies
• Local degree blocking model for link prediction in complex networks
• Dynamics of collective action to conserve a large common-pool resource
• Reference to Global State and Social Contagion Dynamics
• Topological fractal networks introduced by mixed degree distribution
• Small World Graphs by the iterated "My Friends are Your Friends'' Principle
• Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model
• Growing hyperbolic networks beyond two dimensions: the generalised popularity-similarity optimisation model
• Memory effects induce structure in social networks with activity-driven agents
• Multitask Learning on Graph Neural Networks: Learning Multiple Graph Centrality Measures with a Unified Network
• Highly Clustered Complex Networks in the Configuration Model: Random Regular Small-World Network
• Graph Energies of Egocentric Networks and Their Correlation with Vertex Centrality Measures
• Networks with many structural scales: a Renormalization Group perspective
• Motifs in Triadic Random Graphs based on Steiner Triple Systems
• Mean-field theory for double-well systems on degree-heterogeneous networks
• Relay-Linking Models for Prominence and Obsolescence in Evolving Networks
• Link-space formalism for network analysis
• Benchmarks for Graph Embedding Evaluation
• On the formation of structure in growing networks
• Dismantling Complex Networks by a Neural Model Trained from Tiny Networks
• The Opacity Problem in Social Contagion
• Correlations among Game of Thieves and other centrality measures in complex networks
• Emergence of scale-free networks from local connectivity and communication trade-offs
• Correlation analysis of node and edge centrality measures in artificial complex networks
• Critical Phenomena and Strategy Ordering with Hub Centrality Approach in the Aspiration-based Coordination Game
• Emergence of Robust and Efficient Networks in a Family of Attachment Models
• A Boolean Gene Regulatory Model of heterosis and speciation
• Fast asynchronous updating algorithms for k-shell indices
• Scale-free networks with a large- to hypersmall-world transition
• Maximally modular structure of growing hyperbolic networks
• Modeling the Propagation of Trojan Malware in Online Social Networks
• Discretized opinion dynamics of Deffuant on scale-free networks
• Tuning degree distributions of scale-free networks
• Self-avoiding walks and connective constants in clustered scale-free networks
• Diffusion of innovations in finite networks: effects of heterogeneity, clustering, and bilingual option on the threshold in the contagion game model
• Statistical analysis of the first passage path ensemble of jump processes
• Power-law weighted networks from local attachments
• On the effect of the path length and transitivity of small-world networks on epidemic dynamics
• Exactly Solvable Random Graph Ensemble with Extensively Many Short Cycles
• Graph Neural Networks for Maximum Constraint Satisfaction
• Tuning the Clustering Coefficient of Generalized Circulant Networks
• Geometric unfolding of synchronization dynamics on networks
• GAEA: Graph Augmentation for Equitable Access via Reinforcement Learning
• Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient
• Growing small-world networks based on a modified BA model
• Co-Contagion Diffusion on Multilayer Networks
• An Empirical Assessment of the Complexity and Realism of Synthetic Social Contact Networks
• Clusterization, frustration and collectivity in random networks
• Coarse-graining the dynamics of network evolution: the rise and fall of a networked society
• Complex networks with scale-free nature and hierarchical modularity
• A New Framework for Network Disruption
• ELRUNA: Elimination Rule-based Network Alignment
• Roles of Ties in Spreading
• Strongly clustered random graphs via triadic closure: An exactly solvable model
• DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting
• Fast Algorithm for Relaxation Processes in Big-data Systems
• Designing Networks: A Mixed-Integer Linear Optimization Approach
• Epidemic dynamics on metapopulation networks with node2vec mobility
• Invited review: Epidemics on social networks
• Strange Attractors in Complex Networks
• Pathlength scaling in graphs with incomplete navigational information
• New methods to generate massive synthetic networks
• Simplex triangulation induced scale-free networks
• The elliptic model for social fluxes
• Geometric properties of graph layouts optimized for greedy navigation
• Automatic Discovery of Families of Network Generative Processes
• Observability transitions in clustered networks
• The Atlas for the Aspiring Network Scientist
• On the Structural Properties of Social Networks and their Measurement-calibrated Synthetic Counterparts
• Generating Scale-free Networks with Adjustable Clustering Coefficient Via Random Walks
• Quarantines as a Targeted Immunization Strategy
• A new method to reduce the number of time delays in a network
• Signed Network Modeling Based on Structural Balance Theory
• Unimodular lattice triangulations as small-world and scale-free random graphs
• The Network of Mexican Cities
• Limited individual attention and online virality of low-quality information
• Scalable Graph Neural Network-based framework for identifying critical nodes and links in Complex Networks
• Demographic and Structural Characteristics to Rationalize Link Formation in Online Social Networks
• Mixed strategy approach destabilizes cooperation in finite populations with clustering coefficient
• Model-based reconstruction of real-world fractal complex networks
• Competing contact processes on homogeneous networks with tunable clusterization
• Effectiveness of Alter Sampling in Social Networks
• Efficiency of navigation in indexed networks
• Individual versus Social Benefit on the Heterogeneous Networks
• Emergence of scale-free behavior in networks from limited-horizon linking and cost trade-offs
• A model for generating tunable clustering coefficients independent of the number of nodes in scale free and random networks
• A Simple Model of Scale-free Networks Driven by both Randomness and Adaptability
• Maximizing Influence with Graph Neural Networks
• A Survey of Evolving Models for Weighted Complex Networks based on their Dynamics and Evolution
• Fair treatment allocations in social networks
• Knowledge Consensus in complex networks: the role of learning
• Competition Between Homophily and Information Entropy Maximization in Social Networks
• Using Graph Properties to Speed-up GPU-based Graph Traversal: A Model-driven Approach
• Computing Heat Kernel Pagerank and a Local Clustering Algorithm
• Random Overlapping Communities: Approximating Motif Densities of Large Graphs
• Homophily and Triadic Closure in Evolving Social Networks
• Being Rational or Aggressive? A Revisit to Dunbar's Number in Online Social Networks
• On the Role of Triadic Substructures in Complex Networks
• Leveraging Evolution Dynamics to Generate Benchmark Complex Networks with Community Structures
• Link-Space and Network Analysis
• Magnetism of frustrated regular networks
• Clustering-induced localization of quantum walks on networks
• Growing Attributed Networks through Local Processes
• Free-energy density functional for Strauss's model of transitive networks
• Generating online social networks based on socio-demographic attributes
• Assortativity in Generalized Preferential Attachment Models
• Higher-order contagion processes in 3.99 dimensions
• Resilience of Social Networks Under Different Attack Strategies
• Evaluating links through spectral decomposition
• Untrained Graph Neural Networks for Denoising
• The Effect of Network-Topology to Propagation on Networks
• Geometric Criticality in Scale-Invariant Networks
• Arbitrary degree distribution and high clustering in networks of locally interacting agents
• Network Inequality through Preferential Attachment, Triadic Closure, and Homophily
• Factorization threshold models for scale-free networks generation
• One Node at a Time: Node-Level Network Classification
• An Independent Process Approximation to Sparse Random Graphs with a Prescribed Number of Edges and Triangles
• Effect of Closed Paths in Complex networks on Six Degrees of Separation and Disorder
• Total positive influence domination on weighted networks
• Agglomeration in a preferential attachment random graph with edge-steps
• The $N$-stars network evolution model
• Measuring multiple evolution mechanisms of complex networks
• Note on the Complex Networks and Epidemiology Part I: Complex Networks
• On the Controllability of Clustered Scale-Free Networks
• Mean First Hitting Time of Searching for Path Through Random Walks on Complex Networks
• Impact of Random Failures and Attacks on Poisson and Power-Law Random Networks