Pages that link to "Item:Q3388879"
From MaRDI portal
The following pages link to Non-backtracking walk centrality for directed networks (Q3388879):
Displaying 19 items.
- On the exponential generating function for non-backtracking walks (Q1669018) (← links)
- On the \(\alpha\)-nonbacktracking centrality for complex networks: existence and limit cases (Q1713144) (← links)
- Generalized walks-based centrality measures for complex biological networks (Q1715403) (← links)
- Dynamic Katz and related network measures (Q2085424) (← links)
- Non-backtracking PageRank: from the classic model to Hashimoto matrices (Q2213846) (← links)
- The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis (Q4604568) (← links)
- Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization (Q4999399) (← links)
- Nonlocal pagerank (Q5006301) (← links)
- A Theory for Backtrack-Downweighted Walks (Q5006453) (← links)
- A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph (Q5036323) (← links)
- Beyond non-backtracking: non-cycling network centrality measures (Q5160872) (← links)
- Non-Backtracking Alternating Walks (Q5231195) (← links)
- Matrix functions in network analysis (Q6068264) (← links)
- Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs (Q6154946) (← links)
- Spectral theory of the non-backtracking Laplacian for graphs (Q6172286) (← links)
- Game theoretic foundations of the gately power measure for directed networks (Q6555652) (← links)
- Generating functions of non-backtracking walks on weighted digraphs: radius of convergence and Ihara's theorem (Q6615420) (← links)
- Hitting times for second-order random walks (Q6622955) (← links)
- Two accelerated non-backtracking PageRank algorithms for large-scale networks (Q6645931) (← links)
