Modulus of families of walks on graphs

DOI10.1090/conm/699/14080zbMath1400.05233arXiv1401.7640OpenAlexW1864214034MaRDI QIDQ4686872

Faryad Darabi Sahneh, Max Goering, Nathan Albin, Pietro Poggi-Corradini

Publication date: 10 October 2018

Published in: Contemporary Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.7640

zbMATH Keywords

Karush-Kuhn-Tucker conditionsBeurling's criterion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Fairest edge usage and minimum expected overlap for random spanning trees ⋮ Blocking duality for \(p\)-modulus on networks and applications ⋮ Conformal dimension via p-resistance: Sierpinski carpet ⋮ Minimal subfamilies and the probabilistic interpretation for modulus on graphs ⋮ Modulus metrics on networks ⋮ Modulus on graphs as a generalization of standard graph theoretic quantities

Cites Work

• Generalized network measures based on modulus of families of walks
• Effective resistance on graphs and the epidemic quasimetric
• Circle packings and combinatorial moduli
• The extremal length of a network
• Square tilings with prescribed combinatorics
• Modulus on graphs as a generalization of standard graph theoretic quantities
• Mapping properties of analytic functions on the disk
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Modulus of families of walks on graphs