Fractal networks: topology, dimension, and complexity

DOI10.1063/5.0200632zbMATH Open1541.05164MaRDI QIDQ6554415

Pavel Skums, Leonid A. Bunimovich

Publication date: 12 June 2024

Published in: Chaos (Search for Journal in Brave)

zbMATH Keywords

complex networksLebesgue dimension

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Hausdorff and packing measures (28A78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Entropy and the complexity of graphs revisited
• Covering graphs by the minimum number of equivalence relations
• On a product dimension of graphs
• A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
• The complexity and effectiveness of prediction algorithms
• Connected components in random graphs with given expected degree sequences
• On the product dimension of clique factors
• Kolmogorov complexity and Hausdorff dimension
• Factorisation of snarks
• Large Cliques in a Power-Law Random Graph
• Modularity of regular and treelike graphs
• Specialization Models of Network Growth
• DEFINING DIMENSION OF A COMPLEX NETWORK
• The NP-Completeness of Edge-Coloring
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• The Structure and Function of Complex Networks
• Line Graphs of Helly Hypergraphs
• Networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• Paths in graphs
• Graph fractal dimension and the structure of fractal networks
• High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
• Prague dimension of random graphs
• On an estimate of the chromatic class of a \(p\)-graph

This page was built for publication: Fractal networks: topology, dimension, and complexity