Pagerank Algorithms and Multi-Particle Environments Using Pettingzoo: Network Simulation and Validation
DOI:
https://doi.org/10.54097/zsfnjk16Keywords:
PageRank; Multi-Partial Environment; Real-World Integration; Complex Network.Abstract
This study introduces and investigates two novel algorithms, namely Topic-Specific Crawling PageRank and Motif-Based PageRank, along with their corresponding application scenarios. The former algorithm focuses on targeted web crawling, refining the collection of web pages relevant to specific topics. The latter algorithm addresses higher-order relationships in citation networks, enhancing insights into researcher influence. These algorithms are evaluated within a Multi-Particle Environment, showcasing their capability to simulate necessary scenarios and data for PageRank algorithms. However, the environment's realism is limited due to its use of virtual data. The environment offers controllability through the PettingZoo resource library, providing an efficient experimentation platform. While the Multi-Particle Environment displays potential and advantages, its deviation from real-world data should be carefully considered. The experimental methodology involves constructing a network of agents and their message interactions within a simulated environment. The resulting network undergoes the PageRank algorithm, and the resulting ranking aligns with the expected outcome, confirming the Multi-Particle Environment's compatibility with the algorithm. These experiments furnish empirical evidence for the Multi-Particle Environment's adaptability to algorithmic simulations and real-world scenarios. This research contributes to a deeper comprehension of algorithm behavior in diverse and dynamic settings, paving the way for further advancements in the field
Downloads
References
Edmunds A, Morris A. The problem of information overload in business organisations: a review of the literature [J]. International journal of information management, 2000, 20(1): 17-28.
Sunil Datt M B A. The information explosion: Trends in technology 2011 review [J]. The Journal of Government Financial Management, 2011, 60(4): 46.
Liu J Q, Li X R, Dong J C. A survey on network node ranking algorithms: Representative methods, extensions, and applications [J]. Science China Technological Sciences, 2021, 64(3): 451-461.
Terry J, Black B, Grammel N, et al. Pettingzoo: Gym for multi-agent reinforcement learning [J]. Advances in Neural Information Processing Systems, 2021, 34: 15032-15043.
Ding Y, Yan E, Frazho A, et al. PageRank for ranking authors in co‐citation networks [J]. Journal of the American Society for Information Science and Technology, 2009, 60(11): 2229-2243.
Al_Janabi S, Kadiam N. Recommendation system of big data based on pagerank clustering algorithm[C]//Big Data and Networks Technologies 3. Springer International Publishing, 2020: 149-171.
Kravets A G, Kravets A D, Korotkov A A. Intelligent multi-agent systems generation [J]. World applied sciences journal, 2013, 24(24): 98-104.
Liu Y, Wang W, Hu Y, et al. multi-agent game abstraction via graph attention neural network [C]//Proceedings of the AAAI Conference on Artificial Intelligence. 2020, 34(05): 7211-7218.
Veličković P. Everything is connected: Graph neural networks [J]. Current Opinion in Structural Biology, 2023, 79: 102538.
Zhao H, Xu X, Song Y, et al. Ranking users in social networks with motif-based pagerank [J]. IEEE Transactions on Knowledge and Data Engineering, 2019, 33(5): 2179-2192.
Kraus S, Azaria A, Fiosina J, et al. AI for explaining decisions in multi-agent environments [C]//Proceedings of the AAAI conference on artificial intelligence. 2020, 34(09): 13534-13538.
Veličković P. Everything is connected: Graph neural networks. Current Opinion in Structural Biology. 2023 Apr 1;79:102538.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Highlights in Science, Engineering and Technology

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







