Binary Search Approach for Largest Cascade Capacity of Complex Networks

Author:

Meghanathan Natarajan1

Affiliation:

1. Jackson State University, USA

Abstract

The cascade capacity of a network is the largest threshold fraction of neighbors that should have made a unanimous decision to result in a complete information cascade. The current approach (based on the intra cluster densities of the bridge nodes of the clusters) used to determine the cascade capacity of a network is independent of the choice of the initial adopters. The authors claim that the above approach gives only a lower bound for the cascade capacity of a network and show that the cascade capacity of a network could be indeed larger if the number and topological positions of the nodes chosen as initial adopters are taken into consideration. In this context, they propose a binary search algorithm that could be used to determine the largest possible cascade capacity of a network for a given set of initial adopters. They run the algorithm on 60 real-world networks of diverse domains and observe the cascade capacity of the networks to increase with the percentage of nodes chosen as initial adopters as well as vary with the choice of the centrality metric used to choose the initial adopters.

Publisher

IGI Global

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3