Random Walks on Digraphs, the Generalized Digraph Laplacian and the Degree of Asymmetry

DOI10.1007/978-3-642-18009-5_8zbMath1311.05173OpenAlexW1513079230MaRDI QIDQ3067508

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

Mathematics Subject Classification ID

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

Related Items (9)

A Hitting Time Formula for the Discrete Green's Function ⋮ Markov fundamental tensor and its applications to network analysis ⋮ Unnamed Item ⋮ Intrinsic Graph Structure Estimation Using Graph Laplacian ⋮ Clustering and community detection in directed networks: a survey ⋮ On fast computation of directed graph Laplacian pseudo-inverse ⋮ Coevolutionary systems and PageRank ⋮ Voter Model on Signed Social Networks ⋮ A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities

This page was built for publication: Random Walks on Digraphs, the Generalized Digraph Laplacian and the Degree of Asymmetry