A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters

DOI10.1016/J.PHYSA.2017.11.047OpenAlexW2769790431MaRDI QIDQ2148240FDOQ2148240

Authors Fei Ma, Jing Su, Yongxing Hao, Bing Yao, Guanghui Yan

Publication date 23 June 2022

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.physa.2017.11.047

zbMATH Keywords

spanning treesnetwork modelssmall-world propertyscale-free featurevertex-edge-growth operation

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Recommendations

• The relations between network-operation and topological-property in a scale-free and small-world network with community structure
• A planar scale-free graph as network model
• Double preferential scale-free network models
• Growth and preferential attachment in scale-free networks
• One scale-free network model based on two different preferential attachment probabilities

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• Collective dynamics of `small-world' networks
• Counting spanning trees in self-similar networks by evaluating determinants
• Critical study of hierarchical lattice renormalization group in magnetic ordered and quenched disordered systems: Ising and Blume-Emery-Griffiths models
• Deterministic scale-free networks
• Enumeration of spanning trees in planar unclustered networks
• Geometry of minimum spanning trees on scale-free networks
• Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
• Label-based routing for a family of scale-free, modular, planar and unclustered graphs
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• New method for counting the number of spanning trees in a two-tree network
• On the normalised Laplacian spectrum, degree-Kirchhoff index and spanning trees of graphs
• On the number of spanning trees on various lattices
• Spanning trees on graphs and lattices inddimensions
• Spanning trees on the Sierpinski gasket
• The Structure and Function of Complex Networks
• The number of spanning trees in Apollonian networks
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs

Cited in

(12)

• Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory
• Random growth scale-free networked models with an identical degree distribution and a tunable assortativity index
• Random growth networks with exponential degree distribution
• Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models by Ma and Yao
• Specialization models of network growth
• Renormalization-group theory of the Heisenberg model in \(d\) dimensions
• The relations between network-operation and topological-property in a scale-free and small-world network with community structure
• Phase transitions of the variety of random-field Potts models
• A family of small-world network models built by complete graph and iteration-function
• A geometric growth model interpolating between regular and small-world networks
• Growth model for fractal scale-free networks generated by a random walk
• The behavior of Tutte polynomials of graphs under five graph operations and its applications

This page was built for publication: A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148240)