|
[1] C. Allen, http://www.lifewithalacrity.com/2004/03/the_dunbar_numb.html. [2] A. Barrat, M. Barthélemy, R. PastorSatorras, and A. Vespignani, “The Architecture of Complex Weighted Networks”, The National Academy of Sciences, Vol 101, No. 11, pp. 37473752, 2014. [3] F. Battiston, V. Nicosia, and V. Latora, “Structural Measures for Multiplex Networks”, Physics and Society, Vol. 89, No. 3, 2014. [4] M. Berlingerio, M. Coscia, and F. Giannotti, “Finding Redundant and Complementary Communities in Multidimensional Networks”, The 20th ACM international conference on Information and knowledge management, pp. 21812184, 2011. [5] B. Brubach, S. Ehsani, and K. A. Sankararaman, “Algorithms in the PublicPrivate Model to SubAdditive functions”, Course Project Report, 2015. [6] 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. 3540, 2013. [7] F. Chierichetti, A. Epasto, R. Kumar, S. Lattanzi, and V. Mirrokni, “Efficient Algorithms for PublicPrivate Social Networks”, The 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 139148, Sydney, 2015. [8] E. Cohen, “SizeEstimation Framework with Applications to Transitive Closure and Reachability”, Journal of Computer and System Sciences, Vol 55, pp. 441453, 1997. [9] E. Cohen, and H. Kaplan, “Summarizing Data using Bottomk Sketches”, The 26th 56 annual ACM symposium on Principles of Distributed Computing, pp. 225234, 2007. [10] E. Cohen, “AllDistances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis”, The 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 23202334, USA, 2014. [11] R. Dunbar, “How Many Friends Does One Person Need? Dunbar’s Number and other Evolutionary Quirks”, 2010. [12] Facebook, Inc. https://investor.fb.com/investornews/ pressreleasedetails/ 2017/FacebookReportsFirstQuarter2017Results/ default.aspx, 2017 [13] B. Goncalves, N. Perra, and A. Vespignani, “Modeling Users’ Activity on Twitter Networks: Validation of Dunbar’s Number”, PLOS ONE, Vol. 6, No. 8, 2011. [14] R. Heartherly, M. Kanatrcioglu, and B. Thuraisingham, “Social Network Classification Incorporating Link Type Values”, IEEE International Conference on Intelligence and Security Informatics, pp. 1924, 2009. [15] E. Hoz, J. M. GimenezGuzman, G. LopezCivera, I. MarsaMaestre, and D. Orden, “TOWER: Topology Optimization for Network Enhanced Resilience”, The 7th International Conference on Data Communication Networking, 2016. [16] R. J. Hu, Q. Li, G. Y. Zhang, and W. C. Ma, “Centrality Measures in Directed Fuzzy Social Networks”, Fuzzy Information and Engineering, Vol. 7, No. 1, pp. 115128, 2015. [17] X. Ji, B. Wang, D. Liu, G. Chen, F. Tang, D. Wei, and L. Tu, “Improving Interdependent Networks Robustness by Adding Connectivity Links”, Physica A: Statistical Mechanics and its Applications, Vol. 444, pp. 916, 2016. [18] A. M. Kaplan, and M. Haenlein, “Two Hearts in Threequarter Time: How to Waltz the Social Media/Viral Marketing Dance”, Business Horizons, Vol. 54, No. 57 3, pp. 253263, 2011. [19] M. Kimura, K. Saito, K. Ohara, and H. Motoda, “Speedingup Node Influence Computation for Huge Social Networks”, International Journal of Data Science and Analytics, Vol. 1, No. 1, pp. 316, 2016. [20] M. Kivelä, A. Arenas, and M. Barthelemy, J. P. Gleeson, Y. Moreno, and M. A. Porter, “Multilayer Networks”, Physics and Society, Vol. 2, No. 3, pp. 203271, 2014. [21] X. Lin, G. Xu, E. Chen, and L. Li, “Learning User Preferences across Multiple Aspects for Merchant Recommendation”, IEEE International Conference on Data Mining, pp. 865870, 2015. [22] W. Luo, W. P. Tay, and M. Leng, “Rumor Spreading Maximization and Source Identification in a Social Network”, IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 186193, 2015. [23] W. Luo, W. P. Tay, and M. Leng, “On the Universality of Jordan Centers for Estimating Infection Sources in Tree Networks”, IEEE Transactions on Information Theory, Vol. 63, No. 7, pp. 46344657, 2017. [24] B. Min, and K. I. Goh, “Layercrossing Overhead and Information Spreading in Multiplex Social Networks”, Physics and Society, 2013. [25] B. Mirzasoleiman, M. Zadimoghaddam, and A. Karbasi, “Fast Distributed Submodular Cover: Publicprivate Data Summarization”, Conference and Workshop on Neural Information Processing Systems, pp. 3594–3602, 2016. [26] K. Ohara, K. Saito, M. Kimura, and H. Motoda, “Accelerating Computation of Distance Based Centrality Measures for Spatial Networks”, International Conference on Discovery Science, pp. 376391, 2016. [27] T. Opsahi, F. Agneessens, and J. Skvoretz, “Node Centrality in Weighted 58 Networks: Generalizing Degree and Shortest Paths”, Social Networks, Vol. 32, pp. 245251, 2010. [28] B. A. Prakash, D. Chakrabarti, M. Faloutsos, N. Valler, and C. Faloutsos, “Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks”, IEEE 11th International Conference on Data Mining, pp. 537546, 2011. [29] X. Ruan, Z. Wu, H. Wang, and S. Jajodia, “Profiling Online Social Behaviors for Compromised Account Detection”, IEEE Transaction on Information Forensics and Security, Vol. 11, No. 1, pp. 176187, 2016. [30] K. Saito, M. Kimura, K. Ohara, and H. Motoda, “Detecting Critical Links in Complex Network to Maintain Information Flow/Reachability”, 14th Pacific Rim International Conference on Artificial Intelligence, pp. 419432, 2016. [31] J. W. Wang, and L. L. Rong, “A Model for Cascading Failures in Scalefree Networks with a Breakdown Probability”, Physica A: Statistical Mechanics and its Applications, Vol. 388, No. 7, pp. 12891298, 2009. [32] J. Wang, “Mitigation Strategies on Scalefree Networks against Cascading Failures”, Physica A: Statistical Mechanics and its Applications, Vol. 392, No. 9, pp. 22572264, 2013. [33] Z. K. Zhang, C. Liu, X. X. Zhan, X. Lu, and C. X. Zhang, “Dynamics of Information Diffusion and Its Applications on Complex Networks”, Physics Reports, Vol. 651, pp. 134, July 2016.
|