Generalized network measures based on modulus of families of walks

DOI10.1016/j.cam.2016.01.027zbMath1338.05256DBLPjournals/jcam/ShakeriPSA16OpenAlexW2299900275WikidataQ64416405 ScholiaQ64416405MaRDI QIDQ298245

Heman Shakeri, Nathan Albin, Caterina Scoglio, Pietro Poggi-Corradini

Publication date: 20 June 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.01.027

zbMATH Keywords

centrality measurefamily of walksmodulus

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Generalization of effective conductance centrality for egonetworks ⋮ Blocking duality for \(p\)-modulus on networks and applications ⋮ Minimal subfamilies and the probabilistic interpretation for modulus on graphs ⋮ Modulus on graphs as a generalization of standard graph theoretic quantities ⋮ Modulus of families of walks on graphs

Uses Software

• NetworkX
• CVXOPT

Cites Work

• Unnamed Item
• Minimal subfamilies and the probabilistic interpretation for modulus on graphs
• Circle packings and combinatorial moduli
• The extremal length of a network
• Square tilings with prescribed combinatorics
• Optimal information dissemination strategy to promote preventive behaviors in multilayer epidemic networks
• The centrality index of a graph
• Modulus on graphs as a generalization of standard graph theoretic quantities
• Emergence of Scaling in Random Networks
• Maximal Flow Through a Network
• Random Geometric Graphs
• STACS 2005

This page was built for publication: Generalized network measures based on modulus of families of walks