DeepAI AI Chat
Log In Sign Up

Random Walk Laplacian and Network Centrality Measures

by   Daniel Boley, et al.

Random walks over directed graphs are used to model activities in many domains, such as social networks, influence propagation, and Bayesian graphical models. They are often used to compute the importance or centrality of individual nodes according to a variety of different criteria. Here we show how the pseudoinverse of the "random walk" Laplacian can be used to quickly compute measures such as the average number of visits to a given node and various centrality and betweenness measures for individual nodes, both for the network in general and in the case a subset of nodes is to be avoided. We show that with a single matrix inversion it is possible to rapidly compute many such quantities.


page 1

page 2

page 3

page 4


Faster Clustering via Non-Backtracking Random Walks

This paper presents VEC-NBT, a variation on the unsupervised graph clust...

Closeness Centrality via the Condorcet Principle

We uncover a new relation between Closeness centrality and the Condorcet...

On Fast Computation of Directed Graph Laplacian Pseudo-Inverse

The Laplacian matrix and its pseudo-inverse for a strongly connected dir...

A Distributed Laplacian Solver and its Applications to Electrical Flow and Random Spanning Tree Computation

We present a distributed solver for a large and important class of Lapla...

Global estimation of unintended pregnancy and abortion using a Bayesian hierarchical random walk model

Unintended pregnancy and abortion estimates are needed to inform and mot...

Avoidance Markov Metrics and Node Pivotality Ranking

We introduce the avoidance Markov metrics and theories which provide mor...

Learning Networks from Random Walk-Based Node Similarities

Digital presence in the world of online social media entails significant...