Random Walk Laplacian and Network Centrality Measures

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 ho...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Boley, Daniel, Buendia, Alejandro, Golnari, Golshan
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Numerical Analysis Computer Science - Social and Information Networks
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!