A measure of centrality based on a reciprocally perturbed Markov chain for asymmetric relations

DOI10.1080/0022250X.2021.1885402MaRDI QIDQ5093077zbMATH OpenOpenAlexFDO

Authors Neng-Pin Lu

Publication date 26 July 2022

Published in The Journal of Mathematical Sociology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0022250x.2021.1885402

zbMATH Keywords

centralityMarkov chainperturbation

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Social networks; opinion dynamics (91D30)

Recommendations

• A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
• Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
• Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
• On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
• Axioms for Centrality

Cites work

• A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
• A max version of the Perron-Frobenius theorem
• A new status index derived from sociometric analysis
• Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
• Google's PageRank and beyond. The science of search engine rankings
• Markov chains. Theory and applications
• PageRank beyond the web
• The life and work of A. A. Markov
• The Problem of Social Control and Coordination of Complex Systems in Sociology: A Look at the Community Cleavage Problem
• Understanding Markov chains. Examples and applications
• Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
• Who's \#1? The science of rating and ranking

This page was built for publication: A measure of centrality based on a reciprocally perturbed Markov chain for asymmetric relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5093077)