Complex network dimension and path counts

DOI10.1016/j.tcs.2010.02.013zbMath1207.68172OpenAlexW2050874480MaRDI QIDQ974738

O. Shanker

Publication date: 7 June 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.02.013

zbMATH Keywords

graphsfractal dimensioncomplex networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Internet topics (68M11)

Related Items (1)

What is the dimension of citation space?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
• Fractal dimension and logarithmic loss unpredictability.
• Finite-state dimension
• The dimensions of individual strings and sequences
• Kolmogorov complexity and Hausdorff dimension
• Effective fractal dimensions
• DEFINING DIMENSION OF A COMPLEX NETWORK
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Dimension in Complexity Classes
• GRAPH ZETA FUNCTION AND DIMENSION OF COMPLEX NETWORK
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Complex network dimension and path counts