AI-Driven Consensus: Modeling Multi-Agent Networks with Long-Range Interactions Through Path-Laplacian Matrices
Source abstract
Abstract
Extended connectivity in graphs can be analyzed through k-path Laplacian matrices, which permit the capture of long-range interactions in various real-world networked systems such as social, transportation, and multi-agent networks. In this work, we present several alternative methods based on machine learning methods (LSTM, xLSTM, Transformer, XGBoost, and ConvLSTM) to predict the final consensus value based on directed networks (Erdös–Renyi, Watts–Strogatz, and Barabási–Albert) and on the initial state. We highlight how different k-hop interactions affect the performance of the tested methods. This framework opens new avenues for analyzing multi-scale diffusion processes in large-scale, complex networks.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Complex Network Analysis Techniques · Opinion Dynamics and Social Influence
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Instituto Universitario Matemática Pura y Aplicada, Universitat Politècnica de València, 46022 València, Spain
Funding
European Union - NextGenerationEU
References (52)
Show source-provided references
1. Reaching a Consensus10.1080/01621459.1974.10480137 ↗
2. Competition between long-range and short-range interactions in the voter model for opinion dynamics10.1140/epjb/s10051-025-00900-x ↗
3. Christakis, N., and Fowler, J. (2009). Connected: The Surprising Power of Our Social Networks and How They Shape Our Lives, Hachette UK.
4. Social contagion theory: Examining dynamic social networks and human behavior10.1002/sim.5408 ↗
5. A survey of the consensus for multi-agent systems10.1080/21642583.2019.1695689 ↗
6. Consensus in multi-agent systems: A review10.1007/s10462-021-10097-x ↗
7. Alavi, Y.E.A. (1991). The Laplacian Spectrum of Graphs. Graph Theory, Combinatorics, and Applications, Wiley.
8. Laplacian Matrices of Graphs: A Survey10.1016/0024-3795(94)90486-3 ↗
9. Path Laplacian matrices: Introduction and application to the analysis of consensus in networks10.1016/j.laa.2011.11.032 ↗
10. The strength of long-range ties in population-scale social networks10.1126/science.aau9735 ↗
11. Fast long-range connections in transportation networks10.1016/j.physleta.2011.03.006 ↗
12. Long-Range Interactions and Network Synchronization10.1137/17M1124310 ↗
13. Path Laplacians versus fractional Laplacians as nonlocal operators on networks10.1088/1367-2630/ac14ac ↗
14. Van Der Hofstad, R. (2014). Random Graphs and Complex Networks, Cambridge University Press.
15. Collective dynamics of ‘small-world’ networks10.1038/30918 ↗
16. Emergence of scaling in random networks10.1126/science.286.5439.509 ↗
17. Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules10.1109/TAC.2003.812781 ↗
18. Stability of Multiagent Systems with Time-Dependent Communication Links10.1109/TAC.2004.841888 ↗
19. Consensus Seeking in Multi-Agent Systems under Dynamically Changing Interaction Topologies10.1109/TAC.2005.846556 ↗
20. Algebraic Connectivity of Graphs10.21136/CMJ.1973.101168 ↗
21. Consensus and Cooperation in Networked Multi-Agent Systems10.1109/JPROC.2006.887293 ↗
22. Path Laplacian operators and superdiffusive processes on graphs. I. One-dimensional case10.1016/j.laa.2017.02.027 ↗
23. Consensus of Networked Multi-Agent Systems via Transformed d-Path Laplacian
24. Consensus in Multi-Agent Systems
25. Long short-term memory10.1162/neco.1997.9.8.1735 ↗
26. Deep learning for short-term traffic flow prediction10.1016/j.trc.2017.02.024 ↗
27. Chen, T., and Guestrin, C. (2016, January 13–17). XGBoost: A scalable tree boosting system. Proceedings of the 22nd ACM SIGKDD, San Francisco, CA, USA.10.1145/2939672.2939785 ↗
28. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., and Polosukhin, I. (2017, January 4–9). Attention is all you need. Proceedings of the Annual Conference on Neural Information Processing Systems 2017, Long Beach, CA, USA.
29. Traffic flow prediction with transformer neural network
30. Rethinking graph transformers with spectral attention
31. A survey of the vision transformers and their CNN-transformer based variants10.1007/s10462-023-10595-0 ↗
32. Characterization of anomalous diffusion through convolutional transformers10.1088/1751-8121/acafb3 ↗
33. Shi, X., Chen, Z., Wang, H., and Yeung, D.-Y. (2015, January 7–12). Convolutional LSTM Network: A Machine Learning Approach for Precipitation Nowcasting. Proceedings of the 29th Annual Conference on Neural Information Processing Systems, Montreal, QC, Canada.
34. Forecasting monthly gas field production based on the CNN-LSTM model10.1016/j.energy.2022.124889 ↗
35. Lozano, M., Garibo-i Orts, Ò., Piñol, E., Rebollo, M., Polotskaya, K., Garcia-March, M., Conejero, J., Escolano, F., and Oliver, N. (2021, January 13–17). Open data science to fight COVID-19: Winning the 500k XPRIZE Pandemic Response Challenge. Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Bilbao, Spain.10.1007/978-3-030-86514-6_24 ↗
36. Conversation modeling on reddit using a graph-structured LSTM10.1162/tacl_a_00009 ↗
37. Hechtlinger, Y., Chakravarti, P., and Qin, J. (2017). A generalization of convolutional neural networks to graph-structured data. arXiv.
38. Beck, M., Pöppel, K., Spanring, M., Auer, A., Prudnikova, O., Kopp, M.K., Klambauer, G., Brandstetter, J., and Hochreiter, S. (2024). xLSTM: Extended Long Short-Term Memory. arXiv.
39. Godsil, C., and Royle, G. (2001). Algebraic Graph Theory, Springer.10.1007/978-1-4613-0163-9 ↗
40. Chung, F.R.K. (1996). Spectral Graph Theory, American Mathematical Society.10.1090/cbms/092 ↗
41. Mesbahi, M., and Egerstedt, M. (2010). Graph Theoretic Methods in Multiagent Networks, Princeton University Press.10.1515/9781400835355 ↗
42. Time and space generalized diffusion equation on graph/networks10.1016/j.chaos.2022.111791 ↗
43. Exponential Convergence of Directed Consensus under Time-Varying Topologies
44. Path Laplacian operators and superdiffusive processes on graphs. II. Two-dimensional lattice10.1016/j.laa.2018.06.026 ↗
45. Consensus on Directed and Weighted Graphs: A Survey
46. Directed Graph Balancing and Consensus in Multi-Agent Systems
47. On random graphs10.5486/PMD.1959.6.3-4.12 ↗
48. Stochastic blockmodels: First steps10.1016/0378-8733(83)90021-7 ↗
49. Benchmark graphs for testing community detection algorithms10.1103/PhysRevE.78.046110 ↗
50. You, J., Ying, R., Ren, X., Hamilton, W., and Leskovec, J. (2018, January 10–15). GraphRNN: Generating realistic graphs with deep auto-regressive models. Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholm, Sweden.
51. Bojchevski, A., Shchur, O., Zügner, D., and Günnemann, S. (2018, January 10–15). NetGAN: Generating graphs via random walks. Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholm, Sweden.
52. Simonovsky, M., and Komodakis, N. (2018, January 4–7). GraphVAE: Towards generation of small graphs using variational autoencoders. Proceedings of the 27th International Conference on Artificial Neural Networks, Rhodes, Greece.10.1007/978-3-030-01418-6_41 ↗