A primer on Laplacian dynamics in directed graphs
From MaRDI portal
Publication:5145573
Abstract: We analyze the asymptotic behavior of general first order Laplacian processes on digraphs. The most important ones of these are diffusion and consensus with both continuous and discrete time. We treat diffusion and consensus as dual processes. This is the first complete exposition of this material in a single work.
Recommendations
Cites work
Cited in
(10)- Diffusion and consensus on weakly connected directed graphs
- Laplacian dynamics on general graphs
- Non-local network dynamics via fractional graph Laplacians
- The dynamics of the line and path graph operators
- Laplace and bi-Laplace equations for directed networks and Markov chains
- Hybrid consensus for multi-agent systems with time-driven jumps
- `Hubs-repelling' Laplacian and related diffusion on graphs/networks
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Commute times for a directed graph using an asymmetric Laplacian
- Cycle-star motifs: network response to link modifications
This page was built for publication: A primer on Laplacian dynamics in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145573)