602 citations · 1k across the 31 of their papers we have counts for
36 papers
Graph Disjointness with Applications to Reversible Markov Chains
Yang Xiang, Kevin McGoff, Andrew B. Nobel
The correspondence between weighted undirected graphs and reversible Markov chains via vertex random walks is simple and well known. Leveraging this correspondence and ideas from t…
Optimal graph joining with applications to isomorphism detection and identification
Phuong N. Hoàng, Kevin McGoff, Andrew B. Nobel +2
We introduce an optimal transport based approach for comparing undirected graphs with non-negative edge weights and general vertex labels, and we study connections between the resu…
Estimation of Stationary Optimal Transport Plans
Kevin O'Connor, Kevin McGoff, Andrew B Nobel
We study optimal transport for stationary stochastic processes taking values in finite spaces. In order to reflect the stationarity of the underlying processes, we restrict attenti…
Alignment and Comparison of Directed Networks via Transition Couplings of Random Walks
Bongsoo Yi, Kevin O'Connor, Kevin McGoff +1
We describe and study a transport based procedure called NetOTC (network optimal transition coupling) for the comparison and alignment of two networks. The networks of interest may…
Finding Groups of Cross-Correlated Features in Bi-View Data
Miheer Dewaskar, John Palowitch, Mark He +2
Datasets in which measurements of two (or more) types are obtained from a common set of samples arise in many scientific applications. A common problem in the exploratory analysis…
Optimal Transport for Stationary Markov Chains via Policy Iteration
Kevin O'Connor, Kevin McGoff, Andrew B. Nobel
We study the optimal transport problem for pairs of stationary finite-state Markov chains, with an emphasis on the computation of optimal transition couplings. Transition couplings…