Modulus metrics on networks

DOI10.3934/DCDSB.2018161zbMATH Open1402.05052arXiv1803.03680OpenAlexW2794411101WikidataQ129641009 ScholiaQ129641009MaRDI QIDQ1756971FDOQ1756971

Authors: Nathan Albin, Nethali Fernando, Pietro Poggi-Corradini 

Publication date: 28 December 2018

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

Abstract: The concept of $p$-modulus gives a way to measure the richness of a family of objects on a graph. In this paper, we investigate the families of connecting walks between two fixed nodes and show how to use $p$-modulus to form a parametrized family of graph metrics that generalize several well-known and widely-used metrics. We also investigate a characteristic of metrics called the "antisnowflaking exponent" and present some numerical findings supporting a conjecture about the new metrics. We end with explicit computations of the new metrics on some selected graphs.

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

Recommendations

• Generalized network measures based on modulus of families of walks
• Metric structure of random networks
• Open problems and new directions for \(p\)-modulus on networks
• Metric models for random graphs
• Asymptotic distribution of modularity in networks
• The mathematics of non-linear metrics for nested networks
• Modularity of complex networks models
• Modulus on graphs as a generalization of standard graph theoretic quantities
• Networklike metric spaces

zbMATH Keywords

shortest patheffective resistance\(p\)-modulusgraph metricsmincutsnowflaking

Mathematics Subject Classification ID

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

Cites Work

• CVXPY: a Python-embedded modeling language for convex optimization
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Title not available (Why is that?)
• Modulus on graphs as a generalization of standard graph theoretic quantities
• Minimal subfamilies and the probabilistic interpretation for modulus on graphs
• Cover times, blanket times, and majorizing measures
• Modulus of families of walks on graphs
• Graphs, Vectors, and Matrices

Cited In (1)

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

Uses Software

• SciPy
• igraph
• CVXPY

This page was built for publication: Modulus metrics on networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756971)