Random growth scale-free networked models with an identical degree distribution and a tunable assortativity index

DOI10.1063/5.0072341MaRDI QIDQ6558034zbMATH OpenFDO

Authors Xudong Luo, Fei Ma, Wentao Xu

Publication date 18 June 2024

Published in Chaos (Search for Journal in Brave)

zbMATH Keywords

entropy of spanning treestotal number of spanning trees of deterministic models

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3964277 (Why is no real title available?)
• A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
• A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters
• An ensemble of random graphs with identical degree distribution
• An iteration method for computing the total number of spanning trees and its applications in graph theory
• Analytical results for the distribution of first hitting times of random walks on random regular graphs
• Asymptotic Enumeration of Spanning Trees
• Average distance, independence number, and spanning trees
• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
• Collective dynamics of `small-world' networks
• Constructions of universalized Sierpiński graphs based on labeling manipulations
• Emergence of Scaling in Random Networks
• Enumeration of spanning trees on contact graphs of disk packings
• Evolving networks based on birth and death process regarding the scale stationarity
• Exact results for the first-passage properties in a class of fractal networks
• Exactly scale-free scale-free networks
• Exploring complex networks
• Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory
• Geometry of minimum spanning trees on scale-free networks
• Graph theory
• Network science. With Márton Pósfai
• Networks
• On the number of spanning trees on various lattices
• Random growth networks with exponential degree distribution
• Random walks on Fibonacci treelike models
• Spanning trees in randomly perturbed graphs
• The Structure and Function of Complex Networks
• The number of spanning trees in Apollonian networks
• The probability of connectivity in a hyperbolic model of complex networks
• Time-delayed Kuramoto model in the Watts-Strogatz small-world networks

This page was built for publication: Random growth scale-free networked models with an identical degree distribution and a tunable assortativity index

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