A matrix-based measure of inter-node walk relatedness in a network
DOI10.1134/S0001434609010118zbMath1181.15040MaRDI QIDQ1033899
V. M. Chelnokov, V. L. Zefirova
Publication date: 10 November 2009
Published in: Mathematical Notes (Search for Journal in Brave)
nonnegative matrix; adjacency matrix; network reliability; irreducible matrix; dominant eigenvalue; bipartite network; graph connectedness; eigenvalue drop; network node coreness; network walk; node/link removal; walk relatedness measure
90B18: Communication networks in operations research
90B10: Deterministic network models in operations research
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
15B48: Positive matrices and their generalizations; cones of matrices
Related Items
Cites Work