Random walks associated with symmetric M-matrices

DOI10.1016/J.LAA.2023.10.009MaRDI QIDQ6536724zbMATH OpenFDO

Authors A. Carmona, A. M. Encinas, M. J. Olmo Jiménez, Antoine Martin

Publication date 13 May 2024

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2023.10.009

zbMATH Keywords

\(M\)-matricesbiased random walksgeneralized inversesgroup inverseKemeny's constantmean first passage timerandom walksSchrödinger operators

Mathematics Subject Classification ID

Random walks on graphs (05C81) Discrete potential theory (31C20) Schrödinger operator, Schrödinger equation (35J10)

Recommendations

• Random walk centrality and a partition of Kemeny's constant.
• Kemeny's constant and global mean first passage time of random walks on octagonal cell network
• Random walks on the triangular prism and other vertex-transitive graphs
• Random walks on weighted networks: a survey of local and non-local dynamics
• The class of inverse M-matrices associated to random walks

Cites work

• Characterization of symmetric \(M\)-matrices as resistive inverses
• Characterizations of generalized inverses associated with Markovian kernels
• Generalized inverses and their application to applied probability problems
• Generalized inverses of Markovian kernels in terms of properties of the Markov chain
• Generalized inverses of symmetric \(M\)-matrices
• Generalized inverses. Theory and applications.
• scientific article; zbMATH DE number 3145626 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• Kemeny's constant and the effective graph resistance
• Kirchhoff indexes of a network
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• Potential theory for Schrödinger operators on finite networks
• Random walks and local cuts in graphs
• The computation of key properties of Markov chains via perturbations

Cited in

(2)

• An innovative algorithm for estimating the minimum eigenvalue of M-matrices
• Network parameters via equilibrium measures in Schrödinger random walks

This page was built for publication: Random walks associated with symmetric \(M\)-matrices

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