A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality

DOI10.1016/j.tcs.2020.04.016zbMath1437.91342OpenAlexW3022007565MaRDI QIDQ2182332

Shang-Hua Teng, Wei Chen, Hanrui Zhang

Publication date: 23 May 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.04.016

zbMATH Keywords

axiomatic characterizationnetwork centralitygraph-theoretical basisinfluence-based centrality

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Applications of graph theory (05C90)

Related Items (3)

A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality ⋮ Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Identifying sets of key players in a social network
• A polynomial-time computable curve whose interior has a nonrecursive measure
• Continuous optimization problems and a polynomial hierarchy of real functions
• On one-way functions and polynomial-time isomorphisms
• Computational complexity of real functions
• On the computational complexity of integral equations
• On the computability of fractal dimensions and Hausdorff measure
• Computational complexity of fixed points and intersection points
• Scalable influence maximization for independent cascade model in large-scale social networks
• A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality
• Competitive profit maximization in social networks
• Centralized and decentralized rumor blocking problems
• The centrality index of a graph
• On the complexity of finding paths in a two-dimensional domain I: Shortest paths
• Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
• On Circuit-Size Complexity and the Low Hierarchy in NP
• Instance complexity
• Relativized Polynomial Time Hierarchies Having Exactly K Levels
• Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality
• Maximizing Social Influence in Nearly Optimal Time
• The Measurement of Intellectual Influence
• Automata, Languages and Programming
• Networks

This page was built for publication: A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality