On Merging and Dividing Social Graphs

[1] P. ErdÃűs and A. RÃl’nyi, “On random graphs, i,” Publicationes Mathematicae (Debrecen), vol. 6, pp. 290-297, 1959.Search in Google Scholar

[2] D. J. Watts and S. H. Strogatz, “Collective dynamics of â˘AŸsmall-worldâ˘A ´Z networks,” Nature, vol. 393, no. 6684, pp. 440-442, Jun. 1998.Search in Google Scholar

[3] A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” science, vol. 286, no. 5439, pp. 509-512, 1999.Search in Google Scholar

[4] R. Albert, H. Jeong, and A.-L. Barabasi, “The diameter of the world wide web,” Nature, vol. 401, no. 6749, pp. 130-131, Sep. 1999, arXiv:condmat/ 9907038.Search in Google Scholar

[5] R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, “Extracting large-scale knowledge bases from the web,” in Proceedings of the 25th VLDB Conference, 1999, p. 639â˘A ¸S650.Search in Google Scholar

[6] A.-L. Barabasi, R. Albert, and H. Jeong, “Meanfield theory for scale-free random networks,” Physica A: Statistical Mechanics and its Applications, vol. 272, no. 1-2, pp. 173-187, Oct. 1999, arXiv:cond-mat/9907068.10.1016/S0378-4371(99)00291-5Search in Google Scholar

[7] W. Zachary, “An information flow model for conflict and fission in small groups,” Journal of Anthropological Research, vol. 33, pp. 452-473, 1977.10.1086/jar.33.4.3629752Search in Google Scholar

[8] P. Held, A. Dockhorn, and R. Kruse, “On merging and dividing of barabasi-albert-graphs,” in Evolving and Autonomous Learning Systems (EALS), 2014 IEEE Symposium on. IEEE, Dec. 2014, pp. 17-24.10.1109/EALS.2014.7009499Search in Google Scholar

[9] P. Holme and B. J. Kim, “Growing scale-free networks with tunable clustering,” Physical review E, vol. 65, no. 2, p. 026107, 2002.Search in Google Scholar

[10] G. Bianconi and A.-l. BarabÃa˛si, “Competition and multiscaling in evolving networks,” Europhysics Letters, vol. 54, p. 436â˘A ¸S442, May 2001.10.1209/epl/i2001-00260-6Search in Google Scholar

[11] E. N. Gilbert, “Random graphs,” The Annals of Mathematical Statistics, pp. 1141-1144, 1959.Search in Google Scholar

[12] R. Kruse, C. Borgelt, F. Klawonn, C. Moewes, M. Steinbrecher, and P. Held, Computational Intelligence: A Methodological Introduction, ser. Texts in Computer Science. New York: Springer, 2013.Search in Google Scholar

[13] D. Zwillinger and S. Kokoska, CRC standard probability and statistics tables and formulae. CRC Press, 1999.10.1201/9780367802417Search in Google Scholar

[14] M. G. Kendall, “A new measure of rank correlation,” Biometrika, vol. 30, no. 1-2, pp. 81-93, 1938.10.1093/biomet/30.1-2.81Search in Google Scholar

[15] P. Held, A. Dockhorn, and R. Kruse, “Generating events for dynamic social network simulations,” in Proceedings of 15th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, ser. Communications in Computer and Information Science, A. Laurent, O. Strauss, B. Bouchon-Meunier, and R. R. Yager, Eds. Switzerland: Springer International Publishing, 2014, pp. 46-55.10.1007/978-3-319-08855-6_6Search in Google Scholar

[16] P. Held, C. Moewes, C. Braune, R. Kruse, and B. A. Sabel, “Advanced analysis of dynamic graphs in social and neural networks,” in Towards Advanced Data Analysis by Combining Soft Computing and Statistics, ser. Studies in Fuzziness and Soft Computing, C. Borgelt, M. Á. Gil, J. M. C. Sousa, and M. Verleysen, Eds. Berlin Heidelberg: Springer, 2013, vol. 285, pp. 205-222.10.1007/978-3-642-30278-7_17Search in Google Scholar

[17] P. Held and R. Kruse, “Analysis and visualization of dynamic clusterings,” in 2013 46th Hawaii International Conference on System Sciences. Los Alamitos, CA, USA: IEEE Computer Society, Jan. 2013, pp. 1385-1393. 10.1109/HICSS.2013.93Search in Google Scholar