Influencer Identification on Link Predicted Graphs (2402.03522v2)
Abstract: How would admissions look like in a it university program for influencers? In the realm of social network analysis, influence maximization and link prediction stand out as pivotal challenges. Influence maximization focuses on identifying a set of key nodes to maximize information dissemination, while link prediction aims to foresee potential connections within the network. These strategies, primarily deep learning link prediction methods and greedy algorithms, have been previously used in tandem to identify future influencers. However, given the complexity of these tasks, especially in large-scale networks, we propose an algorithm, The Social Sphere Model, which uniquely utilizes expected value in its future graph prediction and combines specifically path-based link prediction metrics and heuristic influence maximization strategies to effectively identify future vital nodes in weighted networks. Our approach is tested on two distinct contagion models, offering a promising solution with lower computational demands. This advancement not only enhances our understanding of network dynamics but also opens new avenues for efficient network management and influence strategy development.
- Degree centrality. https://docs.tigergraph.com/graph-ml/current/centrality-algorithms/degree-centrality.
- Pagerank. https://docs.tigergraph.com/graph-ml/current/centrality-algorithms/pagerank#:~:text=This%20algorithm%20has%20a%20time,the%20time%20needed%20for%20computation.
- Detection of influencers in social networks: A survey. Journal of Kufa for Mathematics and Computer, 10(1):18–26, 2023.
- Path-based extensions of local link prediction methods for complex networks. Scientific Reports, 10, 11 2020.
- Link prediction based on a semi-local similarity index. Chinese Physics B, 20(12):128902, dec 2011.
- V. Batagelj and M. Zaversnik. An o(m) algorithm for cores decomposition of networks, 2003.
- Alex Bavelas. Communication Patterns in Task-Oriented Groups. Acoustical Society of America Journal, 22(6):725, January 1950.
- Link prediction in criminal networks: A tool for criminal intelligence analysis. PloS one, 11:e0154244, 04 2016.
- Ulrik Brandes. A faster algorithm for betweenness centrality. The Journal of Mathematical Sociology, 25, 03 2004.
- The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 30(1):107–117, 1998. Proceedings of the Seventh International World Wide Web Conference.
- Complex social contagion makes networks more vulnerable to disease outbreaks, 2012.
- Damon Centola. Change. Little, Brown and Company, 2021.
- Complex contagions and the weakness of long ties. American Journal of Sociology, 113(3):702–734, 2007.
- Identifying influential nodes in large-scale directed networks: The role of clustering. PloS one, 8:e77455, 10 2013.
- Identifying influential nodes in complex networks. Physica A: Statistical Mechanics and its Applications, 391(4):1777–1787, 2012.
- Mining the network value of customers. In Knowledge Discovery and Data Mining, 2001.
- Hunting for vital nodes in complex networks using local information. Scientific Reports, 11, 04 2021.
- s𝑠sitalic_s-core network decomposition: A generalization of k𝑘kitalic_k-core analysis to weighted networks. Phys. Rev. E, 88:062819, Dec 2013.
- On the evolution of random graphs. Transactions of the American Mathematical Society, 286:257–257, 1984.
- Fibonacci heaps and their uses in improved network optimization algorithms. In JACM, 1984.
- Linton Freeman. A set of measures of centrality based on betweenness. Sociometry, 40:35–41, 03 1977.
- Linton C. Freeman. Centrality in social networks conceptual clarification. Social Networks, 1:215–239, 1978.
- Learning influence probabilities in social networks. volume 241-250, pages 241–250, 02 2010.
- Topological measures for identifying and predicting the spread of complex contagions. Nature Communications, 12, 07 2021.
- A Survey of Link Prediction in Social Networks, pages 243–275. 03 2011.
- J. E. Hirsch. An index to quantify an individual’s scientific research output. Proceedings of the National Academy of Sciences, 102(46):16569–16572, November 2005.
- Local structure can identify and quantify influential global spreaders in large scale social networks. Proceedings of the National Academy of Sciences, 115(29):7468–7472, jul 2018.
- Influence maximization for fixed heterogeneous thresholds. Scientific Reports, 9(1), apr 2019.
- Maximizing the spread of influence through a social network. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’03, page 137–146, New York, NY, USA, 2003. Association for Computing Machinery.
- Identification of influential spreaders in complex networks. Nature Physics, 6, 01 2010.
- Identifying influential nodes in social networks: Neighborhood coreness based voting approach. Physma A: Statistical Mechanics and its Applications, 553:124215, 01 2020.
- E. Landau. Über Preisverteilung bei Spielturnieren. Teubner, 1914.
- Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data, 1(1):2–es, mar 2007.
- SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, 2014.
- An improved voterank algorithm to identifying a set of influential spreaders in complex networks. Frontiers in Physics, 10, 08 2022.
- The link prediction problem for social networks. In Proceedings of the Twelfth International Conference on Information and Knowledge Management, CIKM ’03, page 556–559, New York, NY, USA, 2003. Association for Computing Machinery.
- A fast and efficient algorithm for mining top-k nodes in complex networks. Scientific Reports, 7:43330, 02 2017.
- Evaluating the importance of nodes in complex networks. Physica A: Statistical Mechanics and its Applications, 452:209–219, 2016.
- Leveraging local h-index to identify and rank influential spreaders in networks. Physica A: Statistical Mechanics and its Applications, 512:379–391, dec 2018.
- Role of weak ties in link prediction of complex networks, 2009.
- Vital nodes identification in complex networks. Physics Reports, 650:1–63, sep 2016.
- Leaders in social networks, the delicious case. PloS one, 6:e21202, 12 2011.
- Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applications, 390(6):1150–1170, mar 2011.
- The h-index of a network node and its relation to degree and coreness. Nature Communications, 7:10168, 01 2016.
- Competing contagion processes: Complex contagion triggered by simple contagion. Scientific Reports, 8, 07 2018.
- Link prediction of social networks based on weighted proximity measures. volume 85-88, pages 85–88, 12 2007.
- M. Newman. Newman, m.e.j.: Clustering and preferential attachment in growing networks. phys. rev. e 64, 025102. Physical review. E, Statistical, nonlinear, and soft matter physics, 64:025102, 09 2001.
- Universality, criticality and complexity of information propagation in social media. Nature Communications, 13(1), mar 2022.
- Influencer identification in dynamical complex systems. Journal of Complex Networks, 8(2):cnz029, 08 2019.
- Approximating clustering coefficient and transitivity. J. Graph Algorithms Appl., 9:265–275, 2005.
- Stephen Seidman. Network structure and minimum degree.soc netw 5:269-287. Social Networks, 5:269–287, 09 1983.
- Simple exponential acceleration of the power iteration algorithm, 2021.
- The Independent Cascade and Linear Threshold Models, pages 35–48. 01 2015.
- Similarity-based future common neighbors model for link prediction in complex networks. Scientific Reports, 8, 11 2018.
- A voting approach to uncover multiple influential spreaders on weighted networks. Physica A: Statistical Mechanics and its Applications, 519, 12 2018.
- Identifying multiple influential spreaders in complex networks by considering the dispersion of nodes. Frontiers in Physics, 9, 01 2022.
- A survey on centrality metrics and their network resilience analysis. IEEE Access, 9:104773–104819, 2021.
- Complex network metrics: Can deep learning keep up with tailor-made reference algorithms? IEEE Access, 8:68114–68123, 2020.
- Influentials, networks, and public opinion formation. Journal of Consumer Research, 34(4):441–458, 2007.
- Collective dynamics of ‘small-world’ networks. Nature, 393:440–442, 1998.
- Virality prediction and community structure in social networks. Scientific Reports, 3(1), aug 2013.
- Dynamic interaction graphs with probabilistic edge decay. volume 2015, 05 2015.
- Weighted pagerank algorithm. Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004., pages 305–314, 2004.
- Identifying a set of influential spreaders in complex networks, 2016.
- H-degree as a basic measure in weighted networks. J. Informetrics, 5:668–677, 10 2011.
- Identifying effective multiple spreaders by coloring complex networks. EPL (Europhysics Letters), 108, 10 2014.
- Predicting missing links via local information. The European Physical Journal B, 71(4):623–630, oct 2009.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.