Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

Random Walks Performed by Topologically-Specific Agents on Complex Networks (2312.00859v2)

Published 1 Dec 2023 in physics.soc-ph and cs.GR

Abstract: Random walks by single-node agents have been systematically conducted on various types of complex networks in order to investigate how their topologies can affect the dynamics of the agents. However, by fitting any network node, these agents do not engage in topological interactions with the network. In the present work, we describe random walks on complex networks performed by agents that are actually small graphs. These agents can only occupy admissible portions of the network onto which they fit topologically, hence their name being taken as topologically-specific agents. These agents are also allowed to move to adjacent subgraphs in the network, which have each node adjacent to a distinct original respective node of the agent. Given a network and a specific agent, it is possible to obtain a respective associated network, in which each node corresponds to a possible instance of the agent and the edges indicate adjacent positions. Associated networks are obtained and studied respectively to three types of topologically-specific agents (triangle, square, and slashed square) considering three types of complex networks (geometrical, Erd\H{o}s-R\'enyi, and Barab\'asi-Albert). Uniform random walks are also performed on these structures, as well as networks respectively obtained by removing the five nodes with the highest degree, and studied in terms of the number of covered nodes along the walks. Several results are reported and discussed, including the fact that substantially distinct associated networks can be obtained for each of the three considered agents and for varying average node degrees. Respectively to the coverage of the networks by uniform random walks, the square agent led to the most effective coverage of the nodes, followed by the triangle and slashed square agents. In addition, the geometric network turned out to be less effectively covered.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (35)
  1. H. C. Berg. Random walks in biology. Princeton University Press, 1993.
  2. Lévy flights and related topics in physics. Springer, 1995.
  3. Random walk: a modern introduction, volume 123. Cambridge University Press, 2010.
  4. P. Révész. Random walk in random and non-random environments. World Scientific, 2013.
  5. O. C. Ibe. Elements of random walk and diffusion processes. John Wiley & Sons, 2013.
  6. F. Spitzer. Principles of random walk, volume 34. Springer Science & Business Media, 2013.
  7. Random walks: A review of algorithms and applications. IEEE Transactions on Emerging Topics in Computational Intelligence, 4(2):95–107, 2019.
  8. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47, 2002.
  9. Characterization of complex networks: a survey of measurements. Advances in Physics, 56(1):167–242, 2007.
  10. Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Advances in Physics, 60(3):329–412, 2011.
  11. M. Newman. Networks. Oxford University Press, 2018.
  12. J. D. Noh and H. Rieger. Random walks on complex networks. Physical Review Letters, 92(11):118701, 2004.
  13. L. da F. Costa. Visual saliency and attention as random walks on complex networks. arXiv preprint physics/0603025, 2006.
  14. L. da F. Costa and G. Travieso. Exploring complex networks through random walks. Physical Review E, 75(1):016102, 2007.
  15. D. Brockmann. Anomalous diffusion and the structure of human transportation networks. The European Physical Journal Special Topics, 157:173–189, 2008.
  16. M. Rosvall and C. T. Bergstrom. Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences, 105(4):1118–1123, 2008.
  17. A. Fronczak and P. Fronczak. Biased random walks in complex networks: The role of local navigation rules. Physical Review E, 80(1):016107, 2009.
  18. Effect of memory on the dynamics of random walks on networks. Journal of Complex Networks, 3(2):177–188, 2015.
  19. Knowledge acquisition: A complex networks approach. Information Sciences, 421:154–166, 2017.
  20. Random walks and diffusion on networks. Physics Reports, 716:1–58, 2017.
  21. S. Fortunato and A. Flammini. Random walks on directed networks: the case of pagerank. International Journal of Bifurcation and Chaos, 17(07):2343–2353, 2007.
  22. Correlations between structure and random walk dynamics in directed complex networks. Applied Physics Letters, 91(5), 2007.
  23. Border detection in complex networks. New Journal of Physics, 11(6):063019, 2009.
  24. Effective number of accessed nodes in complex networks. Physical Review E, 85(3):036105, 2012.
  25. Connecting network science and information theory. Physica A: Statistical Mechanics and its Applications, 515:641–648, 2019.
  26. Universal exploration dynamics of random walks. Nature Communications, 14(1):618, 2023.
  27. About the Delaunay-Voronoi tesselation. Journal of Computational Physics, 74(1):61–72, 1988.
  28. B. M. Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9):1617–1622, 1988.
  29. Cover times of random searches. Nature Physics, 11(10):844–847, 2015.
  30. B. F. Maier and D. Brockmann. Cover time for random walks on arbitrary complex networks. Physical Review E, 96(4):042307, 2017.
  31. P. Erdős and Rényi A. On random graphs i. Publ. Math. Debrecen, 6(290-297):18, 1959.
  32. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509–512, 1999.
  33. L. da F. Costa. Further generalizations of the Jaccard index. https://www.researchgate.net/publication/355381945_Further_Generalizations_of_the_Jaccard_Index, 2021.
  34. L. da F. Costa. On similarity. Physica A: Statistical Mechanics and its Applications, 599:127456, 2022.
  35. L. da F. Costa. Coincidence complex networks. Journal of Physics: Complexity, 3(1):015012, 2022.

Summary

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