A graph-theoretical basis of stochastic-cascading network influence: Characterizations of influence-based centrality.
Theoretical Computer Science(2020)
摘要
Ker-I Ko (葛可一, 1950-2018) made multiple pioneering and milestone contributions to structural complexity theory and real-number computation. His sharp perception of both discrete and continuous structures had led him to study fundamental concepts from one-way functions [29], to polynomial-time hierarchy [21], from integral equations [24], to real functions [28], from fractals [27] to fixed-points [25], from optimization [20] to relativization [22], from instance complexity [36] to real complexity [28], from NP-completeness [31] to exponential-time completeness [23]. In his final two years, he turned his focus to game-theoretical designs for dynamic processes over social networks [12], [33].
更多查看译文
关键词
Network centrality,Influence-based centrality,Axiomatic characterization,Graph-theoretical basis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络