9 citations · 9 across the 1 of their papers we have counts for
4 papers
On Fast Computation of Directed Graph Laplacian Pseudo-Inverse
Daniel Boley
The Laplacian matrix and its pseudo-inverse for a strongly connected directed graph is fundamental in computing many properties of a directed graph. Examples include random-walk ce…
Mining Novel Multivariate Relationships in Time Series Data Using Correlation Networks
Saurabh Agrawal, Michael Steinbach, Daniel Boley +5
In many domains, there is significant interest in capturing novel relationships between time series that represent activities recorded at different nodes of a highly complex system…
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…
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…