Jul 2026· The Electronic Journal of Linear Algebra· 0 citations
TL;DR
This work demonstrates how equilibrium measures within the framework of Schr¨odinger random walks on networks can be leveraged to compute key network parameters such as the Mean First Passage Time (MFPT) and Kemeny's constant by expressing these parameters in terms of generalized inverses of the associated M-matrix.
Abstract
In this work, we explore the concept of equilibrium measures within the framework of Schr¨odinger random walks on networks. Building on previous work, we demonstrate how these equilibrium measures can be leveraged to compute key network parameters such as the Mean First Passage Time (MFPT) and Kemeny’s constant. By expressing these parameters in terms of generalized inverses of the associated M-matrix, we provide new insights and efficient computational tools for network analysis. The results are particularly applicable to both star and path networks, where we offer explicit formulations for these fundamental quantities. Our findings highlight the importance of equilibrium measures as a powerful tool in the study of complex networks.
By employing the spectral decomposition of the transition probability matrix, analytical expressions for the stationary distribution and mean first-passage time are derived, providing a quantitative framework for characterizing search efficiency in directed systems.
Ziran Lu, Feng Zhu, Rui Zheng· International Journal of Mod...· 0 citations
It is shown that, under mild regularity conditions, the realized values of row-normalized centralities concentrate around their expectations, and this greatly simplifies the analysis of these stochastic networks.
M. Mostagir, James Siderius· Mathematics of Operations Re...· 1 citation
The stochastic block model is a widely studied model of community structure in networks. Here we study the component structure and percolation properties of networks generated from this model and its variants, using exact methods based on probability generating functions. In particular, we derive expressions for the si...
The analysis of random walks on networks often relies on global quantities that average over nodes, thereby masking local differences in diffusion speed. This study introduces a vertex-level quantity Hi, defined as the finite-window fitted scaling exponent of the mean squared resistance distance ⟨Ωi2(t)⟩∼Cit2Hi from a...
In this paper, we prove that the fluctuations of the graph distance and the effective resistance on the trace of a random walk in four and five dimensions converge in distribution to a stable law. In previous work, the first and second authors proved that the corresponding fluctuations converge to a Gaussian distributi...
A. Adhikari, Izumi Okada, D. Shiraishi· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.