37 citations · 78 across the 20 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2022
Escape times for subgraph detection and graph partitioning
Zachary M. Boyd, Nicolas Fraiman, Jeremy L. Marzuola +2
We provide a rearrangement based algorithm for fast detection of subgraphs of vertices with long escape times for directed or undirected networks. Complementing other notions o…
cs.SI2020★ 7 cited
A metric on directed graphs and Markov chains based on hitting probabilities
Zachary M. Boyd, Nicolas Fraiman, Jeremy L. Marzuola +3
The shortest-path, commute time, and diffusion distances on undirected graphs have been widely employed in applications such as dimensionality reduction, link prediction, and trip…