456 citations · 706 across the 32 of their papers we have counts for
4 papers · 1 filter
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…
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…
Incremental Computation of Pseudo-Inverse of Laplacian: Theory and Applications
Gyan Ranjan, Zhi-Li Zhang, Daniel Boley
A divide-and-conquer based approach for computing the Moore-Penrose pseudo-inverse of the combinatorial Laplacian matrix $(\bb L^+)$ of a simple, undirected graph is proposed. % Th…
Geometry of Complex Networks and Topological Centrality
Gyan Ranjan, Zhi-Li Zhang
We explore the geometry of complex networks in terms of an n-dimensional Euclidean embedding represented by the Moore-Penrose pseudo-inverse of the graph Laplacian $(\bb L^+)$. The…