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

DOI10.1080/0022250X.2021.1885402zbMath1492.91249OpenAlexW3134254287MaRDI QIDQ5093077

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

perturbationMarkov chaincentrality

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A max version of the Perron-Frobenius theorem
• The life and work of A. A. Markov
• A new status index derived from sociometric analysis
• PageRank Beyond the Web
• The Problem of Social Control and Coordination of Complex Systems in Sociology: A Look at the Community Cleavage Problem
• Understanding Markov Chains
• 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
• A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
• Markov Chains

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