Path Laplacian matrices: introduction and application to the analysis of consensus in networks (Q417470): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2011.11.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054364378 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q125855856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems of Paul Erd�s in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral methods for graph clustering - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Topological View of Unsupervised Learning from Noisy Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus and Cooperation in Networked Multi-Agent Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agreement over random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3580272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2771956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The synchronization of chaotic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical Processes on Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum chaos on discrete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Laplacians and topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Green's function of a graph and applications to networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and flights over connected graphs and complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communities in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths algorithms: Theory and experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected single-source shortest paths with positive integer weights in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Floats, Integers, and Single Source Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Witnesses for Boolean matrix multiplication and for transitive closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the all-pairs-shortest-path problem in unweighted undirected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exponent of all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths for graphs with small integer length edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast sparse matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for betweenness centrality* / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:34, 5 July 2024

scientific article
Language Label Description Also known as
English
Path Laplacian matrices: introduction and application to the analysis of consensus in networks
scientific article

    Statements

    Path Laplacian matrices: introduction and application to the analysis of consensus in networks (English)
    0 references
    0 references
    14 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    path matrices
    0 references
    Laplacian matrix
    0 references
    consensus analysis
    0 references
    synchronization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references