Commute times for a directed graph using an asymmetric Laplacian
DOI10.1016/J.LAA.2011.01.030zbMATH Open1226.05125OpenAlexW1973422829MaRDI QIDQ2431186FDOQ2431186
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
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Markov Chains
- Eigenvalues and expanders
- Random walks on graphs
- The matrix-forest theorem and measuring relations in small social groups
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Title not available (Why is that?)
- Combinatorial matrix theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metric Spaces and Positive Definite Functions
- Laplacians and the Cheeger inequality for directed graphs
- Title not available (Why is that?)
- Generalized Inversion of Modified Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Laplace eigenvalues of graphs---a survey
- On the second eigenvalue of a graph
- Lower Bounds for the Partitioning of Graphs
- The electrical resistance of a graph captures its commute and cover times
- The Moore--Penrose Generalized Inverse for Sums of Matrices
- The Range of the Adjugate Map
Cited In (21)
- Title not available (Why is that?)
- Random walks on digraphs, the generalized digraph Laplacian and the degree of asymmetry
- Digraph Laplacian and the degree of asymmetry
- A metric on directed graphs and Markov chains based on hitting probabilities
- Resistance distances in directed graphs: definitions, properties, and applications
- The Moore-Penrose inverse of the normalized graph Laplacian
- Laplacian matrices and Alexandrov topologies of digraphs
- Forest formulas of discrete Green's functions
- Geometry of complex networks and topological centrality
- On fast computation of directed graph Laplacian pseudo-inverse
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- Kirchhoffian indices for weighted digraphs
- Leontief meets Markov: sectoral vulnerabilities through circular connectivity
- Incremental computation of pseudo-inverse of Laplacian
- A generalized inverse for graphs with absorption
- Pseudoinverses of Signed Laplacian Matrices
- On resistance distance of Markov chain and its sum rules
- Hitting time quasi-metric and its forest representation
- Hubs-biased resistance distances on graphs and networks
- Markov fundamental tensor and its applications to network analysis
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)
