Modulus of families of walks on graphs

@inproceedings{Albin2014ModulusOF,
  title={Modulus of families of walks on graphs},
  author={Nathan Albin and Pietro Poggi-Corradini and Faryad Darabi Sahneh and Max Goering},
  year={2014}
}
We introduce the notion of modulus of families of walks on graphs. We show how Beurling's famous criterion for extremality, that was formulated in the continuous case, can be interpreted on graphs as an instance of the Karush-Kuhn-Tucker conditions. We then develop an algorithm to numerically compute modulus using Beurling's criterion as our guide. 

Similar Papers

Figures and Tables from this paper.