Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Hierarchical Cutting of Complex Networks Performed by Random Walks (2403.06876v1)

Published 11 Mar 2024 in cs.SI and physics.soc-ph

Abstract: Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the situation in which the connections traversed by each step of a uniformly random walks are progressively removed, yielding a successively less interconnected structure that may break into two components, therefore establishing a respective hierarchy. The sizes of each of these pairs of sliced networks, as well as the permanence of each connected component, are studied in the present work. Several interesting results are reported, including the tendency of geometrical networks sometimes to be broken into two components with comparable large sizes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. M. Newman. Networks. Oxford University Press, 2018.
  2. A.-L. Barabási. Network science. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 371(1987):20120375, 2013.
  3. Characterization of complex networks: a survey of measurements. Advances in Physics, 56(1):167–242, 2007.
  4. Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Advances in Physics, 60(3):329–412, 2011.
  5. Complex networks: Structure and dynamics. Physics reports, 424(4-5):175–308, 2006.
  6. Random and restricted walks: Theory and applications, volume 10. CRC Press, 1970.
  7. L. Lovász. Random walks on graphs. Combinatorics, Paul Erdos is Eighty, 2(1-46):4, 1993.
  8. F. Spitzer. Principles of random walk, volume 34. Springer Science & Business Media, 2013.
  9. Random walks: A review of algorithms and applications. IEEE Transactions on Emerging Topics in Computational Intelligence, 4(2):95–107, 2019.
  10. J. D. Noh and H. Rieger. Random walks on complex networks. Physical Review Letters, 92(11):118701, 2004.
  11. Random walks on complex trees. Physical Review E, 78(1):011114, 2008.
  12. Random walks on weighted networks. Physical Review E, 87(1):012112, 2013.
  13. Random walks on hypergraphs. Physical review E, 101(2):022308, 2020.
  14. Correlations between structure and random walk dynamics in directed complex networks. Applied Physics Letters, 91(5), 2007.
  15. L. da F. Costa and G. Travieso. Exploring complex networks through random walks. Physical Review E, 75(1):016102, 2007.
  16. Random walks on temporal networks. Physical Review E, 85(5):056115, 2012.
  17. Random walks and diffusion on networks. Physics Reports, 716:1–58, 2017.
  18. Application of random matrix theory to biological networks. Physics Letters A, 357(6):420–423, 2006.
  19. P. Pons and M. Latapy. Computing communities in large networks using random walks. In Computer and Information Sciences-ISCIS 2005: 20th International Symposium, Istanbul, Turkey, October 26-28, 2005. Proceedings 20, pages 284–293. Springer, 2005.
  20. Random walks, markov processes and the multiscale modular organization of complex networks. IEEE Transactions on Network Science and Engineering, 1(2):76–90, 2014.
  21. The map equation. The European Physical Journal Special Topics, 178(1):13–23, 2009.
  22. L. da F. Costa. Knitted complex networks. arXiv preprint arXiv:0711.2736, 2007.
  23. Complex network comparison using random walks. In Proceedings of the 23rd International Conference on World Wide Web, pages 727–730, 2014.
  24. Random walks-based node centralities to attack complex networks. Mathematics, 11(23):4827, 2023.
  25. Random walks and search in time-varying networks. Physical Review Letters, 109(23):238701, 2012.
  26. Graph theory and its applications. Chapman and Hall/CRC, 2018.
  27. Extracting the hierarchical organization of complex systems. Proceedings of the National Academy of Sciences, 104(39):15224–15229, 2007.
  28. Hierarchical structure and the prediction of missing links in networks. Nature, 453(7191):98–101, 2008.
  29. A. Benatti and L. da F. Costa. Recovering hierarchies in terms of content similarity. Journal of Physics A: Mathematical and Theoretical, 56(24):245003, 2023.
  30. Hierarchical organization of modularity in complex networks. In Statistical Mechanics of Complex nNtworks, pages 46–65. Springer, 2003.
  31. On the origins of hierarchy in complex networks. Proceedings of the National Academy of Sciences, 110(33):13316–13321, 2013.
  32. P. Erdős and A. Rényi. On random graphs I. Publicationes Mathematicae Debrecen, 6:290–297, 1959.
  33. A. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509–512, 1999.
  34. About the delaunay-voronoi tesselation. Journal of Computational Physics, 74(1):61–72, 1988.
  35. Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64(2):026118, 2001.
  36. A. Benatti and L. da F. Costa. Simple bundles of complex networks. arXiv preprint arXiv:2311.04133, 2023.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now