Path Laplacian matrices: Introduction and application to the analysis of consensus in networks
- 1 May 2012
- journal article
- research article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 436 (9) , 3373-3391
Abstract
No abstract availableKeywords
This publication has 55 references indexed in Scilit:
- Dense, Unspecific Connectivity of Neocortical Parvalbumin-Positive Interneurons: A Canonical Microcircuit for Inhibition?The Journal of Neuroscience, 2011
- Improved Biological Network Reconstruction Using Graph Laplacian RegularizationJournal of Computational Biology, 2011
- The art of community detectionBioEssays, 2008
- Quantum chaos on discrete graphsJournal of Physics A: Mathematical and Theoretical, 2007
- Fast sparse matrix multiplicationACM Transactions on Algorithms, 2005
- Floats, Integers, and Single Source Shortest PathsJournal of Algorithms, 2000
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functionsAlgorithmica, 1996
- On the All-Pairs-Shortest-Path Problem in Unweighted Undirected GraphsJournal of Computer and System Sciences, 1995
- Resistance distanceJournal of Mathematical Chemistry, 1993
- A note on two problems in connexion with graphsNumerische Mathematik, 1959