Deterministic scale-free networks
From MaRDI portal
Abstract: Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are stochastic, that is they create networks in which the nodes appear to be randomly connected to each other. Here we propose a simple model that generates scale-free networks in a deterministic fashion. We solve exactly the model, showing that the tail of the degree distribution follows a power law.
Recommendations
Cites work
Cited in
(77)- A new class of the planar networks with high clustering and high entropy
- AVERAGE GEODESIC DISTANCE OF SIERPIŃSKI-TYPE NETWORKS
- Network coherence analysis on a family of nested weighted \(n\)-polygon networks
- Efficiency of transportation on weighted extended Koch networks
- The number of spanning trees of a class of self-similar fractal models
- Toward a thermodynamic characterization of chemical reaction networks
- Vertex labeling and routing for Farey-type symmetrically-structured graphs
- Analysis of percolation behaviors of clustered networks with partial support-dependence relations
- Parameter influence on the zeros of network determinants
- Recursive weighted treelike networks
- Topologies and Laplacian spectra of a deterministic uniform recursive tree
- Random pseudofractal scale-free networks with small-world effect
- Scale-freeness for networks as a degenerate ground state: a Hamiltonian formulation
- Random walks and diffusion on networks
- The asymptotic degree distributions of random fast growth models for treelike networks
- Matrix analysis of a Markov chain small-world model
- The adaptive coupling scheme and the heterogeneity in intrinsic frequency and degree distributions of the complex networks
- Leader-follower coherence in noisy ring-trees networks
- A novel flux-fluctuation law for network with self-similar traffic
- Scaling of weighted spectral distribution in deterministic scale-free networks
- Average weighted receiving time on the non-homogeneous double-weighted fractal networks
- The modified box dimension and average weighted receiving time of the weighted hierarchical graph
- Deterministic self-similar models of complex networks based on very symmetric graphs
- Complex networks: structure and dynamics
- High-order degree and combined degree in complex networks
- Degree distribution in discrete case
- Trapping on modular scale-free and small-world networks with multiple hubs
- On algebraic connectivity of directed scale-free networks
- Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes
- Diophantine networks
- FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON
- Exactly scale-free scale-free networks
- Structure properties of Koch networks based on networks dynamical systems
- Directed and non-directed scale-free networks
- A planar scale-free graph as network model
- Generating hierarchial scale-free graphs from fractals
- An evolving pseudofractal network model
- A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters
- Network coherence in the web graphs
- AVERAGE FERMAT DISTANCE OF A PSEUDO-FRACTAL HIERARCHICAL SCALE-FREE NETWORK
- Networks in life: Scaling properties and eigenvalue spectra
- Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks
- Tutte polynomial of the Apollonian network
- A new fractal reliability model for networks with node fractal growth and no-loop
- Shells structure in uncorrelated scale-free networks
- Fixed point limits of self-similar network sequences
- The dynamics of avian influenza: individual-based model with intervention strategies in traditional trade networks in Phitsanulok Province, Thailand
- ROUTING STRATEGIES FOR SUPPRESSING TRAFFIC-DRIVEN EPIDEMIC SPREADING IN MULTIPLEX NETWORKS
- Correlation between weighted spectral distribution and average path length in evolving networks
- A stochastic complex network model
- Leader selection for coherence in symmetric and asymmetric trees
- Noisy consensus dynamics in windmill-type graphs
- Minimum leader selection for controllability of undirected graphs with leader-follower framework
- Scale-free and small-world properties of a special hierarchical network
- Analyses of some structural properties on a class of hierarchical scale-free networks
- Fractal networks with Sturmian structure
- scientific article; zbMATH DE number 5082549 (Why is no real title available?)
- An iteration method for computing the total number of spanning trees and its applications in graph theory
- The relations between network-operation and topological-property in a scale-free and small-world network with community structure
- Overlapping modularity at the critical point of \(k\)-clique percolation
- Strategic games on a hierarchical network model
- Simplicial approach to fractal structures
- Deterministic hierarchical networks
- IMPROVED CLUSTERING THROUGH HETEROGENEITY IN PREFERENTIAL ATTACHMENT NETWORKS
- The role of detachment of in-links in scale-free networks
- Deterministic scale-free small-world networks of arbitrary order
- Deterministic small-world networks
- Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory
- Higher order clustering coefficients in Barabási-Albert networks
- Robustness of network coherence in asymmetric unicyclic graphs
- A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model
- Graph concatenations to derive weighted fractal networks
- A family of small-world network models built by complete graph and iteration-function
- Constructions and properties of a class of random scale-free networks
- Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network
- A class of scale-free networks with fractal structure based on subshift of finite type
- Scaling laws for diffusion on (trans)fractal scale-free networks
This page was built for publication: Deterministic scale-free networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5945412)
