Path Laplacian matrices: introduction and application to the analysis of consensus in networks
From MaRDI portal
Publication:417470
DOI10.1016/j.laa.2011.11.032zbMath1241.05077OpenAlexW2054364378WikidataQ125855856 ScholiaQ125855856MaRDI QIDQ417470
Publication date: 14 May 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.11.032
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Special matrices (15B99) Flows in graphs (05C21)
Related Items
The many facets of the Estrada indices of graphs and networks ⋮ Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case ⋮ Compatibility, embedding and regularization of non-local random walks on graphs ⋮ Asymptotic spectra of large (grid) graphs with a uniform local structure. II: Numerical applications ⋮ Time and space generalized diffusion equation on graph/networks ⋮ Average consensus in multi-agent systems with uncertain topologies and multiple time-varying delays ⋮ Matrix functions in network analysis ⋮ Long-Range Interactions and Network Synchronization ⋮ Consensus of high-order multi-agent systems with switching topologies ⋮ Fractional diffusion on the human proteome as an alternative to the multi-organ damage of SARS-CoV-2 ⋮ Metaplex Networks: Influence of the Exo-Endo Structure of Complex Systems on Diffusion ⋮ Consensus dynamics on weighted multiplex networks: a long-range interaction perspective ⋮ Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis ⋮ Mathematical modelling for sustainable aphid control in agriculture via intercropping ⋮ Second-order consensus protocols based on transformed \(d\)-path Laplacians ⋮ Asymptotic spectra of large (grid) graphs with a uniform local structure. I: Theory ⋮ Improving on transfer entropy-based network reconstruction using time-delays: Approach and validation ⋮ Nonlocal pagerank ⋮ An integer programming approach for finding the most and the least central cliques ⋮ Weight allocation in Laplacian matrix of random networks based on geodesic distances
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Graph clustering
- Combinatorial Green's function of a graph and applications to networks
- Spectral methods for graph clustering - a survey
- Random walks and flights over connected graphs and complex networks
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Matrix multiplication via arithmetic progressions
- Graph Laplacians and topology
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- Ramanujan graphs
- Witnesses for Boolean matrix multiplication and for transitive closure
- Laplacian matrices of graphs: A survey
- All pairs shortest paths for graphs with small integer length edges
- On the exponent of all pairs shortest path problem
- The synchronization of chaotic systems
- Shortest paths algorithms: Theory and experimental evaluation
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- A faster algorithm for betweenness centrality*
- Fast sparse matrix multiplication
- A Topological View of Unsupervised Learning from Noisy Data
- Emergence of Scaling in Random Networks
- Expander codes
- Undirected single-source shortest paths with positive integer weights in linear time
- Expander graphs and their applications
- Dynamical Processes on Complex Networks
- Quantum chaos on discrete graphs
- Communities in Networks
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Floats, Integers, and Single Source Shortest Paths
- Consensus and Cooperation in Networked Multi-Agent Systems
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- Agreement over random networks
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Network Analysis
