AI-Driven Consensus: Modeling Multi-Agent Networks with Long-Range Interactions Through Path-Laplacian Matrices
Extended connectivity in graphs can be analyzed through <i>k</i>-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 met...
Saved in:
| Main Authors: | Yusef Ahsini, Belén Reverte, J. Alberto Conejero |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-05-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/15/9/5064 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Path Laplacian Eigenvalues and Path Laplacian Energy of Graphs
by: Shridhar Chandrakant Patekar, et al.
Published: (2018-01-01) -
Laplacian Controllability and Observability of Multi-Agent Systems: Recent Advances in Tree Graphs
by: Gianfranco Parlangeli
Published: (2025-04-01) -
Incidence and Laplacian matrices of wheel graphs and their inverses
by: Jerad Ipsen, et al.
Published: (2023-07-01) -
A Note on the Laplacian Energy of the Power Graph of a Finite Cyclic Group
by: Şerife Büyükköse, et al.
Published: (2024-04-01) -
The Numerical Range of 6 Χ 6 Irreducible Matrices
by: Ahmed Sabir
Published: (2007-12-01)