Scholarlink

<p>Centrality measures play an important role in network graph theory. They are widely used in social network analysis as tools to provide a measure of the importance of certain nodes. In this paper, we look at a specific measure, namely, the walk statistic and provide theoretical results on their values on rooted random trees, rooted random wheels and rooted fans.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Analysis of the Bound of Katz-Bonacic Centrality for Rooted Random Graphs

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年12月26日

查看全文
  • Nayeong Kong,
  • Seonguk Kim,
  • Suman Balasubramanian

摘要

Centrality measures play an important role in network graph theory. They are widely used in social network analysis as tools to provide a measure of the importance of certain nodes. In this paper, we look at a specific measure, namely, the walk statistic and provide theoretical results on their values on rooted random trees, rooted random wheels and rooted fans.