Pages that link to "Item:Q5256535"

The following pages link to On the Limiting Behavior of Parameter-Dependent Network Centrality Measures (Q5256535):

Displaying 37 items.

• Accounting for the role of long walks on networks via a new matrix function (Q509007) (← links)
• Gaussianization of the spectra of graphs and networks. Theory and applications (Q1630605) (← links)
• Local community detection in dynamic graphs using personalized centrality (Q1657082) (← links)
• 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)
• Walk entropy and walk-regularity (Q1743135) (← links)
• Tackling information asymmetry in networks: a new entropy-based ranking index (Q1756553) (← links)
• Orthogonal expansion of network functions (Q2022395) (← links)
• Strategic connections in a hierarchical society: wedge between observed and fundamental valuations (Q2062241) (← links)
• Structural heterogeneity and evolutionary dynamics on complex networks (Q2062255) (← links)
• Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels (Q2068490) (← links)
• Influence measures in subnetworks using vertex centrality (Q2153638) (← links)
• Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations (Q2228533) (← links)
• On the convergence of the minimally irreducible Markov chain method with applications to PageRank (Q2363682) (← links)
• Subgraph centrality and walk-regularity (Q2419001) (← links)
• Analysis of directed networks via the matrix exponential (Q2423601) (← links)
• Social interactions and the prophylaxis of SI epidemics on networks (Q2656375) (← links)
• Edge Modification Criteria for Enhancing the Communicability of Digraphs (Q2806181) (← links)
• Risk-Dependent Centrality in Economic and Financial Networks (Q3295871) (← links)
• Updating and Downdating Techniques for Optimizing Network Communicability (Q3460271) (← links)
• Centrality Analysis for Modified Lattices (Q4588933) (← links)
• The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis (Q4604568) (← links)
• What network topology can tell in election prediction (Q4634531) (← links)
• Exploring the “Middle Earth” of network spectra via a Gaussian matrix function (Q4642551) (← links)
• A Theory for Backtrack-Downweighted Walks (Q5006453) (← links)
• Mittag--Leffler Functions and their Applications in Network Science (Q5014163) (← links)
• Three Hypergraph Eigenvector Centralities (Q5025759) (← links)
• Beyond non-backtracking: non-cycling network centrality measures (Q5160872) (← links)
• Functionability in complex networks: Leading nodes for the transition from structural to functional networks through remote asynchronization (Q5218141) (← links)
• Non-Backtracking Alternating Walks (Q5231195) (← links)
• Eigenvector-Based Centrality Measures for Temporal Networks (Q5737762) (← links)
• Matrix functions in network analysis (Q6068264) (← links)
• Centrality-Based Traffic Restriction in Delayed Epidemic Networks (Q6084952) (← links)
• Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds (Q6094748) (← links)
• An Edge Centrality Measure Based on the Kemeny Constant (Q6158484) (← links)
• A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks (Q6489304) (← links)
• Branching processes reveal influential nodes in social networks (Q6492041) (← links)