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)

zbMATH Keywords

nonnegative matrixadjacency matrixnetwork reliabilityirreducible matrixdominant eigenvaluebipartite networkgraph connectednesseigenvalue dropnetwork node corenessnetwork walknode/link removalwalk relatedness measure

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

The walk distances in graphs ⋮ The graph bottleneck identity

Cites Work

• Computational methods of linear algebra
• On a matrix-based measure of the degree of coreness of a node in a network
• Statistical mechanics of complex networks
• Authoritative sources in a hyperlinked environment
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item