Blocking duality for \(p\)-modulus on networks and applications

DOI10.1007/s10231-018-0806-0zbMath1414.90298arXiv1612.00435OpenAlexW2964072643WikidataQ128930274 ScholiaQ128930274MaRDI QIDQ2420264

Pietro Poggi-Corradini, Nathan Albin, Nethali Fernando, Jason Clemens

Publication date: 5 June 2019

Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)

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

zbMATH Keywords

effective resistance\(p\)-modulusblocking dualityrandomly weighted graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

On the sharp lower bound for duality of modulus, Fairest edge usage and minimum expected overlap for random spanning trees, Spanning tree modulus for secure broadcast games, Construction of 𝑝-energy and associated energy measures on Sierpiński carpets, Submodular functions and rooted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized network measures based on modulus of families of walks
• Minimal subfamilies and the probabilistic interpretation for modulus on graphs
• Circle packings and combinatorial moduli
• On the spanning tree polyhedron
• The extremal length of a network
• Resistance bounds for first-passage percolation and maximum flow
• Square tilings with prescribed combinatorics
• Lectures on analysis on metric spaces
• Modulus metrics on networks
• The local homeomorphism property of spatial quasiregular mappings with distortion close to one
• Fairest edge usage and minimum expected overlap for random spanning trees
• Modulus on graphs as a generalization of standard graph theoretic quantities
• Modulus of families of walks on graphs
• Convex Analysis
• Energy of convex sets, shortest paths, and resistance