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

No abstract is available for this paper.

• Publication year

  2010

• Venue

  Workshop on Algorithms and Models for the Web-Graph

• Publication date

  2010-12-13

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-18009-5_8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Digraph Laplacian and the Degree of Asymmetry

  2012cited by this paper
• Exact Analysis of Latency of Stateless Opportunistic Forwarding

  2009cited by this paper
• Higher Eigenvalues of Graphs

  2009cited by this paper
• On the Hitting Times of Quantum Versus Random Walks

  2008cited by this paper
• Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows

  2008cited by this paper
• Improving Connectivity via Relays Deployment in Wireless Sensor Networks

  2007cited by this paper
• Random walk based routing protocol for wireless sensor networks

  2007cited by this paper
• A matrix handbook for statisticians

  2007cited by this paper
• Matrix Mathematics: Theory, Facts, and Formulas with Application to Linear Systems Theory

  2005cited by this paper
• Learning from labeled and unlabeled data on a directed graph

  2005cited by this paper
• Laplacians and the Cheeger Inequality for Directed Graphs

  2005influential reference
• Active query forwarding in sensor networks

  2005cited by this paper
• Mixing Times for Random Walks on Geometric Random Graphs

  2005cited by this paper
• Efficient and robust query processing in dynamic environments using random walk techniques

  2004cited by this paper
• Rumor Routing Algorithm For Sensor Networks

  2002cited by this paper
• Spectral gap and log-Sobolev constant for balanced matroids

  2002cited by this paper
• Introduction to Probability

  2002cited by this paper
• Discrete Green's Functions

  2000cited by this paper
• The Anatomy of a Large-Scale Hypertextual Web Search Engine

  1998cited by this paper
• Spectral Graph Theory, Regional Conference Series in Math.

  1997influential reference
• Spectral Graph Theory

  1996cited by this paper
• Random Walks on Graphs: A Survey

  1993influential reference
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow

  1992cited by this paper
• Random walks and the effective resistance of networks

  1991cited by this paper
• Eigenvalue bounds on convergence to stationarity for nonreversible markov chains

  1991influential reference
• Conductance and convergence of Markov chains-a combinatorial treatment of expanders

  1989cited by this paper
• Lower bounds for covering times for reversible Markov chains and random walks on graphs

  1989cited by this paper
• The electrical resistance of a graph captures its commute and cover times

  1989cited by this paper
• Covering Problems for Brownian Motion on Spheres

  1988cited by this paper
• Random Walks and Electric Networks: REFERENCES

  1987cited by this paper
• Random Walks and Electric Networks: THE CLASSICAL PROOFS OF PÓLYA'S THEOREM

  1984cited by this paper

• Re-imagining Spectral Graph Theory

  2025cites this paper
• Semantic Template-based Convolutional Neural Network for Text Classification

  2023cites this paper
• Community models for networks observed through edge nominations

  2023cites this paper
• Co-clustering Vertices and Hyperedges via Spectral Hypergraph Partitioning

  2021influential citation
• On Fast Computation of Directed Graph Laplacian Pseudo-Inverse

  2020cites this paper
• Hypergraph Random Walks, Laplacians, and Clustering

  2020influential citation
• A metric on directed graphs and Markov chains based on hitting probabilities

  2020cites this paper
• Markov fundamental tensor and its applications to network analysis

  2019cites this paper
• Coevolutionary systems and PageRank

  2019cites this paper
• Weighted (Co)homology and Weighted Laplacian

  2018influential citation
• Random Walk Fundamental Tensor and its Applications to Network Analysis

  2018cites this paper
• The Forward-Backward Embedding of Directed Graphs

  2018cites this paper
• Open Relation Extraction and Grounding

  2017cites this paper
• Unsupervised graph-based relation extraction and validation for knowledge base population

  2017cites this paper
• Diffusion filtering of graph signals and its use in recommendation systems

  2016cites this paper
• Understanding Complex Networks Using Graph Spectrum

  2015influential citation
• A Hitting Time Formula for the Discrete Green's Function

  2015cites this paper
• The Topology of Directed Complex Networks: Computational Analysis and Applications

  2015cites this paper
• Voter Model on Signed Social Networks

  2015cites this paper
• The discrete Green's function and stopping rules for random walks on graphs

  2015cites this paper
• Intrinsic Graph Structure Estimation Using Graph Laplacian

  2014cites this paper
• Randomized Search of Graphs in Log Space and Probabilistic Computation

  2014cites this paper
• Digraph Spectral Clustering with Applications in Distributed Sensor Validation

  2014cites this paper
• Discrepancy inequalities for directed graphs

  2014cites this paper
• From Shortest-Path to All-Path: The Routing Continuum Theory and Its Applications

  2014cites this paper
• An Algorithm for Directed Graph Estimation

  2014influential citation
• Characterizing diverse link patterns in complex networks: theory and applications

  2013cites this paper
• Clustering and Community Detection in Directed Networks: A Survey

  2013cites this paper
• Adaptive energy-aware routing framework in transmission cost constrained wireless sensor networks

  2013cites this paper
• Trading Optimality for Scalability in Large-Scale Opportunistic Routing

  2013cites this paper
• Random Walks and Green's Function on Digraphs: A Framework for Estimating Wireless Transmission Costs

  2013cites this paper
• Topology and Random-Walk Network Representation of Cardiac Dynamics for Localization of Myocardial Infarction

  2013cites this paper
• Digraph Laplacian and the Degree of Asymmetry

  2012cites this paper
• Mutual or Unrequited Love: Identifying Stable Clusters in Social Networks with Uni- and Bi-directional Links

  2012cites this paper
• Towards trustworthy computing on social networks: measurements and new applications.

  2012cites this paper
• Commute Times for a Directed Graph using an Asymmetric Laplacian

  2011cites this paper
• Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships

  2011cites this paper