Random walks on digraphs, the generalized digraph Laplacian and the degree of asymmetry

DOI10.1007/978-3-642-18009-5_8zbMATH Open1311.05173OpenAlexW1513079230MaRDI QIDQ3067508FDOQ3067508

Authors: Yanhua Li, Zhi-Li Zhang 

Publication date: 21 January 2011

Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18009-5_8

Recommendations

• Digraph Laplacian and the degree of asymmetry
• Laplacians and the Cheeger inequality for directed graphs
• Commute times for a directed graph using an asymmetric Laplacian
• The simple random walk and max-degree walk on a directed graph
• scientific article; zbMATH DE number 2067820

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)

Cited In (12)

• Digraph Laplacian and the degree of asymmetry
• A metric on directed graphs and Markov chains based on hitting probabilities
• Title not available (Why is that?)
• Voter model on signed social networks
• On fast computation of directed graph Laplacian pseudo-inverse
• Laplacians and the Cheeger inequality for directed graphs
• Intrinsic graph structure estimation using graph Laplacian
• Coevolutionary systems and PageRank
• A hitting time formula for the discrete Green's function
• Clustering and community detection in directed networks: a survey
• Random walks and orthogonal functions associated with highly symmetric graphs
• Markov fundamental tensor and its applications to network analysis

This page was built for publication: Random walks on digraphs, the generalized digraph Laplacian and the degree of asymmetry

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