Commute times for a directed graph using an asymmetric Laplacian

DOI10.1016/J.LAA.2011.01.030MaRDI QIDQ2431186zbMATH OpenOpenAlexFDO

Authors Daniel Boley, Gyan Ranjan, Zhi-Li Zhang

Publication date 11 April 2011

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.01.030

zbMATH Keywords

commute timesdirected graphsgraph laplacianswireless networks

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81) Network design and communication in computer systems (68M10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Asymmetric traveling salesman path and directed latency problems
• Asymmetric traveling salesman path and directed latency problems
• scientific article; zbMATH DE number 946659
• A primer on Laplacian dynamics in directed graphs
• Laplacians and the Cheeger inequality for directed graphs
• Graph simplification and matching using commute times
• Asymptotical behaviour of directed graphs
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• Hitting and commute times in large random neighborhood graphs

Cites work

• Combinatorial matrix theory
• Eigenvalues and expanders
• Generalized Inversion of Modified Matrices
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 4004880 (Why is no real title available?)
• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 3493681 (Why is no real title available?)
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• scientific article; zbMATH DE number 1054729 (Why is no real title available?)
• scientific article; zbMATH DE number 867649 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• scientific article; zbMATH DE number 3047763 (Why is no real title available?)
• Laplace eigenvalues of graphs---a survey
• Laplacians and the Cheeger inequality for directed graphs
• Lower Bounds for the Partitioning of Graphs
• Markov Chains
• Matrix Analysis
• Metric Spaces and Positive Definite Functions
• On the second eigenvalue of a graph
• Random walks on graphs
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• The electrical resistance of a graph captures its commute and cover times
• The matrix-forest theorem and measuring relations in small social groups
• The Moore--Penrose Generalized Inverse for Sums of Matrices
• The Range of the Adjugate Map

Cited in

(21)

• Geometry of complex networks and topological centrality
• A generalized inverse for graphs with absorption
• Markov fundamental tensor and its applications to network analysis
• Kirchhoffian indices for weighted digraphs
• On fast computation of directed graph Laplacian pseudo-inverse
• Hitting time quasi-metric and its forest representation
• Hubs-biased resistance distances on graphs and networks
• Laplacian matrices and Alexandrov topologies of digraphs
• On resistance distance of Markov chain and its sum rules
• The Moore-Penrose inverse of the normalized graph Laplacian
• On some properties of the Laplacian matrix revealed by the RCM algorithm.
• Incremental computation of pseudo-inverse of Laplacian
• Random walks on digraphs, the generalized digraph Laplacian and the degree of asymmetry
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• Digraph Laplacian and the degree of asymmetry
• scientific article; zbMATH DE number 1436000 (Why is no real title available?)
• A metric on directed graphs and Markov chains based on hitting probabilities
• Forest formulas of discrete Green's functions
• Pseudoinverses of Signed Laplacian Matrices
• Leontief meets Markov: sectoral vulnerabilities through circular connectivity
• Resistance distances in directed graphs: definitions, properties, and applications

This page was built for publication: Commute times for a directed graph using an asymmetric Laplacian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431186)