Maximizing Engagement in Large-Scale Social Networks

References

• Adger WN (2000) Social and ecological resilience: Are they related? Progress Human Geography 24(3):347–364.Google Scholar
• Al-garadi MA, Varathan KD, Ravana SD (2017) Identification of influential spreaders in online social networks using interaction weighted k-core decomposition method. Phys. A 468:278–288.Google Scholar
• Altaf-Ul-Amine M, Nishikata K, Korna T, Miyasato T, Shinbo Y, Arifuzzaman M, Wada C, et al. (2003) Prediction of protein functions based on k-cores of protein-protein interaction networks and amino acid sequences. Genome Informatics 14:498–499.Google Scholar
• Bader GD, Hogue CW (2002) Analyzing yeast protein–protein interaction data obtained from different sources. Nature Biotech. 20(10):991–997.Google Scholar
• Balasundaram B, Butenko S, Hicks IV (2011) Clique relaxations in social network analysis: The maximum k-plex problem. Oper. Res. 59(1):133–142.Link, Google Scholar
• Batagelj V, Zaversnik M (2003) An O(m) algorithm for cores decomposition of networks. CoRR cs.DS/0310049.Google Scholar
• Bhawalkar K, Kleinberg J, Lewi K, Roughgarden T, Sharma A (2015) Preventing unraveling in social networks: The anchored k-core problem. SIAM J. Discrete Math. 29(3):1452–1475.Google Scholar
• Bonchi F, Gullo F, Kaltenbrunner A, Volkovich Y (2014) Core decomposition of uncertain graphs. Proc. 20th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 1316–1325.Google Scholar
• Burleson-Lesser K, Morone F, Tomassone MS, Makse HA (2020) k-core robustness in ecological and financial networks. Sci. Rep. 10(1):1–14.Google Scholar
• Christof T, Loebel A (2022) Polyhedron representation transformation algorithm. Accessed July 17, 2022, http://porta.zib.de.Google Scholar
• Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming, vol. 271 (Springer, Berlin).Google Scholar
• Daemi N, Borrero JS, Balasundaram B (2022) Interdicting low-diameter cohesive subgroups in large-scale social networks. INFORMS J. Optim. 4(3):304–325.Link, Google Scholar
• Daianu M, Jahanshad N, Nir TM, Toga AW, Jack CR, Weiner MW, Thompson PM, for the Alzheimer’s Disease Neuroimaging Initiative (2013) Breakdown of brain connectivity between normal aging and Alzheimer’s disease: A structural k-core network analysis. Brain Connectivity 3(4):407–422.Google Scholar
• Dey P, Maity SK, Medya S, Silva A (2020) Network robustness via global k-cores. Preprint, submitted December 18, https://arxiv.org/abs/2012.10036.Google Scholar
• Gao J, Xu Z, Li R, Yin M (2022) An exact algorithm with new upper bounds for the maximum k-defective clique problem in massive sparse graphs. Proc. AAAI Conf. Artificial Intelligence 36(9):10174–10183.Google Scholar
• Garas A, Schweitzer F, Havlin S (2012) A k-shell decomposition method for weighted networks. New J. Phys. 14(8):083030.Google Scholar
• Garcia D, Mavrodiev P, Schweitzer F (2013) Social resilience in online communities: The autopsy of friendster. Proc. 1st ACM Conf. Online Social Networks (Association for Computing Machinery, New York), 39–50.Google Scholar
• Giatsidis C, Thilikos DM, Vazirgiannis M (2011a) Evaluating cooperation in communities with the k-core structure. Proc. Internat. Conf. Adv. Social Networks Analysis Mining (IEEE, Piscataway, NJ), 87–93.Google Scholar
• Giatsidis C, Thilikos DM, Vazirgiannis M, Giatsidis C, Vazirgiannis M, Thilikos DM (2011b) D-cores: Measuring collaboration of directed graphs based on degeneracy. Proc. IEEE Internat. Conf. Data Mining (IEEE, Piscataway, NJ).Google Scholar
• Hagmann P, Cammoun L, Gigandet X, Meuli R, Honey CJ, Wedeen VJ, Sporns O (2008) Mapping the structural core of human cerebral cortex. PLoS Biology 6(7):e159.Google Scholar
• Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks 40(2):97–111.Google Scholar
• Laishram R, Erdem Sar A, Eliassi-Rad T, Pinar A, Soundarajan S (2020) Residual core maximization: An efficient algorithm for maximizing the size of the k-core. Proc. SIAM Internat. Conf. Data Mining (SIAM, Philadelphia), 325–333.Google Scholar
• Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network data set collection. Accessed July 17, 2022, http://snap.stanford.edu/data.Google Scholar
• Ma J, Balasundaram B (2019) On the chance-constrained minimum spanning k-core problem. J. Global Optim. 74(4):783–801.Google Scholar
• Ma J, Mahdavi Pajouh F, Balasundaram B, Boginski V (2016) The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures. INFORMS J. Comput. 28:295–307.Link, Google Scholar
• Malliaros FD, Vazirgiannis M (2013) To stay or not to stay: Modeling engagement dynamics in social graphs. Proc. 22nd ACM Internat. Conf. Inform. Knowledge Management (ACM, New York), 469–478.Google Scholar
• Matula D, Beck L (1983) Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3):417–427.Google Scholar
• Miao Z, Balasundaram B (2020) An ellipsoidal bounding scheme for the quasi-clique number of a graph. INFORMS J. Comput. 32(3):763–778.Link, Google Scholar
• Mikesell D, Hicks IV (2022) Minimum k-cores and the k-core polytope. Networks 80(1):93–108.Google Scholar
• Nemhauser GL, Trotter LE (1974) Properties of vertex packing and independence system polyhedra. Math. Programming 6(1):48–61.Google Scholar
• Pajouh FM, Balasundaram B, Hicks IV (2016) On the 2-club polytope of graphs. Oper. Res. 64(6):1466–1481.Link, Google Scholar
• Pattillo J, Youssef N, Butenko S (2013) On clique relaxation models in network analysis. Eur. J. Oper. Res. 226(1):9–18.Google Scholar
• Pei S, Muchnik L, Andrade J Jr, Zheng Z, Makse HA (2014) Searching for superspreaders of information in real-world social media. Sci. Rep. 4(1):5547.Google Scholar
• Peng Y, Zhang Y, Zhang W, Lin X, Qin L (2018) Efficient probabilistic k-core computation on uncertain graphs. Proc. IEEE 34th Internat. Conf. Data Engrg. (IEEE, Piscataway, NJ), 1192–1203.Google Scholar
• Qin L, Wang Y, Sun Q, Zhang X, Shia BC, Liu C (2020) Analysis of the COVID-19 epidemic transmission network in mainland China: k-core decomposition study. JMIR Public Health Surveillance 6(4):e24291.Google Scholar
• Rivlin G (2006) Wallflower at the web party. New York Times (October 15), https://www.nytimes.com/2006/10/15/business/yourmoney/wallflower-at-the-web-party.html.Google Scholar
• Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. Proc. AAAI Conf. Artificial Intelligence 29(1).Google Scholar
• Salemi H, Buchanan A (2020) Parsimonious formulations for low-diameter clusters. Math. Programming Comput. 12(3):493–528.Google Scholar
• Seidman SB (1983) Network structure and minimum degree. Soc. Networks 5(3):269–287.Google Scholar
• Seki K, Nakamura M (2016) The collapse of the friendster network started from the center of the core. Proc. IEEE/ACM Internat. Conf. Adv. Social Networks Analysis Mining (IEEE Piscataway, NJ), 477–484.Google Scholar
• Shanahan M, Bingman VP, Shimizu T, Wild M, Güntürkün O (2013) Large-scale network organization in the avian forebrain: A connectivity matrix and theoretical analysis. Frontiers Comput. Neurosci. 7:89.Google Scholar
• Tootoonchi B, Srinivasan V, Thomo A (2017) Efficient implementation of anchored 2-core algorithm. Proc. 2017 IEEE/ACM Internat. Conf. Adv. Social Networks Analysis Mining (Association for Computing Machinery, New York), 1009–1016.Google Scholar
• Verma A, Buchanan A, Butenko S (2015) Solving the maximum clique and vertex coloring problems on very large sparse networks. INFORMS J. Comput. 27(1):164–177.Link, Google Scholar
• Wood CI, Hicks IV (2015) The minimal k-core problem for modeling k-assemblies. J. Math. Neurosci. 5(1):1–19.Google Scholar
• Wu S, Das Sarma A, Fabrikant A, Lattanzi S, Tomkins A (2013) Arrival and departure dynamics in social networks. Proc. 6th ACM Internat. Conf. Web Search Data Mining (Association for Computing Machinery, New York), 233–242.Google Scholar
• Wu H, Cheng J, Lu Y, Ke Y, Huang Y, Yan D, Wu H (2015) Core decomposition in large temporal graphs. Proc. IEEE Internat. Conf. Big Data (IEEE, Piscataway, NJ), 649–658.Google Scholar
• Zhang F, Zhang W, Zhang Y, Qin L, Lin X (2017) OLAK: An efficient algorithm to prevent unraveling in social networks. Proc. VLDB Endowment 10(6):649–660.Google Scholar
• Zhou Z, Zhang F, Lin X, Zhang W, Chen C (2019) k-core maximization: An edge addition approach. Proc. Twenty-Eighth Internat. Joint Conf. Artificial Intelligence (IJCAI-19) (International Joint Conferences on Artificial Intelligence Organization), 4867–4873.Google Scholar