Measuring Spatial Clustering via Metropolis-Hastings Diffusion Distance

arXiv:2607. 14880v1 Announce Type: cross Abstract: We propose a novel measure of the discrepancy between two probability distributions $f$ and $g$ on a graph - which we call the diffusion distance - that measures the rate of convergence of $f$ to $g$ under a graph-constrained Markov chain with stationary distribution $g$.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

• diffusion