Modulus on graphs as a generalization of standard graph theoretic quantities

Abstract

This paper presents new results for the modulus of families of walks on a graph---a discrete analog of the modulus of curve families due to Beurling and Ahlfors. Particular attention is paid to the dependence of the modulus on its parameters. Modulus is shown to generalize (and interpolate among) three important quantities in graph theory: shortest path, effective resistance, and max-flow or min-cut.

Updated with referee's comments. To appear in ECGD

Cited by in corpus (9)

• Network clustering and community detection using modulus of families of loops
• Minimal subfamilies and the probabilistic interpretation for modulus on graphs
• Blocking duality for $p$-modulus on networks and applications
• On resistance distance of Markov chain and its sum rules
• Infinity modulus and the essential metric
• Modulus metrics on networks
• Generalization of Effective Conductance Centrality for Egonetworks
• Modulus of time-respecting paths
• Asymptotics of automorphic spectra and the trace formula