A new centrality measure based on random walks for multilayer networks under the framework of tensor computation
From MaRDI portal
Publication:2160096
DOI10.1016/j.physa.2019.04.236OpenAlexW2935780549MaRDI QIDQ2160096
Publication date: 2 August 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2019.04.236
random walkscentralitytensor representationmultilayer networkslimiting probability distributiontensor iterative computation
Cites Work
- Unnamed Item
- Unnamed Item
- Perron-Frobenius theorem for nonnegative tensors
- Ranking the spreading ability of nodes in complex networks based on local structure
- The global convergence of the nonlinear power method for mixed-subordinate matrix norms
- Complex networks: structure and dynamics
- Eigenvalues of a real supersymmetric tensor
- Sensitivity and Stability of Ranking Vectors
- Authoritative sources in a hyperlinked environment
- Eigenvector centrality of nodes in multiplex networks
- Uniqueness in the Schauder Fixed Point Theorem
- A biplex approach to PageRank centrality: From classic to multiplex networks
- Node and Layer Eigenvector Centralities for Multiplex Networks
- The Perron--Frobenius Theorem for Multihomogeneous Mappings
- A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps
- The contractivity of cone-preserving multilinear mappings
- Random Walker Ranking for NCAA Division I-A Football
- A NEW MEASURE OF RANK CORRELATION