A graph-theoretical basis of stochastic-cascading network influence: Characterizations of influence-based centrality
Authors:
- Wei ChenWCWei Chen
- Shang-Hua TengSTShang-Hua Teng
- Hanrui ZhangHZHanrui Zhang
- 1 July 2020
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 824-825, 92-111
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation
- Simons Foundation
This publication has 17 references indexed in Scilit:
- On the Parameterized Complexity of Pooling DesignJournal of Computational Biology, 2009
- Identifying sets of key players in a social networkComputational and Mathematical Organization Theory, 2006
- On the complexity of finding paths in a two-dimensional domain I: Shortest pathsMathematical Logic Quarterly, 2004
- On the computability of fractal dimensions and Hausdorff measureAnnals of Pure and Applied Logic, 1998
- A polynomial-time computable curve whose interior has a nonrecursive measureTheoretical Computer Science, 1995
- Computational Complexity of Fixed Points and Intersection PointsJournal of Complexity, 1995
- Instance complexityJournal of the ACM, 1994
- On the computational complexity of integral equationsAnnals of Pure and Applied Logic, 1992
- Separating and collapsing results on the relativized probabilistic polynomial-time hierarchyJournal of the ACM, 1990
- Computational complexity of real functionsTheoretical Computer Science, 1982