Modulus metrics on networks

DOI10.3934/dcdsb.2018161zbMath1402.05052arXiv1803.03680OpenAlexW2794411101WikidataQ129641009 ScholiaQ129641009MaRDI QIDQ1756971

Pietro Poggi-Corradini, Nathan Albin, Nethali Fernando

Publication date: 28 December 2018

Published in: Discrete and Continuous Dynamical Systems. Series B (Search for Journal in Brave)

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

zbMATH Keywords

shortest patheffective resistance\(p\)-modulusgraph metricsmincutsnowflaking

Mathematics Subject Classification ID

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

Related Items

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

Uses Software

• SciPy
• igraph
• CVXPY

Cites Work

• Unnamed Item
• Unnamed Item
• Cover times, blanket times, and majorizing measures
• Minimal subfamilies and the probabilistic interpretation for modulus on graphs
• Modulus on graphs as a generalization of standard graph theoretic quantities
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Graphs, Vectors, and Matrices
• Modulus of families of walks on graphs