Generalization of effective conductance centrality for egonetworks
From MaRDI portal
Publication:2151709
DOI10.1016/j.physa.2018.07.039OpenAlexW2883563426MaRDI QIDQ2151709
Pietro Poggi-Corradini, Heman Shakeri, Nathan Albin, Behnaz Moradi-Jamei, Caterina Scoglio
Publication date: 5 July 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.02703
Uses Software
Cites Work
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- Generalized network measures based on modulus of families of walks
- Minimal subfamilies and the probabilistic interpretation for modulus on graphs
- Effective graph resistance
- The extremal length of a network
- Modulus on graphs as a generalization of standard graph theoretic quantities
- Probability on Trees and Networks
- Emergence of Scaling in Random Networks
- Random Geometric Graphs
- Collective dynamics of ‘small-world’ networks
- On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
This page was built for publication: Generalization of effective conductance centrality for egonetworks