Multiplicative Path Weights in Networks: From Katz Connectivity to Mean First-Passage Times
Abstract
Signal dispersion, stress propagation in interbank systems, and transmission probabilities in epidemic and reliability models are all captured by studying paths on directed graphs where the path weight is defined as the product of its edge weights. Connectivity in such networks is naturally quantified by aggregating these multiplicative path weights across nodes. This paper provides a comprehensive treatise on connectivity and ranking measures based on multiplicative path weights. We demonstrate how standard all-path connectivity, such as the standard Katz centrality, can be extended beyond its classical spectral threshold. In addition, we derive closed-form expressions for connectivity based on first-hit paths and introduce a new version of Katz centrality. Furthermore, for random edge weights, we derive resolvent-based expressions for the first and second moments, alongside variance bounds, under a path-indexed coupling framework. Finite irreducible Markov chains are a subclass of the models studied, and we show that the scaled matrix of first-hit path probabilities is the probability-generating function for first-passage and return times, and that differentiation yields the classical first-passage times. Numerical examples illustrate the application of our results in a variety of settings.
Related
- First-Passage Time Problems for Jump-Diffusion Processes with Positive and Negative Jumps
- Half-space last passage percolation with inhomogeneous first row
- Fluctuation bounds for rotationally invariant first-passage percolation
- Generalized Images for Brownian First Passage to Monomial Boundaries
- Extreme First-Passage Time of Many Interacting Particles
BibTeX
@misc{burg2026multiplicative,
title = {{Multiplicative Path Weights in Networks: From Katz Connectivity to Mean First-Passage Times}},
author = {Robbert van der Burg and Bernd Heidergott and Thao Le and Alessandro Zocca},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.21474},
eprint = {2610.21474},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.21474},
}
RIS
TY - UNPB
TI - Multiplicative Path Weights in Networks: From Katz Connectivity to Mean First-Passage Times
AU - Robbert van der Burg
AU - Bernd Heidergott
AU - Thao Le
AU - Alessandro Zocca
PY - 2026
DA - 2026/10/15
PB - arXiv
DO - 10.48550/arxiv.2610.21474
UR - https://arxiv.org/abs/2610.21474
AB - Signal dispersion, stress propagation in interbank systems, and transmission probabilities in epidemic and reliability models are all captured by studying paths on directed graphs where the path weight is defined as the product of its edge weights. Connectivity in such networks is naturally quantified by aggregating these multiplicative path weights across nodes. This paper provides a comprehensive treatise on connectivity and ranking measures based on multiplicative path weights. We demonstrate how standard all-path connectivity, such as the standard Katz centrality, can be extended beyond its classical spectral threshold. In addition, we derive closed-form expressions for connectivity based on first-hit paths and introduce a new version of Katz centrality. Furthermore, for random edge weights, we derive resolvent-based expressions for the first and second moments, alongside variance bounds, under a path-indexed coupling framework. Finite irreducible Markov chains are a subclass of the models studied, and we show that the scaled matrix of first-hit path probabilities is the probability-generating function for first-passage and return times, and that differentiation yields the classical first-passage times. Numerical examples illustrate the application of our results in a variety of settings.
ER -