Commute times for a directed graph using an asymmetric Laplacian

DOI10.1016/j.laa.2011.01.030zbMath1226.05125OpenAlexW1973422829MaRDI QIDQ2431186

Gyan Ranjan, Daniel L. Boley, 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

directed graphswireless networkscommute timesgraph laplacians

Mathematics Subject Classification ID

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

Related Items (17)

Hitting time quasi-metric and its forest representation ⋮ Geometry of complex networks and topological centrality ⋮ A generalized inverse for graphs with absorption ⋮ Incremental Computation of Pseudo-Inverse of Laplacian ⋮ Forest formulas of discrete Green's functions ⋮ On resistance distance of Markov chain and its sum rules ⋮ Pseudoinverses of Signed Laplacian Matrices ⋮ Leontief meets Markov: sectoral vulnerabilities through circular connectivity ⋮ The Moore-Penrose inverse of the normalized graph Laplacian ⋮ An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification ⋮ Markov fundamental tensor and its applications to network analysis ⋮ Kirchhoffian indices for weighted digraphs ⋮ Hubs-biased resistance distances on graphs and networks ⋮ On fast computation of directed graph Laplacian pseudo-inverse ⋮ On some properties of the Laplacian matrix revealed by the RCM algorithm ⋮ A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities ⋮ Laplacian matrices and Alexandrov topologies of digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplace eigenvalues of graphs---a survey
• Eigenvalues and expanders
• On the second eigenvalue of a graph
• Random walks on graphs
• The matrix-forest theorem and measuring relations in small social groups
• The electrical resistance of a graph captures its commute and cover times
• Laplacians and the Cheeger inequality for directed 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 Range of the Adjugate Map
• Matrix Analysis
• Markov Chains
• The Moore--Penrose Generalized Inverse for Sums of Matrices
• Generalized Inversion of Modified Matrices
• Lower Bounds for the Partitioning of Graphs
• Metric Spaces and Positive Definite Functions

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