The following pages link to Axioms for Centrality (Q4985356):
Displaying 45 items.
- Equilibria and centrality in link formation games (Q524984) (← links)
- On the maximum betweenness improvement problem (Q737099) (← links)
- A structural analysis of topic ontologies (Q780974) (← links)
- Measuring centrality by a generalization of degree (Q1642790) (← links)
- Social centrality using network hierarchy and community structure (Q1741429) (← links)
- How to identify experts in a community? (Q1742142) (← links)
- Ranking nodes in general networks: a Markov multi-chain approach (Q1745939) (← links)
- A framework of hierarchical attacks to network controllability (Q2025502) (← links)
- The effect of attacks on the railway network of Hungary (Q2045622) (← links)
- Dynamic Katz and related network measures (Q2085424) (← links)
- Spectral rank monotonicity on undirected networks (Q2086592) (← links)
- On Pareto optimality in social distance games (Q2093365) (← links)
- A Laplacian approach to stubborn agents and their role in opinion formation on influence networks (Q2141459) (← links)
- Optimizing node discovery on networks: problem definitions, fast algorithms, and observations (Q2201666) (← links)
- \(p\)-means centrality (Q2206143) (← links)
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (Q2293164) (← links)
- Formation of stable and efficient social storage cloud (Q2307380) (← links)
- Attachment centrality: measure for connectivity in networks (Q2321314) (← links)
- An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
- Ranking in evolving complex networks (Q2364306) (← links)
- Local and consistent centrality measures in parameterized networks (Q2409715) (← links)
- M-Centrality: identifying key nodes based on global position and local degree variation (Q3303303) (← links)
- Re-conceptualizing centrality in social networks (Q4594627) (← links)
- The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis (Q4604568) (← 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)
- Convex combinations of centrality measures (Q5036311) (← links)
- Central Positions in Social Networks (Q5042225) (← links)
- Quasifibrations of graphs to find symmetries and reconstruct biological networks (Q5055404) (← links)
- Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian (Q5113166) (← links)
- Finding Critical Links for Closeness Centrality (Q5138269) (← links)
- Parametric controllability of the personalized PageRank: Classic model vs biplex approach (Q5220490) (← links)
- Robust Averaging of Covariances for EEG Recordings Classification in Motor Imagery Brain-Computer Interfaces (Q5380716) (← links)
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis (Q5874469) (← links)
- Centrality measures in networks (Q6051894) (← links)
- Resource availability in the social cloud: An economics perspective (Q6052532) (← links)
- Reduced-order model predictive control of a fish schooling model (Q6116269) (← links)
- Does spending more always ensure higher cooperation? An analysis of institutional incentives on heterogeneous networks (Q6124787) (← links)
- Axiomatic characterization of PageRank (Q6161485) (← links)
- Degree centrality and root finding in growing random networks (Q6164921) (← links)
- Tail risk in production networks (Q6536782) (← links)
- Game-theoretic centrality of directed graph vertices (Q6581780) (← links)
- Connectivity of random graphs after centrality-based vertex removal (Q6617606) (← links)
- A comparative analysis of centrality measures in complex networks (Q6646027) (← links)
