skip to main content
10.1145/3341161.3344823acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Increasing the diffusional characteristics of networks through optimal topology changes within sub-graphs

Published: 15 January 2020 Publication History

Abstract

In recent years, bustling online communities have focused a lot of attention on research dealing with information spreading. Through acquired knowledge about the characteristics of information spreading processes, we are able to influence their dynamics via the enhancement of propagation properties or by changing them to decrease their spread within a network. One of approaches is adding or removing connections within a network. While optimal linking within complex networks requires extensive computational resources, in this investigation, we focus on the optimization of the topology of small graphs within larger network structures. The study shows how the enhancement of propagation properties within small networks is preserved in bigger networks based on connected smaller graphs. We compare the results from combined small graphs with added links providing optimal spread and networks with additional random linking. The results show that improvements in linking within small sub-graphs with optimal linking improves the diffusional properties of the whole network.

References

[1]
P. Farhi, "The twitter explosion," American journalism review, vol. 31, no. 3, pp. 26--32, 2009.
[2]
A. Hermida, F. Fletcher, D. Korell, and D. Logan, "Share, like, recommend: Decoding the social media news consumer," Journalism studies, vol. 13, no. 5-6, pp. 815--824, 2012.
[3]
S. Funk, E. Gilad, C. Watkins, and V. A. Jansen, "The spread of awareness and its impact on epidemic outbreaks," Proceedings of the National Academy of Sciences, vol. 106, no. 16, pp. 6872--6877, 2009.
[4]
R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking, "Randomized rumor spreading," in Proceedings 41st Annual Symposium on Foundations of Computer Science. IEEE, 2000, pp. 565--574.
[5]
R. Pastor-Satorras and A. Vespignani, "Epidemic spreading in scale-free networks," Physical review letters, vol. 86, no. 14, p. 3200, 2001.
[6]
C.-N. Ziegler and G. Lausen, "Spreading activation models for trust propagation," in IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE'04. 2004. IEEE, 2004, pp. 83--97.
[7]
M. Karsai, G. Iniguez, K. Kaski, and J. Kertész, "Complex contagion process in spreading of online innovation," Journal of The Royal Society Interface, vol. 11, no. 101, p. 20140694, 2014.
[8]
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, "Network motifs: simple building blocks of complex networks," Science, vol. 298, no. 5594, pp. 824--827, 2002.
[9]
M. Girvan and M. E. Newman, "Community structure in social and biological networks," Proceedings of the national academy of sciences, vol. 99, no. 12, pp. 7821--7826, 2002.
[10]
S. Fortunato, "Community detection in graphs," Physics reports, vol. 486, no. 3-5, pp. 75--174, 2010.
[11]
J. Reichardt and S. Bornholdt, "Statistical mechanics of community detection," Physical Review E, vol. 74, no. 1, p. 016110, 2006.
[12]
J. Jankowski, B. K. Szymanski, P. Kazienko, R. Michalski, and P. Bródka, "Probing limits of information spread with sequential seeding," Scientific reports, vol. 8, no. 1, p. 13996, 2018.
[13]
X.-B. Cao, C. Hong, W.-B. Du, and J. Zhang, "Improving the network robustness against cascading failures by adding links," Chaos, Solitons & Fractals, vol. 57, pp. 35--40, 2013.
[14]
D. Xu, Y. Li, and T.-J. Wu, "Improving consensus and synchronizability of networks of coupled systems via adding links," Physica A: Statistical Mechanics and its Applications, vol. 382, no. 2, pp. 722--730, 2007.
[15]
G. Ma, Q. Liu, E. Chen, and B. Xiang, "Individual influence maximization via link recommendation," in International Conference on Web-Age Information Management. Springer, 2015, pp. 42--56.
[16]
G. D'Angelo, L. Severini, and Y. Velaj, "Recommending links through influence maximization," Theoretical Computer Science, vol. 764, pp. 30--41, 2019.
[17]
R. Hanna, A. Rohm, and V. L. Crittenden, "Were all connected: The power of the social media ecosystem," Business horizons, vol. 54, no. 3, pp. 265--273, 2011.
[18]
S. Bhagat, A. Goyal, and L. V. Lakshmanan, "Maximizing product adoption in social networks," in Proceedings of the fifth ACM international conference on Web search and data mining. ACM, 2012, pp. 603--612.
[19]
J. Zhan and X. Fang, "Trust maximization in social networks," in International Conference on Social Computing, Behavioral-Cultural Modeling, and Prediction. Springer, 2011, pp. 205--211.
[20]
A. Gionis, E. Terzi, and P. Tsaparas, "Opinion maximization in social networks," in Proceedings of the 2013 SIAM International Conference on Data Mining. SIAM, 2013, pp. 387--395.
[21]
O. Hinz, B. Skiera, C. Barrot, and J. U. Becker, "Seeding strategies for viral marketing: An empirical comparison," Journal of Marketing, vol. 75, no. 6, pp. 55--71, 2011.
[22]
C. P. Sankar, S. Asharaf, and K. S. Kumar, "Learning from bees: An approach for influence maximization on viral campaigns," PloS one, vol. 11, no. 12, p. e0168125, 2016.
[23]
D. Kempe, J. Kleinberg, and É. Tardos, "Maximizing the spread of influence through a social network," in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2003, pp. 137--146.
[24]
W. Chen, Y. Wang, and S. Yang, "Efficient influence maximization in social networks," in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2009, pp. 199--208.
[25]
W. Chen, C. Wang, and Y. Wang, "Scalable influence maximization for prevalent viral marketing in large-scale social networks," in Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2010, pp. 1029--1038.
[26]
Y.-C. Chen, W.-Y. Zhu, W.-C. Peng, W.-C. Lee, and S.-Y. Lee, "Cim: Community-based influence maximization in social networks," ACM Transactions on Intelligent Systems and Technology (TIST), vol. 5, no. 2, p. 25, 2014.
[27]
V. Chaoji, S. Ranu, R. Rastogi, and R. Bhatt, "Recommendations to boost content spread in social networks," in Proceedings of the 21st international conference on World Wide Web. ACM, 2012, pp. 529--538.
[28]
F. Alkemade and C. Castaldi, "Strategies for the diffusion of innovations on social networks," Computational Economics, vol. 25, no. 1-2, pp. 3--23, 2005.
[29]
G. Kocsis and F. Kun, "The effect of network topologies on the spreading of technological developments," Journal of Statistical Mechanics: Theory and Experiment, vol. 2008, no. 10, p. P10014, 2008.
[30]
H. Rahmandad and J. Sterman, "Heterogeneity and network structure in the dynamics of diffusion: Comparing agent-based and differential equation models," Management Science, vol. 54, no. 5, pp. 998--1014, 2008.
[31]
J. Goldenberg, S. Han, D. R. Lehmann, and J. W. Hong, "The role of hubs in the adoption process," Journal of marketing, vol. 73, no. 2, pp. 1--13, 2009.
[32]
B. D. McKay and A. Piperno, "Nauty and traces users guide (version 2.5)," Computer Science Department, Australian National University, Canberra, Australia, 2013.
[33]
M. Bampo, M. T. Ewing, D. R. Mather, D. Stewart, and M. Wallace, "The effects of the social structure of digital networks on viral marketing performance," Information systems research, vol. 19, no. 3, pp. 273--290, 2008.
[34]
Q. Tan, Y. Liu, and J. Liu, "Motif-aware diffusion network inference," in Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, 2018, pp. 638--650.
[35]
R. Milo, S. Itzkovitz, N. Kashtan, R. Levitt, S. Shen-Orr, I. Ayzenshtat, M. Sheffer, and U. Alon, "Superfamilies of evolved and designed networks," Science, vol. 303, no. 5663, pp. 1538--1542, 2004.
[36]
A. R. Benson, D. F. Gleich, and J. Leskovec, "Higher-order organization of complex networks," Science, vol. 353, no. 6295, pp. 163--166, 2016.

Cited By

View all
  • (2020)Multi-criteria Approach to Planning of Information Spreading Processes Focused on Their Initialization with the Use of Sequential SeedingInformation Technology for Management: Current Research and Future Directions10.1007/978-3-030-43353-6_7(116-134)Online publication date: 11-Mar-2020
  1. Increasing the diffusional characteristics of networks through optimal topology changes within sub-graphs

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      ASONAM '19: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
      August 2019
      1228 pages
      ISBN:9781450368681
      DOI:10.1145/3341161
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      In-Cooperation

      • IEEE CS

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 15 January 2020

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. graphs
      2. influence maximization
      3. information diffusion
      4. network topology
      5. optimal linking

      Qualifiers

      • Research-article

      Funding Sources

      • National Science Centre, Poland

      Conference

      ASONAM '19
      Sponsor:

      Acceptance Rates

      ASONAM '19 Paper Acceptance Rate 41 of 286 submissions, 14%;
      Overall Acceptance Rate 116 of 549 submissions, 21%

      Upcoming Conference

      KDD '25

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)3
      • Downloads (Last 6 weeks)2
      Reflects downloads up to 17 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2020)Multi-criteria Approach to Planning of Information Spreading Processes Focused on Their Initialization with the Use of Sequential SeedingInformation Technology for Management: Current Research and Future Directions10.1007/978-3-030-43353-6_7(116-134)Online publication date: 11-Mar-2020

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media