Axioms for Centrality
From MaRDI portal
Publication:4985356
DOI10.1080/15427951.2013.865686zbMath1461.91219arXiv1308.2140OpenAlexW2134784378WikidataQ57309473 ScholiaQ57309473MaRDI QIDQ4985356
Publication date: 23 April 2021
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.2140
Related Items
Convex combinations of centrality measures ⋮ Ranking in evolving complex networks ⋮ Central Positions in Social Networks ⋮ A Laplacian approach to stubborn agents and their role in opinion formation on influence networks ⋮ Quasifibrations of graphs to find symmetries and reconstruct biological networks ⋮ Measuring centrality by a generalization of degree ⋮ Local and consistent centrality measures in parameterized networks ⋮ Centrality measures in networks ⋮ Resource availability in the social cloud: An economics perspective ⋮ Re-conceptualizing centrality in social networks ⋮ Reduced-order model predictive control of a fish schooling model ⋮ Does spending more always ensure higher cooperation? An analysis of institutional incentives on heterogeneous networks ⋮ Axiomatic characterization of PageRank ⋮ Degree centrality and root finding in growing random networks ⋮ Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian ⋮ Optimizing node discovery on networks: problem definitions, fast algorithms, and observations ⋮ The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis ⋮ \(p\)-means centrality ⋮ Robust Averaging of Covariances for EEG Recordings Classification in Motor Imagery Brain-Computer Interfaces ⋮ Unnamed Item ⋮ Finding Critical Links for Closeness Centrality ⋮ Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis ⋮ M-Centrality: identifying key nodes based on global position and local degree variation ⋮ Social centrality using network hierarchy and community structure ⋮ How to identify experts in a community? ⋮ Ranking nodes in general networks: a Markov multi-chain approach ⋮ Equilibria and centrality in link formation games ⋮ A framework of hierarchical attacks to network controllability ⋮ On the maximum betweenness improvement problem ⋮ I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs ⋮ The effect of attacks on the railway network of Hungary ⋮ Parametric controllability of the personalized PageRank: Classic model vs biplex approach ⋮ Formation of stable and efficient social storage cloud ⋮ Attachment centrality: measure for connectivity in networks ⋮ A structural analysis of topic ontologies ⋮ Dynamic Katz and related network measures ⋮ Spectral rank monotonicity on undirected networks ⋮ A Theory for Backtrack-Downweighted Walks ⋮ On Pareto optimality in social distance games ⋮ An integer programming approach for finding the most and the least central cliques ⋮ Mittag--Leffler Functions and their Applications in Network Science ⋮ Three Hypergraph Eigenvector Centralities
Cites Work
- A Mathematical Theory of Communication
- Spatially-decaying aggregation over a network
- Harmony in the small-world
- Inverse \(M\)-matrix inequalities and generalized ultrametric matrices
- The centrality index of a graph
- Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices
- A new status index derived from sociometric analysis
- Two Notes on Notation
- Authoritative sources in a hyperlinked environment
- Link Evolution: Analysis and Algorithms
- Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
- Fast PageRank Computation via a Sparse Linear System
- Paradoxical Effects in PageRank Incremental Computations
- The Effect of New Links on Google Pagerank
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
