پایان نامه مقایسۀ مدلهای ارائه شده براي شبکه هاي اجتماعی برخط بامحوریت انجمن هاي تشکیل شده

[1]        Wasserman, S. (1994). Social network analysis: Methods and applications (Vol. 8). Cambridge university press.

[2]        Moreno, J. L. (1953). Who shall survive? Foundations of sociometry, group psychotherapy and socio-drama.

[3]        Freeman, L. C. (2004). The development of social network analysis: A study in the sociology of science (Vol. 1). Vancouver: Empirical Press.

[4]        Mislove, E.A. (2009) Online Social Networks: Measurement, Analysis, and Applications to Distributed Information System (Huston, Texas)

[5]        Pastor-Satorras, R., Vázquez, A., Vespignani, A. (2001). Dynamical and correlation properties of the Internet. Physical review letters, 87(25), 258701.

[6]        Jinyang, L., Boon, T.L., Hellerstein, J., Kaashoek, F., Karger, D.R, Morris, R. (2003)

On the feasibility of peer-to-peer web indexing and search.(In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS’03, Berkeley, CA).

[7]        Newman, M. E. (2002). Assortative mixing in networks. Physical review letters, .107802 ,)02(98

[8]        Newman, M. E., Girvan, M. (2004). Finding and evaluating community structure in networks. Physical review E, 69(2), 026113.

[9]        Fortunato, S. (2010). Community detection in graphs. Physics Reports, 486(3), 75-

.471

[10]    Barabási, A. L., Albert, R. (1999). Emergence of scaling in random networks. Science, 286(5439), 509-512.

[11]    Dorogovtsev, S. N., Mendes, J. F. F., Samukhin, A. N. (2000). Structure of growing networks with preferential linking. Physical Review letters, 85(21), 4633.

[12]    Krapivsky, P. L., Redner, S., Leyvraz, F. (2000). Connectivity of growing random networks. Physical review letters, 85(21), 4629.

[13]    Toivonen, R., Kovanen, L., Kivelä, M., Onnela, J. P., Saramäki, J., Kaski, K. (2009). A comparative study of social network models: Network evolution models and nodal attribute models. Social Networks, 31(4), 240-254.

[14]    Coleman, J. S. (1964). Introduction to mathematical sociology. London Free Press

Glencoe.

[15]    Freeman, L. C. (2004). The development of social network analysis: A study in the sociology of science (Vol. 1). Vancouver: Empirical Press.

[16]    Kottak, C. P. (2004) Cultural Anthropology (McGraw-Hill, New York, USA).

[17]    Moody, J., White, D. R. (2003). Structural cohesion and embeddedness: A hierarchical concept of social groups. American Sociological Review, 103-127.

[18]    Weiss, R. S., Jacobson, E. (1955). A method for the analysis of the structure of complex organizations. American Sociological Review, 661-668.

[19]    Palla, G., Derényi, I., Farkas, I., Vicsek, T. (2005). Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043), 814-

.818

[20]    Mancoridis, S., Mitchell, B. S., Rorres, C., Chen, Y., Gansner, E. R. (1998, June). Using automatic clustering to produce high-level system organizations of source code.

In International Conference on Program Comprehension (pp. 45-45). IEEE Computer Society. Workshop on Program Comprehension (IEEE Computer Society, Washington, DC, USA).

[21]    Luce, R. D., Perry, A. D. (1949). A method of matrix analysis of group structure. Psychometrika, 14(2), 95-116.

[22]    Alba, R. D. (1973). A graph theoretic definition of a sociometric clique. Journal of

Mathematical Sociology, 3(1), 113-126.

[23]    Mokken, R. J. (1979). Cliques, clubs and clans. Quality Quantity, 13(2), 161-173.

[24]    Seidman, S. B., Foster, B. L. (1978). A graph theoretic generalization of the clique concept. Journal of Mathematical sociology, 6(1), 139-154.

[25]    Seidman, S. B. (1983). Network structure and minimum degree. Social networks,

.782-962 ,)3(5

[26]    Matsuda, H., Ishihara, T., Hashimoto, A. (1999). Classifying molecular sequences using a linkage graph with their pairwise similarities. Theoretical Computer Science, 210(2), 305-325.

[27]    Luccio, F., Sami, M. (1969). On the decomposition of networks in minimally interconnected subnetworks. Circuit Theory, IEEE Transactions on, 16(2), 184-188.

[28]    Guimera, R., Sales-Pardo, M., Amaral, L. A. N. (2004). Modularity from fluctuations in random graphs and complex networks. Physical Review E, 70(2), 025101.

[29]    Fortunato, S., Barthelemy, M. (2007). Resolution limit in community detection. Proceedings of the National Academy of Sciences, 104(1), 36-41.

[30]    Girvan, M., Newman, M. E. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12), 7821-7826.

[31]    Newman, M. E. (2004). Fast algorithm for detecting community structure in networks. Physical review E, 69(6), 066133.

[32]    Donath, W. E., Hoffman, A. J. (1973). Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17(5), 420-425.

[33]    Fiedler, M. (1973). Algebraic connectivity of graphs. Czechoslovak Mathematical

Journal, 23(2), 298-305.

[34]    Donetti, L., Munoz, M. A. (2004). Detecting network communities: a new systematic and efficient algorithm. Journal of Statistical Mechanics: Theory and Experiment, (10), P10012.

[35]    Zhou, H. (2003). Distance, dissimilarity index, and network community structure. Physical review e, 67(6), 061901.

[36]    Hughes, B. D. (1996). Random walks and random environments. Oxford: Clarendon

Press.

[37]    Hastings, M. B. (2006). Community detection as an inference problem. Physical Review E, 74(3), 035102.

[38]    Raghavan, U. N., Albert, R., Kumara, S. (2007). Near linear time algorithm to detect community structures in large-scale networks. Physical Review E, 76(3), 036106.

[39]    Bomze, I. M., Budinich, M., Pardalos, P. M., Pelillo, M. (1999). The maximum clique problem. In Handbook of combinatorial optimization (pp. 1-74). Springer US.

[40]    Nepusz, T., Petróczi, A., Négyessy, L., Bazsó, F. (2008). Fuzzy communities and the concept of bridgeness in complex networks. Physical Review E, 77(1), 016107.

[41]    Lancichinetti, A., Fortunato, S. (2009). Community detection algorithms: a comparative analysis. Physical review E, 80(5), 056117.

[42]    Erdös, P., Rényi, A. (1961). On the strength of connectedness of a random graph. Acta Mathematica Hungarica, 12(1), 261-267.

[43]    Newman, M. E., Strogatz, S. H., Watts, D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64(2), 026118.

[44]    Jeong, H., Néda, Z., Barabási, A. L. (2003). Measuring preferential attachment in evolving networks. EPL (Europhysics Letters), 61(4), 567.

[45]    Watts, D. J. (1999). Small worlds: the dynamics of networks between order and randomness. Princeton university press.

[46]    Davidsen, J., Ebel, H., Bornholdt, S. (2002). Emergence of a small world from local interactions: Modeling acquaintance networks. Physical Review Letters, 88(12), 128701.

[47]    Barabási, A. L., Albert, R. (1999). Emergence of scaling in random networks. science, 286(5439), 509-512.

[48]    Albert, R., Barabási, A. L. (2002). Statistical mechanics of complex networks. Reviews of modern physics, 74(1), 47.

[49]    Newman, M. E., Watts, D. J., Strogatz, S. H. (2002). Random graph models of social networks. Proceedings of the National Academy of Sciences, 99(suppl 1), 2566-2572.

[50]    Vázquez, A. (2003). Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations. Physical Review E, 67(5), 056104.

[51]    Marsili, M., Vega-Redondo, F., Slanina, F. (2004). The rise and fall of a networked society: A formal model. Proceedings of the National Academy of Sciences of the United States of America, 101(6), 1439-1442.

[52]    Boguná, M., Pastor-Satorras, R., Diaz-Guilera, A., Arenas, A. (2003). Emergence of clustering, correlations, and communities in a social network model. arXiv preprint cond-mat/0309263.

[53]    Watts, D. J., Dodds, P. S., Newman, M. E. (2002). Identity and search in social networks. science, 296(5571), 1302-1305.

[54]    Boguná, M., Pastor-Satorras, R. (2003). Class of correlated random networks with hidden variables. Physical Review E, 68(3), 036112.

[55]    Toivonen, R., Onnela, J. P., Saramäki, J., Hyvönen, J., Kaski, K. (2006). A model for social networks. Physica A: Statistical Mechanics and its Applications, 371(2), 851-860.

[56]    Cohen, R., Erez, K., Ben-Avraham, D., Havlin, S. (2000). Resilience of the Internet to random breakdowns. Physical review letters, 85(21), 4626.

[57]    Krapivsky, P. L., Redner, S. (2001). Organization of growing random networks.

Physical Review E, 63(6), 066123.

[58]    Evans, T. S., Saramäki, J. P. (2005). Scale-free networks from self-organization. Physical Review E, 72(2), 026138.

[59]    Dorogovtsev, S. N., Mendes, J. F. F., Samukhin, A. N. (2000). Structure of growing networks with preferential linking. Physical Review letters, 85(21), 4633.

[60]    Wong, L. H., Pattison, P., Robins, G. (2006). A spatial model for social networks.

Physica A: Statistical Mechanics and its Applications, 360(1), 99-120.

[61]    Frank, O., Strauss, D. (1986). Markov graphs. Journal of the American Statistical

Association, 81(395), 832-842.

[62]    McPherson, M., Smith-Lovin, L., Cook, J. M. (2001). Birds of a feather: Homophily in social networks. Annual review of sociology, 415-444.

[63]    Barrat, A., Barthélemy, M., Vespignani, A. (2004). Weighted evolving networks: coupling topology and weight dynamics. Physical review letters, 92(22), 228701.

[64]    Kumpula, J. M., Onnela, J. P., Saramäki, J., Kaski, K., Kertész, J. (2007). Emergence of communities in weighted networks. Physical review letters, 99(22), 228701.

[65]    Granovetter, M. S. (1973). The strength of weak ties. American journal of sociology,

.0831-0631