# Optimal control for diffusions on graphs

arXiv: https://arxiv.org/abs/1703.09892 · HTML: https://mlsanity.com/paper/1703.09892/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Mar 2017.

## Built on by (most cited first, 1 of 1)

- [Harnessing Multiple Correlated Networks for Exact Community Recovery](https://mlsanity.com/paper/2412.02796/) (2024)

## Abstract (arXiv)

Starting from a unit mass on a vertex of a graph, we investigate the minimum number of "controlled diffusion" steps needed to transport a constant mass p outside of the ball of radius n. In a step of a controlled diffusion process we may select any vertex with positive mass and topple its mass equally to its neighbors. Our initial motivation comes from the maximum overhang question in one dimension, but the more general case arises from optimal mass transport problems. On mathbbZd we show that Theta( nd+2 ) steps are necessary and sufficient to transport the mass. We also give sharp bounds on the comb graph and d-ary trees. Furthermore, we consider graphs where simple random walk has positive speed and entropy and which satisfy Shannon's theorem, and show that the minimum number of controlled diffusion steps is exp( n · h / ℓ ( 1 + o(1) )), where h is the Avez asymptotic entropy and ℓ is the speed of random walk. As examples, we give precise results on Galton-Watson trees and the product of trees mathbbTd × mathbbTk.