3 citations · 6 across the 5 of their papers we have counts for
5 papers
Random Walk Laplacian and Network Centrality Measures
Daniel Boley, Alejandro Buendia, Golshan Golnari
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 t…
Avoidance Markov Metrics and Node Pivotality Ranking
Golshan Golnari, Zhi-Li Zhang, Daniel Boley
We introduce the avoidance Markov metrics and theories which provide more flexibility in the design of random walk and impose new conditions on the walk to avoid (or transit) a spe…
Fast Distance Sensitivity Oracle for Multiple Failures
Golshan Golnari, Zhi-Li Zhang
When a network is prone to failures, it is very expensive to compute the shortest paths every time from the scratch. Distance sensitivity oracle provides this privilege to find the…
Random Walk Fundamental Tensor and Its Applications to Network Analysis
Golshan Golnari, Zhi-Li Zhang, Daniel Boley
We first present a comprehensive review of various random walk metrics used in the literature and express them in a consistent framework. We then introduce fundamental tensor -- a…
Revisiting Non-Progressive Influence Models: Scalable Influence Maximization
Golshan Golnari, Amir Asiaee, Arindam Banerjee +1
While influence maximization in social networks has been studied extensively in computer science community for the last decade the focus has been on the progressive influence model…