Modulus of families of walks on graphs
classification
🧮 math.CO
math.CV
keywords
graphsmodulusbeurlingcriterionfamilieswalksalgorithmcase
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.