Evolution of a large online social network

Size: px
Start display at page:

Download "Evolution of a large online social network"

Transcription

1 Evolution of a large online social network Haibo Hu * and Xiaofan Wang Complex Networks and Control Lab, Shanghai Jiao Tong University, Shanghai , China Abstract: Although recently there are extensive research on the collaborative networks and online communities, there is very limited knowledge about the actual evolution of the online social networks (OSN). In the letter, we study the structural evolution of a large online virtual community. We find that the scale growth of the OSN shows non-trivial S shape which may provide a proper exemplification for Bass diffusion model. We reveal that the evolutions of many network properties, such as density, clustering, heterogeneity and modularity, show non-monotone feature, and shrink phenomenon occurs for the path length and diameter of the network. Furthermore, the OSN underwent a transition from degree assortativity characteristic of collaborative networks to degree disassortativity characteristic of many OSNs. Our study has revealed the evolutionary pattern of interpersonal interactions in a specific population and provided a valuable platform for theoretical modeling and further analysis. PACS: s, Ge, Hc Keywords: Social networking site; Online social network; Complex network; Structural evolution; Assortativity-disassortativity transition 1. Introduction Recently networks have constituted a fundamental framework for analyzing and modeling complex systems [1]. Social networks are typical examples of complex networks. A social network consists of all the people friends, family, colleague and others with whom one shares a social relationship, say friendship, commerce, or others. Traditional social network study can date back about half a century, focusing on interpersonal interactions in small groups due to the difficulty in obtaining large data sets [2]. The advent of modern database technology has greatly stimulated the statistical study of networks. Novel network structures of human societies have been revealed. The systematic research on the large scale available social network data has created a new subfield of network-sociology which integrates the theories of traditional social networks and modern complex networks [3]. As we know, now the WWW is undergoing a landmark revolution from the traditional Web 1.0 to Web 2.0 characterized by social collaborative technologies, such as Social Networking Site (SNS), blog, Wiki and folksonomy. In recent years, as a fast growing business, many SNSs of * Corresponding author. Tel.: address: hbh@sjtu.edu.cn (H.-B. Hu). 1

2 differing scope and purpose have emerged in the Internet. The OSNs, constructed from the SNSs and embedded in Cyberspace, have attracted attentions of researchers from different disciplines, examples of which include MySpace [4], Facebook [5], Pussokram [6], etc. SNSs provide an online private space for individuals and tools for interacting with other people in the Internet. Thus the statistics and dynamics of these OSNs are of tremendous importance to researchers interested in human behaviors [3, 7]. In this letter, we will focus on an Internet community Wealink ( which is one of the largest OSNs in China at present. It is found that the scale growth of the OSN shows non-trivial S shape. At the same time the evolutions of network density, clustering, heterogeneity and modularity exhibit complex, non-monotone feature. We also observe shrink phenomenon for the path length and diameter of the network. Most interestingly it is found that the OSN has undergone a transition from degree assortativity characteristic of collaborative networks to degree disassortativity characteristic of many virtual communities. There can be different evolving mechanisms for the two kinds of social networks. Besides we also compare some observed quantities to the corresponding values from randomized networks with the same degree sequence as the original and reveal the significance of some specific network features. 2. Data sets Wealink is a large SNS whose users are mostly professionals, typically businessmen and office clerks. Each registered user of the SNS has a profile, including his/her list of friends. If we view the users as nodes V and friend relationships as edges E, an undirected friendship network GV (, E) can be constructed from Wealink. For privacy reasons, the data, logged from 0:00:00 h on 11 May 2005 (the inception day for the Internet community) to 15:23:42 h on 22 Aug 2007, include only each user s ID and list of friends, and the establishment time for each friend relationship. The online community is a dynamical evolving one with the new users joining in the community and new connections established between users. 3. Structural evolution We extract 27 snapshots of Wealink with an interval of one month from June 11 th, 2005 to August 11 th, 2007 and investigate the evolution of the network. Fig. 1 shows the growth of the numbers of nodes and edges, and the variation of network density over time. The density of a network is defined as the ratio of the number of real edges E to the number of total possible edges N( N 1)/2( N is the number of nodes). In a recent work, Leskovec et al. observed that certain citation graphs, the Internet at the Autonomous System level, and networks became denser over time, with the number of edges growing super-linearly in the number of nodes [8]. However, we find that the density of the OSN as a function of time is non-monotone. There are 2

3 three obviously marked stages: an initial upward trend leading to a peak, followed by a decline, and the final gradual steady increase, which also is observed in Flickr and Yahoo! 360 studied by Kumar et al [9]. A possible reason is that right after the establishment of the OSN, there was an initial excitement among a few enthusiasts who joined the network and frantically invited many of their friends to join; this gives rise to the first stage that culminates in a peak. The second stage corresponds to a natural dying-out of this euphoria and this leads to the decline. Finally the network appears to arrive at equilibrium and its density seems to converge to constant. Some network models based on preferential attachment cannot reproduce this phenomenon. It is interesting that the growth pattern for the network scale, including the numbers of nodes and edges, shows S shape. It is well known that S-shaped curve is the heart of many diffusion processes and is characteristic of a chain reaction, in which the number of people who adopt a new behavior follows a logistic-like function [10]: a slow growth in the initial stage, rapid growth for critical mass time, and a rapid flattening of the curve beyond this point. We may view membership and friendship in the OSN as a behavior that spreads through the Chinese professionals. According to Bass diffusion model [11] and as shown in Fig. 1, the growth of network scale m ST ( ) can be fitted by the logistic function ST ( ) =. S-shaped growth of network ( ) 1 + e T a s scale was also observed by Chun et al. in Cyworld [12]. For large T, the increment of the number of nodes/edges, i.e. d S/dT, is exponentially decaying. A recent research has shown that the weekly overall grosses income of movies, reflecting the diffusion of a movie in population, indeed decay exponentially with time [13]. Fig. 2 shows the numbers of new nodes and edges in the T th month for the whole network. Most users and links appeared in the network over a short period of time, i.e. between the 11 th and 17 th month. After the 17 th month, every month there were still some new users joining in the network and new links created in the network, although the numbers of them are small. It is clear that each new link can be created between two old users (Old-Old), two new users (New-New) or an old user and a new one (New-Old). According to the types of users the newly established edges can be divided into three classes. Fig. 3 shows the proportion of three kinds of edges created in the T th month. We find that most links were created between two old users or an old user and a new one, even after the 17 th month. The results indicate that the evolving network has reached a state of equilibrium. We evaluate the shortest path lengths l ( N i > j 1 ) of every node pair within the social ij network, and obtain the average path length l = l C. The diameter of the network is ij 2 N D= max l ij. Fig. 4 shows the evolution of l and D for the largest connected subgraph over time compared to network density d. The growth of d may provide partial explanation for the 3

4 evolution pattern of l and D [9]. The evolutions of both l and D also show three different stages: in the first stage, they are almost constants; in the next stage, when the network density declines, the l and D grow till they reach peaks; in the third stage, when the d starts increasing slowly, accordingly the l and D start minishing slowly. However it is clear that there is no obvious evidence that these two metrics are analytically connected to each other. Recently the phenomenon of shrinking diameter was also observed by Kumar et al. [9] in Flickr and Yahoo! 360 and by Leskovec et al. [8] in citation graphs and the Internet at the Autonomous System level. A network model based on forest fire spreading process can reproduce the feature of shrinking diameter [8]. Social networks are believed to have many connected triads, i.e. a high degree of transitivity. That is, if person A knows B and C, then it is quite likely that B and C are acquainted. A quantity to measure the strength of connections within i s neighborhood is the local clustering coefficient c = e( Γ ) C, where e( Γ i ) is the number of real edges within i s neighborhood Γ i 2 i i ki 2 consisting of nodes, and C is the total number of all possible connections in Γ [14]. The k i k i clustering coefficient C of the entire network is defined as the mean value of c. Fig. 5(a) shows the time evolution of clustering coefficients C for the largest connected subgraph. It shows strong positive correlation with density d in the network. And almost at the same time C and d arrive at their equilibrium values. High network density favors clustering to some extent. However there is also no distinct evidence that the two metrics are analytically correlative with each other. For a random network, although its density may be large, its clustering coefficient still may be less than that of a low-density network with, say, strong community feature. Fig. 5(b) shows the comparison of C between actual networks and reshuffled ones obtained by random degree-preserving rewiring of the original networks [15]. It is evident that the C of actual networks is significantly larger than that of the randomized and it is similar in growth trend to that of randomized ones. The degree distribution for the largest connected subgraph at the largest time can be fitted by a power law Pk ( )~ k γ γ with a degree exponent Compared to exponential networks, power law networks are thought to be highly heterogeneous. The heterogeneity of node degrees of a network can be quantified by heterogeneity index H, which can be computed as N N 2 i j 2 k, where i (1 i= 1 j= 1 H = k k N k i N ) is node degree, k is the mean degree, and 0 H <1[16]. The H of exponential networks has maximum 0.5. The variation of H for the largest connected subgraph is shown in Fig. 6. It displays non-monotone feature and finally converges to a constant. i i 4

5 Fig. 7 shows the evolution of the degree distribution of the largest connected subgraphs of the network. The degree distribution gradually converges to a power law with degree exponent γ In Wealink, users can create discussing groups with specific topics. The users who are interested in some topic can join in the corresponding group and create friend relations with the users in the group. Each discussing group comprises 30 users at most. As shown in Fig. 7, the function of Wealink leads to the emergence of peak values of degree distribution at degrees of about integral multiples of 30 (30, 60, 90, etc.). Many social networks show distinct feature of community structure, the gathering of nodes into groups such that there is a higher density of edges within groups than between them. We analyze the community structure of the largest connected subgraph of the OSN with the hierarchical agglomeration algorithm proposed by Clauset et al [17]. Modularity Q is a measure of the quality of a particular division of a network into communities, which measures the fraction of the edges in the network that connect nodes of the same type (i.e., withincommunity edges) minus the expected value of the same quantity in a network with the same community divisions but random connections between the nodes. Q is defined as follows [18]: Consider a specific division of a network into communities, and suppose e ij is the fraction of all edges in the network that link nodes in community join nodes in the same community connect to nodes in community i, then i to nodes in community j, then eii i. Define a = i i i eij j 2 ( ii i ) good indicator of significant community structure in a network. gives the fraction of edges that represents the fraction of edges that Q= e a. A Q value above about 0.3 is a Fig. 8 shows the evolution of Q for the largest connected subgraph in comparison with the same metric of randomized networks. On the whole Q shows increasing trend indicating the modularity of the network is more and more prominent, and finally the network gets to equilibrium with almost changeless Q. In the online professional social network, the tendency of establishing interpersonal relations among the individuals with the same or similar occupations and the existence of discussing groups with specific topics, can lead to the emergence of communities with densely interconnected individuals and the high modularity of the network. The Wealink has significantly higher Q than those of randomized networks and the Q of actual networks is similar in growth trend to those of randomized ones. We also find that the randomized 5

6 networks still possess large Q, which may result from the structural constraint of degree sequence of original networks. The correlation can exist between the degrees of adjacent nodes, which is often characterized by the assortativity r nodes connected by a link: and defined as the Pearson correlation coefficient of the degrees of either 2 2 ( ) ( ) r = ij i j i i, where i and j are the remaining degrees at the two ends of an edge and the notation represents the average over all links [19]. If a network s assorativity is negative, a hub tends to be connected to non-hubs, and vice versa. When r > 0, we call the network to have an assortative mixing pattern, and when r < 0, disassortative mixing. The conventional wisdom is that social networks exhibit an assortative mixing pattern, whereas biological and technological networks show a disassortative mixing pattern [20]. However the recent research on the OSNs modifies the wide-spread belief and many OSNs show a disassortative or neutral mixing trait, which is displayed in Table 1. The origins of obvious degree assorativity for collaborative networks are miscellaneous. From the perspective of sociology and psychology, in real life everyone would like to interact with elites in the society; however the elites would rather communicate with the people with the same social status as theirs, which may lead to the assortative mixing pattern in the collaborative networks. For professional collaborations, such as scientific, actor, and business collaborations, the already big names preferably collaborate with other big names for success, reputation and influence. As indicated by Holme et al. [6], assortative mixing may be significant only to interaction in competitive areas. Besides it appears that some of the degree correlation in collaborative networks could have real organizational origins. Generally the networks of collaborations between academics, actors, and businessmen are affiliation networks, in which people are connected together by membership of common groups (authors of a paper, actors in a film, researchers in a lab, office clerks in a company, etc.) [28]. OSNs differ from the collaborative networks in these regards. They break the invisible boundary among different estates in a society. In the virtual world elites will not refuse connections from anyone because they know that more connections show others they are elites. And unlike in real life, these links are not costly. Relationships in the real world have to be maintained and this requires continual effort. The basic difference could be the deciding difference between virtual and real world. Understanding the process, the generative mechanism, will supply a substantial comprehension of the formation and evolution of online virtual communities. Generally it is thought that real-world networks always belong to the same type over time, either assortative or disassortative. However as shown in Fig. 9, the Wealink underwent a transition from the initial assortativity characteristic of collaborative networks to subsequent disassortativity characteristic of many OSNs. To the best of our knowledge, this is the first 6

7 real-world network observed which possesses the intriguing feature. A reasonable conjecture is that often the friendship relations in the beginning OSN are based on real-life interpersonal relations, which means that Wealink users were linking to the other users who are their friends in the real world. In this case the OSN directly inherits the assortative structure of the underlying real-life interpersonal network. However at the later stage many online users of low degrees may preferentially establish connections with the network elites of high degrees, resulting in the disassortative mixing. Fig. 9 also shows the comparison of r between actual networks and randomized ones. The randomized networks show disassortative or nearly neutral mixing feature, and all r s are less than 0 and no transition appears. The comparison shows that the Wealink is strongly degree assortative at the beginning stage and disassortative at the later stage, suggesting that individuals indeed draw their partners from the users with degrees similar (beginning) or dissimilar (later) to theirs far more often than one would expect on the basis of pure chance. 4. Summary and discussion In the letter, we have studied the structural evolution of a large OSN. The selection of friends performed by registered users is driven by their personal occupational background. We have found that the scale growth of the OSN shows S shape, which may provide an exemplification for Bass diffusion model. The evolutions of network density, clustering, heterogeneity and modularity show non-monotone feature, and shrink phenomena for the path length and diameter of the network occur. Especially we have shown that the OSN underwent a transition from degree assortativity to disassortativity. The OSN has arrived at its equilibrium, where its statistical quantities have converged to their constant limits. A social network might be divided up according to the location, affiliation, occupation, and so forth, of its members. It is thought that clustering and assortativity in networks arise because the vertices are divided into communities [20]; however from Figs. 5, 8 and 9 we find that both clustering coefficient and degree assortativity are negatively correlative with modularity. Recent study also showed that the heterogeneity of networks could be negatively correlative with assortativity coefficient [29]; the comparison between Fig. 6 and Fig. 9 may provide a proper counterexample to the prevailing view. It should be quite cautious to claim that there exists specific correlation between network metrics, and obviously under different conditions there may be quite different conclusions. Different network properties, such as modularity, clustering, assortativity, heterogeneity, synchronizability, etc., may constrain each other, or not be independent [30]. However for a network with some fixed metric, say, degree exponent γ, by random rewiring, we also can obtain the tunable space for another network metric, say assortativity coefficient r. And within the γ - r space, under disparate conditions, all the three cases, positive correlation, negative correlation and no correlation between γ and r, can occur. 7

8 Until now it is still not completely known how the various topological properties are related, or if it is possible to single out a family of metrics defining all others, which constitutes an open field of study [31]. As a rapidly developing field in interdisciplinary research, virtual community has attracted scholars of different backgrounds, mostly physicists and computer scientists. However the main body in the virtual world is still persons in real world, thus as pointed out by Tim Berners-Lee - the father of the World Wide Web, understanding the web community may also require insights from sociology and psychology every bit as much as from physics and computer science [32]. Acknowledgments We thank Wealink Co. for providing the network data. This work was partly supported by the NSF of PRC under Grant No References [1] M. E. J. Newman, A. L. Barabási, and D. J. Watts, The Structure and Dynamics of Networks, Princeton University Press, Princeton, [2] S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, Cambridge University Press, Cambridge, [3] B. Wellman, Science 293 (2001) [4] Y. Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong, Analysis of topological characteristics of huge online social networking services, Proceedings of the 16 th International Conference on World Wide Web, ACM Press, New York, [5] S. A. Golder, D. Wilkinson, and B. Huberman, e-print arxiv: cs/ ; K. Lewis, J. Kaufman, M. Gonzalez, A. Wimmer, and N. Christakis, Social Networks 30 (2008) 330. [6] P. Holme, C. R. Edling, and F. Liljeros, Social Networks 26 (2004) 155. [7] C. Licoppe and Z. Smoreda, Social Networks 27, 317 (2005); W. S. Bainbridge, Science 317 (2007) 472. [8] J. Leskovec, J. Kleinberg, and C. Faloutsos, ACM Transactions on Knowledge Discovery from Data 1 (2007) 1. [9] R. Kumar, J. Novak, and A. Tomkins, Structure and evolution of online social networks, Proceedings of the th 12 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, New York, [10] A. Tsoularis and J. Wallace, Mathematical Biosciences 179 (2002) 21. [11] F. M. Bass, Management Science 15 (1969) 215; P. S. Dodds and D. J. Watts, Phys. Rev. Lett. 92 (2004) ; D. J. Watts and P. S. Dodds, Journal of Consumer Research 34 (2007) 441. [12] H. Chun, H. Kwak, Y. H. Eom, Y. Y. Ahn, S. Moon, and H. Jeong, Comparison of online social relations in terms of volume vs. interaction: A case study of Cyworld, Proceedings of the 8 ACM SIGCOMM Conference on Internet Measurement, ACM Press, New York, th 8

9 [13] S. Sinha and R. K. Pan, e-print arxiv: [14] D. J. Watts and S. H. Strogatz, Nature 393 (1998) 440. [15] S. Maslov and K. Sneppen, Science 296 (2002) 910. [16] H. B. Hu and L. Wang, Advances in Complex Systems 8 (2005) 159; H. B. Hu and X. F. Wang, Physica A 387 (2008) [17] A. Clauset, M. E. J. Newman, and C. Moore, Phys. Rev. E 70 (2004) [18] M. E. J. Newman and M. Girvan, Phys. Rev. E 69 (2004) [19] M. E. J. Newman, Phys. Rev. Lett. 89 (2002) [20] M. E. J. Newman and J. Park, Phys. Rev. E 68 (2003) ; J. Park and M. E. J. Newman, Phys. Rev. E 68 (2003) [21] F. Fu, X. Chen, L. Liu, and L. Wang, e-print arxiv: physics/ [22] F. Wang, Y. Moreno, and Y. Sun, Phys. Rev. E 73 (2006) [23] A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, Measurement and analysis of online social networks, Proceedings of the 7 th ACM SIGCOMM Conference on Internet Measurement, ACM Press, New York, [24] K. Yuta, N. Ono, and Y. Fujiwara, e-print arxiv: physics/ [25] M. E. J. Newman, Proc. Natl. Acad. Sci. U.S.A. 98 (2001) 404. [26] A. L. Barabási, H. Jeong, Z. Néda, E. Ravasz, A. Schubert, and T. Vicsek, Physica A 311 (2002) 590. [27] K. I. Goh, E. Oh, B. Kahng, and D. Kim, Phys. Rev. E 67 (2003) [28] M. E. J. Newman, Phys. Rev. E 67 (2003) [29] A. Barrat and R. Pastor-Satorras, Phys. Rev. E 71 (2005) ; M. Boguñá and R. Pastor-Satorras, Phys. Rev. E 68 (2003) [30] I. Z. Kiss and D. M. Green, Phys. Rev. E 78 (2008) [31] A. Barrat, M. Barthélemy, and A. Vespignani, Dynamical Processes on Complex Networks, Cambridge University Press, New York, 2008; P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat, ACM SIGCOMM Computer Communication Review 36 (2006) 135. [32] N. Shadbolt and T. Berners-Lee, Scientific American 299(4) (2008) 76. 9

10 Figure Captions Fig. 1. Evolution of the numbers of nodes N and edges E, and network density d for the whole network (a) and the largest connected subgraph (b) of Wealink from June 11 th 2005 to August 11 th 2007 with an interval of one month. Solid lines are the fitted curves by the logistic 5 3 function. In (a) least squares fitting gives m = ± , a = ± and s =1.524 ± for NT ( ) and m = ± , a = ± and s =1.358 ± for E( T ). In (b) least squares fitting gives 5 3 m = ± , a = ± and s =1.527 ± for NT ( ) and 5 3 m = ± , a = ± and s =1.306 ± for ET ( ). Fig. 2. The number of new nodes/edges at at T. Fig. 3. Evolution of the proportion of three kinds of edges. T, i.e. the increment of the number of nodes/edges Fig. 4. Time evolution of average path length l and diameter D for the largest connected subgraph of Wealink in comparison with network density d. Fig. 5. (a) Variation of clustering coefficient over time in comparison with network density for the largest connected subgraph of Wealink d. (b) The left scale is for clustering coefficient of largest connected subgraph of Wealink and its randomized version and the right scale the ratio of C of actual networks to that of randomized ones. Fig. 6. Variation of heterogeneity index time. Fig. 7. Evolution of the degree distribution of Wealink. H C for the largest connected subgraph of Wealink over Fig. 8. Evolution of modularity Q for the actual networks and corresponding randomized ones. Fig. 9. Evolution of degree assortativity r for the Wealink and its randomized version. 10

11 Table 1. Degree assortativity coefficients of OSNs and collaborative networks. The percentage in parenthesis indicates sampling ratio. Type Network N r References Cyworld 12, 048, [4] nioki 50, [6] All contacts in pussokram 29, [6] Messages in pussokram 21, [6] Guest book in pussokram 20, [6] Friends in pussokram 14, [6] Online social network Flirts in pussokram 8, [6] MySpace 100, 000 (~0.08%) 0.02 [4] orkut 100, 000 (~0.30%) 0.31 [4] Xiaonei 396, [21] Gnutella P2P(SN 6) 191, [22] Flickr 1, 846, 198 (26.9%) [23] LiveJournal 5, 284, 457 (95.4%) [23] YouTube 1, 157, [23] mixi 360, [24] ArXiv coauthorship 52, [25] Cond-mat coauthorship 16, [25] Mathematics coauthorship 253, [19] Collaborative network Neuroscience coauthorship 205, [26] Biology coauthorship 1, 520, [25] Film actor collaboration 449, [19] TV series actor collaboration 79, [27] Company directors 7, [19] 11

12 Fig. 1 N(T), E(T) (a) N(T) E(T) Fitted lines N(T), E(T) (b) N(T) E(T) Fitted lines Fig ΔN(T) ΔE(T) Fig New-New New-Old Old-Old P(T)

13 Fig. 4 l(t), D(T) l(t) D(T) Fig C(T) Actual networks Randomized networks Ratio (a) C(T) C(T) (b) R(T) Fig H(T)

14 Fig months 11 months 20 months 27 months P(k) 10-3 Slope k Fig. 8 Q(T) Actual networks Randomized networks Fig Actual networks Randomized networks 0.2 r(t)

Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network

Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network , pp.273-284 http://dx.doi.org/10.14257/ijdta.2015.8.5.24 Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network Gengxin Sun 1, Sheng Bin 2 and

More information

The ebay Graph: How Do Online Auction Users Interact?

The ebay Graph: How Do Online Auction Users Interact? The ebay Graph: How Do Online Auction Users Interact? Yordanos Beyene, Michalis Faloutsos University of California, Riverside {yordanos, michalis}@cs.ucr.edu Duen Horng (Polo) Chau, Christos Faloutsos

More information

Research Article A Comparison of Online Social Networks and Real-Life Social Networks: A Study of Sina Microblogging

Research Article A Comparison of Online Social Networks and Real-Life Social Networks: A Study of Sina Microblogging Mathematical Problems in Engineering, Article ID 578713, 6 pages http://dx.doi.org/10.1155/2014/578713 Research Article A Comparison of Online Social Networks and Real-Life Social Networks: A Study of

More information

Graphs over Time Densification Laws, Shrinking Diameters and Possible Explanations

Graphs over Time Densification Laws, Shrinking Diameters and Possible Explanations Graphs over Time Densification Laws, Shrinking Diameters and Possible Explanations Jurij Leskovec, CMU Jon Kleinberg, Cornell Christos Faloutsos, CMU 1 Introduction What can we do with graphs? What patterns

More information

Chapter 29 Scale-Free Network Topologies with Clustering Similar to Online Social Networks

Chapter 29 Scale-Free Network Topologies with Clustering Similar to Online Social Networks Chapter 29 Scale-Free Network Topologies with Clustering Similar to Online Social Networks Imre Varga Abstract In this paper I propose a novel method to model real online social networks where the growing

More information

Structure and evolution of online social relationships: Heterogeneity in unrestricted discussions

Structure and evolution of online social relationships: Heterogeneity in unrestricted discussions Structure and evolution of online social relationships: Heterogeneity in unrestricted discussions K.-I. Goh, 1, * Y.-H. Eom, 2 H. Jeong, 2 B. Kahng, 1,3 and D. Kim 1 1 School of Physics and Center for

More information

Graph theoretic approach to analyze amino acid network

Graph theoretic approach to analyze amino acid network Int. J. Adv. Appl. Math. and Mech. 2(3) (2015) 31-37 (ISSN: 2347-2529) Journal homepage: www.ijaamm.com International Journal of Advances in Applied Mathematics and Mechanics Graph theoretic approach to

More information

Graph Mining Techniques for Social Media Analysis

Graph Mining Techniques for Social Media Analysis Graph Mining Techniques for Social Media Analysis Mary McGlohon Christos Faloutsos 1 1-1 What is graph mining? Extracting useful knowledge (patterns, outliers, etc.) from structured data that can be represented

More information

Structure of a large social network

Structure of a large social network PHYSICAL REVIEW E 69, 036131 2004 Structure of a large social network Gábor Csányi 1, * and Balázs Szendrői 2, 1 TCM Group, Cavendish Laboratory, University of Cambridge, Madingley Road, Cambridge CB3

More information

Understanding Graph Sampling Algorithms for Social Network Analysis

Understanding Graph Sampling Algorithms for Social Network Analysis Understanding Graph Sampling Algorithms for Social Network Analysis Tianyi Wang, Yang Chen 2, Zengbin Zhang 3, Tianyin Xu 2 Long Jin, Pan Hui 4, Beixing Deng, Xing Li Department of Electronic Engineering,

More information

The Structure of Growing Social Networks

The Structure of Growing Social Networks The Structure of Growing Social Networks Emily M. Jin Michelle Girvan M. E. J. Newman SFI WORKING PAPER: 2001-06-032 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily

More information

Understanding the evolution dynamics of internet topology

Understanding the evolution dynamics of internet topology Understanding the evolution dynamics of internet topology Shi Zhou* University College London, Adastral Park Campus, Ross Building, Ipswich, IP5 3RE, United Kingdom Received 2 December 2005; revised manuscript

More information

A Graph-Based Friend Recommendation System Using Genetic Algorithm

A Graph-Based Friend Recommendation System Using Genetic Algorithm WCCI 2010 IEEE World Congress on Computational Intelligence July, 18-23, 2010 - CCIB, Barcelona, Spain CEC IEEE A Graph-Based Friend Recommendation System Using Genetic Algorithm Nitai B. Silva, Ing-Ren

More information

GENERATING AN ASSORTATIVE NETWORK WITH A GIVEN DEGREE DISTRIBUTION

GENERATING AN ASSORTATIVE NETWORK WITH A GIVEN DEGREE DISTRIBUTION International Journal of Bifurcation and Chaos, Vol. 18, o. 11 (2008) 3495 3502 c World Scientific Publishing Company GEERATIG A ASSORTATIVE ETWORK WITH A GIVE DEGREE DISTRIBUTIO JI ZHOU, XIAOKE XU, JIE

More information

Self similarity of complex networks & hidden metric spaces

Self similarity of complex networks & hidden metric spaces Self similarity of complex networks & hidden metric spaces M. ÁNGELES SERRANO Departament de Química Física Universitat de Barcelona TERA-NET: Toward Evolutive Routing Algorithms for scale-free/internet-like

More information

The architecture of complex weighted networks

The architecture of complex weighted networks The architecture of complex weighted networks A. Barrat*, M. Barthélemy, R. Pastor-Satorras, and A. Vespignani* *Laboratoire de Physique Théorique (Unité Mixte de Recherche du Centre National de la Recherche

More information

Structural constraints in complex networks

Structural constraints in complex networks Structural constraints in complex networks Dr. Shi Zhou Lecturer of University College London Royal Academy of Engineering / EPSRC Research Fellow Part 1. Complex networks and three key topological properties

More information

Application of Social Network Analysis to Collaborative Team Formation

Application of Social Network Analysis to Collaborative Team Formation Application of Social Network Analysis to Collaborative Team Formation Michelle Cheatham Kevin Cleereman Information Directorate Information Directorate AFRL AFRL WPAFB, OH 45433 WPAFB, OH 45433 michelle.cheatham@wpafb.af.mil

More information

Physical Theories of the Evolution of Online Social Networks: A Discussion Impulse

Physical Theories of the Evolution of Online Social Networks: A Discussion Impulse Physical Theories of the Evolution of Online Social Networks: A Discussion Impulse Lutz Poessneck, Henning Hofmann, Ricardo Buettner FOM Hochschule fuer Oekonomie & Management, University of Applied Sciences

More information

An approach of detecting structure emergence of regional complex network of entrepreneurs: simulation experiment of college student start-ups

An approach of detecting structure emergence of regional complex network of entrepreneurs: simulation experiment of college student start-ups An approach of detecting structure emergence of regional complex network of entrepreneurs: simulation experiment of college student start-ups Abstract Yan Shen 1, Bao Wu 2* 3 1 Hangzhou Normal University,

More information

Applying Social Network Analysis to the Information in CVS Repositories

Applying Social Network Analysis to the Information in CVS Repositories Applying Social Network Analysis to the Information in CVS Repositories Luis Lopez-Fernandez, Gregorio Robles, Jesus M. Gonzalez-Barahona GSyC, Universidad Rey Juan Carlos {llopez,grex,jgb}@gsyc.escet.urjc.es

More information

Graph models for the Web and the Internet. Elias Koutsoupias University of Athens and UCLA. Crete, July 2003

Graph models for the Web and the Internet. Elias Koutsoupias University of Athens and UCLA. Crete, July 2003 Graph models for the Web and the Internet Elias Koutsoupias University of Athens and UCLA Crete, July 2003 Outline of the lecture Small world phenomenon The shape of the Web graph Searching and navigation

More information

A dynamic model for on-line social networks

A dynamic model for on-line social networks A dynamic model for on-line social networks A. Bonato 1, N. Hadi, P. Horn, P. Pra lat 4, and C. Wang 1 1 Ryerson University, Toronto, Canada abonato@ryerson.ca, cpwang@ryerson.ca Wilfrid Laurier University,

More information

A MULTI-MODEL DOCKING EXPERIMENT OF DYNAMIC SOCIAL NETWORK SIMULATIONS ABSTRACT

A MULTI-MODEL DOCKING EXPERIMENT OF DYNAMIC SOCIAL NETWORK SIMULATIONS ABSTRACT A MULTI-MODEL DOCKING EXPERIMENT OF DYNAMIC SOCIAL NETWORK SIMULATIONS Jin Xu Yongqin Gao Jeffrey Goett Gregory Madey Dept. of Comp. Science University of Notre Dame Notre Dame, IN 46556 Email: {jxu, ygao,

More information

Effects of node buffer and capacity on network traffic

Effects of node buffer and capacity on network traffic Chin. Phys. B Vol. 21, No. 9 (212) 9892 Effects of node buffer and capacity on network traffic Ling Xiang( 凌 翔 ) a), Hu Mao-Bin( 胡 茂 彬 ) b), and Ding Jian-Xun( 丁 建 勋 ) a) a) School of Transportation Engineering,

More information

A SURVEY OF PROPERTIES AND MODELS OF ON- LINE SOCIAL NETWORKS

A SURVEY OF PROPERTIES AND MODELS OF ON- LINE SOCIAL NETWORKS International Conference on Mathematical and Computational Models PSG College of Technology, Coimbatore Copyright 2009, Narosa Publishing House, New Delhi, India A SURVEY OF PROPERTIES AND MODELS OF ON-

More information

PUBLIC TRANSPORT SYSTEMS IN POLAND: FROM BIAŁYSTOK TO ZIELONA GÓRA BY BUS AND TRAM USING UNIVERSAL STATISTICS OF COMPLEX NETWORKS

PUBLIC TRANSPORT SYSTEMS IN POLAND: FROM BIAŁYSTOK TO ZIELONA GÓRA BY BUS AND TRAM USING UNIVERSAL STATISTICS OF COMPLEX NETWORKS Vol. 36 (2005) ACTA PHYSICA POLONICA B No 5 PUBLIC TRANSPORT SYSTEMS IN POLAND: FROM BIAŁYSTOK TO ZIELONA GÓRA BY BUS AND TRAM USING UNIVERSAL STATISTICS OF COMPLEX NETWORKS Julian Sienkiewicz and Janusz

More information

Expansion Properties of Large Social Graphs

Expansion Properties of Large Social Graphs Expansion Properties of Large Social Graphs Fragkiskos D. Malliaros 1 and Vasileios Megalooikonomou 1,2 1 Computer Engineering and Informatics Department University of Patras, 26500 Rio, Greece 2 Data

More information

Q. Yan, X. Huang School of Economics and Management, Beijing University of Posts and Telecommunications, Beijing, China, 100876 Email: yq_10@sohu.

Q. Yan, X. Huang School of Economics and Management, Beijing University of Posts and Telecommunications, Beijing, China, 100876 Email: yq_10@sohu. JOURNAL OF NETWORKS, VOL. 3, NO. 7, JULY 28 1 fuser Behavior and Topology Analysis Q. Yan, X. Huang School of Economics and Management, Beijing University of Posts and Telecommunications, Beijing, China,

More information

http://www.elsevier.com/copyright

http://www.elsevier.com/copyright This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and education use, including for instruction at the author s institution, sharing

More information

Time-Dependent Complex Networks:

Time-Dependent Complex Networks: Time-Dependent Complex Networks: Dynamic Centrality, Dynamic Motifs, and Cycles of Social Interaction* Dan Braha 1, 2 and Yaneer Bar-Yam 2 1 University of Massachusetts Dartmouth, MA 02747, USA http://necsi.edu/affiliates/braha/dan_braha-description.htm

More information

USING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS

USING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS USING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS Natarajan Meghanathan Jackson State University, 1400 Lynch St, Jackson, MS, USA natarajan.meghanathan@jsums.edu

More information

Introduction to Networks and Business Intelligence

Introduction to Networks and Business Intelligence Introduction to Networks and Business Intelligence Prof. Dr. Daning Hu Department of Informatics University of Zurich Sep 17th, 2015 Outline Network Science A Random History Network Analysis Network Topological

More information

Temporal Dynamics of Scale-Free Networks

Temporal Dynamics of Scale-Free Networks Temporal Dynamics of Scale-Free Networks Erez Shmueli, Yaniv Altshuler, and Alex Sandy Pentland MIT Media Lab {shmueli,yanival,sandy}@media.mit.edu Abstract. Many social, biological, and technological

More information

Scientific Collaboration Networks in China s System Engineering Subject

Scientific Collaboration Networks in China s System Engineering Subject , pp.31-40 http://dx.doi.org/10.14257/ijunesst.2013.6.6.04 Scientific Collaboration Networks in China s System Engineering Subject Sen Wu 1, Jiaye Wang 1,*, Xiaodong Feng 1 and Dan Lu 1 1 Dongling School

More information

Social Network Mining

Social Network Mining Social Network Mining Data Mining November 11, 2013 Frank Takes (ftakes@liacs.nl) LIACS, Universiteit Leiden Overview Social Network Analysis Graph Mining Online Social Networks Friendship Graph Semantics

More information

The Network Structure of Hard Combinatorial Landscapes

The Network Structure of Hard Combinatorial Landscapes The Network Structure of Hard Combinatorial Landscapes Marco Tomassini 1, Sebastien Verel 2, Gabriela Ochoa 3 1 University of Lausanne, Lausanne, Switzerland 2 University of Nice Sophia-Antipolis, France

More information

The Length of Bridge Ties: Structural and Geographic Properties of Online Social Interactions

The Length of Bridge Ties: Structural and Geographic Properties of Online Social Interactions The Length of Bridge Ties: Structural and Geographic Properties of Online Social Interactions Yana Volkovich Barcelona Media Foundation yana.volkovich@barcelonamedia.org Salvatore Scellato University of

More information

Evolution of the Internet AS-Level Ecosystem

Evolution of the Internet AS-Level Ecosystem Evolution of the Internet AS-Level Ecosystem Srinivas Shakkottai, Marina Fomenkov 2, Ryan Koga 2, Dmitri Krioukov 2, and kc claffy 2 Texas A&M University, College Station, USA, sshakkot@tamu.edu, 2 Cooperative

More information

Communication Dynamics of Blog Networks

Communication Dynamics of Blog Networks Communication Dynamics of Blog Networks Mark Goldberg CS Department, RPI 0 8th Street Troy, NY goldberg@cs.rpi.edu Konstantin Mertsalov CS Department, RPI 0 8th Street Troy, NY mertsk2@cs.rpi.edu Stephen

More information

Complex Network Visualization based on Voronoi Diagram and Smoothed-particle Hydrodynamics

Complex Network Visualization based on Voronoi Diagram and Smoothed-particle Hydrodynamics Complex Network Visualization based on Voronoi Diagram and Smoothed-particle Hydrodynamics Zhao Wenbin 1, Zhao Zhengxu 2 1 School of Instrument Science and Engineering, Southeast University, Nanjing, Jiangsu

More information

Collapse by Cascading Failures in Hybrid Attacked Regional Internet

Collapse by Cascading Failures in Hybrid Attacked Regional Internet Collapse by Cascading Failures in Hybrid Attacked Regional Internet Ye Xu and Zhuo Wang College of Information Science and Engineering, Shenyang Ligong University, Shenyang China xuy.mail@gmail.com Abstract

More information

The Topology of Large-Scale Engineering Problem-Solving Networks

The Topology of Large-Scale Engineering Problem-Solving Networks The Topology of Large-Scale Engineering Problem-Solving Networks by Dan Braha 1, 2 and Yaneer Bar-Yam 2, 3 1 Faculty of Engineering Sciences Ben-Gurion University, P.O.Box 653 Beer-Sheva 84105, Israel

More information

How To Find Influence Between Two Concepts In A Network

How To Find Influence Between Two Concepts In A Network 2014 UKSim-AMSS 16th International Conference on Computer Modelling and Simulation Influence Discovery in Semantic Networks: An Initial Approach Marcello Trovati and Ovidiu Bagdasar School of Computing

More information

Practical Graph Mining with R. 5. Link Analysis

Practical Graph Mining with R. 5. Link Analysis Practical Graph Mining with R 5. Link Analysis Outline Link Analysis Concepts Metrics for Analyzing Networks PageRank HITS Link Prediction 2 Link Analysis Concepts Link A relationship between two entities

More information

Hierarchical organization in complex networks

Hierarchical organization in complex networks PHYSICAL REVIEW E 67, 026112 2003 Hierarchical organization in complex networks Erzsébet Ravasz and Albert-László Barabási Department of Physics, 225 Nieuwland Science Hall, University of Notre Dame, Notre

More information

Social Network Analysis

Social Network Analysis Social Network Analysis Challenges in Computer Science April 1, 2014 Frank Takes (ftakes@liacs.nl) LIACS, Leiden University Overview Context Social Network Analysis Online Social Networks Friendship Graph

More information

IC05 Introduction on Networks &Visualization Nov. 2009. <mathieu.bastian@gmail.com>

IC05 Introduction on Networks &Visualization Nov. 2009. <mathieu.bastian@gmail.com> IC05 Introduction on Networks &Visualization Nov. 2009 Overview 1. Networks Introduction Networks across disciplines Properties Models 2. Visualization InfoVis Data exploration

More information

ModelingandSimulationofthe OpenSourceSoftware Community

ModelingandSimulationofthe OpenSourceSoftware Community ModelingandSimulationofthe OpenSourceSoftware Community Yongqin Gao, GregMadey Departmentof ComputerScience and Engineering University ofnotre Dame ygao,gmadey@nd.edu Vince Freeh Department of ComputerScience

More information

3.3 Patterns of infrequent interactions 3. PAIRWISE USER INTERACTIONS. 3.1 Data used. 3.2 Distribution of the number of wall posts

3.3 Patterns of infrequent interactions 3. PAIRWISE USER INTERACTIONS. 3.1 Data used. 3.2 Distribution of the number of wall posts On the Evolution of User Interaction in Facebook Bimal Viswanath Alan Mislove Meeyoung Cha Krishna P. Gummadi Max Planck Institute for Software Systems (MPI-SWS) Rice University Kaiserslautern/Saarbrücken,

More information

An Alternative Web Search Strategy? Abstract

An Alternative Web Search Strategy? Abstract An Alternative Web Search Strategy? V.-H. Winterer, Rechenzentrum Universität Freiburg (Dated: November 2007) Abstract We propose an alternative Web search strategy taking advantage of the knowledge on

More information

Scale-free user-network approach to telephone network traffic analysis

Scale-free user-network approach to telephone network traffic analysis Scale-free user-network approach to telephone network traffic analysis Yongxiang Xia,* Chi K. Tse, WaiM.Tam, Francis C. M. Lau, and Michael Small Department of Electronic and Information Engineering, Hong

More information

School of Computer Science Carnegie Mellon Graph Mining, self-similarity and power laws

School of Computer Science Carnegie Mellon Graph Mining, self-similarity and power laws Graph Mining, self-similarity and power laws Christos Faloutsos University Overview Achievements global patterns and laws (static/dynamic) generators influence propagation communities; graph partitioning

More information

Towards Modelling The Internet Topology The Interactive Growth Model

Towards Modelling The Internet Topology The Interactive Growth Model Towards Modelling The Internet Topology The Interactive Growth Model Shi Zhou (member of IEEE & IEE) Department of Electronic Engineering Queen Mary, University of London Mile End Road, London, E1 4NS

More information

Graph Mining and Social Network Analysis

Graph Mining and Social Network Analysis Graph Mining and Social Network Analysis Data Mining and Text Mining (UIC 583 @ Politecnico di Milano) References Jiawei Han and Micheline Kamber, "Data Mining: Concepts and Techniques", The Morgan Kaufmann

More information

Bioinformatics: Network Analysis

Bioinformatics: Network Analysis Bioinformatics: Network Analysis Graph-theoretic Properties of Biological Networks COMP 572 (BIOS 572 / BIOE 564) - Fall 2013 Luay Nakhleh, Rice University 1 Outline Architectural features Motifs, modules,

More information

Social Media Mining. Network Measures

Social Media Mining. Network Measures Klout Measures and Metrics 22 Why Do We Need Measures? Who are the central figures (influential individuals) in the network? What interaction patterns are common in friends? Who are the like-minded users

More information

General Network Analysis: Graph-theoretic. COMP572 Fall 2009

General Network Analysis: Graph-theoretic. COMP572 Fall 2009 General Network Analysis: Graph-theoretic Techniques COMP572 Fall 2009 Networks (aka Graphs) A network is a set of vertices, or nodes, and edges that connect pairs of vertices Example: a network with 5

More information

Six Degrees of Separation in Online Society

Six Degrees of Separation in Online Society Six Degrees of Separation in Online Society Lei Zhang * Tsinghua-Southampton Joint Lab on Web Science Graduate School in Shenzhen, Tsinghua University Shenzhen, Guangdong Province, P.R.China zhanglei@sz.tsinghua.edu.cn

More information

Complex Networks Analysis: Clustering Methods

Complex Networks Analysis: Clustering Methods Complex Networks Analysis: Clustering Methods Nikolai Nefedov Spring 2013 ISI ETH Zurich nefedov@isi.ee.ethz.ch 1 Outline Purpose to give an overview of modern graph-clustering methods and their applications

More information

IJCSES Vol.7 No.4 October 2013 pp.165-168 Serials Publications BEHAVIOR PERDITION VIA MINING SOCIAL DIMENSIONS

IJCSES Vol.7 No.4 October 2013 pp.165-168 Serials Publications BEHAVIOR PERDITION VIA MINING SOCIAL DIMENSIONS IJCSES Vol.7 No.4 October 2013 pp.165-168 Serials Publications BEHAVIOR PERDITION VIA MINING SOCIAL DIMENSIONS V.Sudhakar 1 and G. Draksha 2 Abstract:- Collective behavior refers to the behaviors of individuals

More information

Cluster detection algorithm in neural networks

Cluster detection algorithm in neural networks Cluster detection algorithm in neural networks David Meunier and Hélène Paugam-Moisy Institute for Cognitive Science, UMR CNRS 5015 67, boulevard Pinel F-69675 BRON - France E-mail: {dmeunier,hpaugam}@isc.cnrs.fr

More information

Link Prediction Analysis in the Wikipedia Collaboration Graph

Link Prediction Analysis in the Wikipedia Collaboration Graph Link Prediction Analysis in the Wikipedia Collaboration Graph Ferenc Molnár Department of Physics, Applied Physics, and Astronomy Rensselaer Polytechnic Institute Troy, New York, 121 Email: molnaf@rpi.edu

More information

Dmitri Krioukov CAIDA/UCSD

Dmitri Krioukov CAIDA/UCSD Hyperbolic geometry of complex networks Dmitri Krioukov CAIDA/UCSD dima@caida.org F. Papadopoulos, M. Boguñá, A. Vahdat, and kc claffy Complex networks Technological Internet Transportation Power grid

More information

Network Theory: 80/20 Rule and Small Worlds Theory

Network Theory: 80/20 Rule and Small Worlds Theory Scott J. Simon / p. 1 Network Theory: 80/20 Rule and Small Worlds Theory Introduction Starting with isolated research in the early twentieth century, and following with significant gaps in research progress,

More information

Simulating the Effect of Privacy Concerns in Online Social Networks

Simulating the Effect of Privacy Concerns in Online Social Networks Simulating the Effect of Privacy Concerns in Online Social Networks Nathalie Baracaldo, Claudia López, Mohd Anwar, Michael Lewis Email: [nab62,cal95, manwar ] @pitt.edu, ml@sis.pitt.edu School of Information

More information

Online Estimating the k Central Nodes of a Network

Online Estimating the k Central Nodes of a Network Online Estimating the k Central Nodes of a Network Yeon-sup Lim, Daniel S. Menasché, Bruno Ribeiro, Don Towsley, and Prithwish Basu Department of Computer Science UMass Amherst, Raytheon BBN Technologies

More information

Visualization and Modeling of Structural Features of a Large Organizational Email Network

Visualization and Modeling of Structural Features of a Large Organizational Email Network Visualization and Modeling of Structural Features of a Large Organizational Email Network Benjamin H. Sims Statistical Sciences (CCS-6) Email: bsims@lanl.gov Nikolai Sinitsyn Physics of Condensed Matter

More information

Some questions... Graphs

Some questions... Graphs Uni Innsbruck Informatik - 1 Uni Innsbruck Informatik - 2 Some questions... Peer-to to-peer Systems Analysis of unstructured P2P systems How scalable is Gnutella? How robust is Gnutella? Why does FreeNet

More information

A SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS INTRODUCTION

A SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS INTRODUCTION A SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS Kyoungjin Park Alper Yilmaz Photogrammetric and Computer Vision Lab Ohio State University park.764@osu.edu yilmaz.15@osu.edu ABSTRACT Depending

More information

Routing on a weighted scale-free network

Routing on a weighted scale-free network Physica A 387 (2008) 4967 4972 Contents lists available at ScienceDirect Physica A journal homepage: www.elsevier.com/locate/physa Routing on a weighted scale-free network Mao-Bin Hu a,b,, Rui Jiang a,

More information

Do online networks play role? A case-study of. Russian protests

Do online networks play role? A case-study of. Russian protests Do online networks play role? A case-study of Russian protests Sofia Dokuka Center for the Study New Media and Society E-mail: sdokuka@nes.ru Abstract Online social networking sites are considered one

More information

WORKSHOP Analisi delle Reti Sociali per conoscere uno strumento uno strumento per conoscere

WORKSHOP Analisi delle Reti Sociali per conoscere uno strumento uno strumento per conoscere Università di Salerno WORKSHOP Analisi delle Reti Sociali per conoscere uno strumento uno strumento per conoscere The scientific collaboration network of the University of Salerno Michele La Rocca, Giuseppe

More information

AN INTRODUCTION TO SOCIAL NETWORK DATA ANALYTICS

AN INTRODUCTION TO SOCIAL NETWORK DATA ANALYTICS Chapter 1 AN INTRODUCTION TO SOCIAL NETWORK DATA ANALYTICS Charu C. Aggarwal IBM T. J. Watson Research Center Hawthorne, NY 10532 charu@us.ibm.com Abstract The advent of online social networks has been

More information

arxiv:1111.4503v1 [cs.si] 18 Nov 2011

arxiv:1111.4503v1 [cs.si] 18 Nov 2011 1 The Anatomy of the Facebook Social Graph Johan Ugander 1,2, Brian Karrer 1,3, Lars Backstrom 1, Cameron Marlow 1 1 Facebook, Palo Alto, CA, USA 2 Cornell University, Ithaca, NY, USA 3 University of Michigan,

More information

The Structure of an Autonomic Network

The Structure of an Autonomic Network doi:1.198/rspa.27.182 Published online Radial structure of the Internet BY PETTER HOLME 1, *, JOSH KARLIN 1 AND STEPHANIE FORREST 1,2 1 Department of Computer Science, University of New Mexico, Albuquerque,

More information

Detection of topological patterns in complex networks: correlation prole of the internet

Detection of topological patterns in complex networks: correlation prole of the internet Available online at www.sciencedirect.com Physica A (2004) 529 540 www.elsevier.com/locate/physa Detection of topological patterns in complex networks: correlation prole of the internet Sergei Maslov a;,

More information

arxiv:physics/0601033 v1 6 Jan 2006

arxiv:physics/0601033 v1 6 Jan 2006 Analysis of telephone network traffic based on a complex user network Yongxiang Xia, Chi K. Tse, Francis C. M. Lau, Wai Man Tam, Michael Small arxiv:physics/0601033 v1 6 Jan 2006 Department of Electronic

More information

The Shape of the Network. The Shape of the Internet. Why study topology? Internet topologies. Early work. More on topologies..

The Shape of the Network. The Shape of the Internet. Why study topology? Internet topologies. Early work. More on topologies.. The Shape of the Internet Slides assembled by Jeff Chase Duke University (thanks to and ) The Shape of the Network Characterizing shape : AS-level topology: who connects to whom Router-level topology:

More information

A discussion of Statistical Mechanics of Complex Networks P. Part I

A discussion of Statistical Mechanics of Complex Networks P. Part I A discussion of Statistical Mechanics of Complex Networks Part I Review of Modern Physics, Vol. 74, 2002 Small Word Networks Clustering Coefficient Scale-Free Networks Erdös-Rényi model cover only parts

More information

Characterizing and Modelling Clustering Features in AS-Level Internet Topology

Characterizing and Modelling Clustering Features in AS-Level Internet Topology Characterizing and Modelling Clustering Features in AS-Level Topology Yan Li, Jun-Hong Cui, Dario Maggiorini and Michalis Faloutsos yan.li@uconn.edu, jcui@engr.uconn.edu, dario@dico.unimi.it, michalis@cs.ucr.edu

More information

arxiv:physics/0505087 v1 12 May 2005

arxiv:physics/0505087 v1 12 May 2005 Fifteen Minutes of Fame: The Dynamics of Information Access on the Web Z. Dezső 1, E. Almaas 1, A. Lukács 2, B. Rácz 2, I. Szakadát 3, A.-L. Barabási 1 1.Center for Complex Network Research and Department

More information

Generating Hierarchically Modular Networks via Link Switching

Generating Hierarchically Modular Networks via Link Switching Generating Hierarchically Modular Networks via Link Switching Susan Khor ABSTRACT This paper introduces a method to generate hierarchically modular networks with prescribed node degree list by link switching.

More information

SOCIAL NETWORK ANALYSIS EVALUATING THE CUSTOMER S INFLUENCE FACTOR OVER BUSINESS EVENTS

SOCIAL NETWORK ANALYSIS EVALUATING THE CUSTOMER S INFLUENCE FACTOR OVER BUSINESS EVENTS SOCIAL NETWORK ANALYSIS EVALUATING THE CUSTOMER S INFLUENCE FACTOR OVER BUSINESS EVENTS Carlos Andre Reis Pinheiro 1 and Markus Helfert 2 1 School of Computing, Dublin City University, Dublin, Ireland

More information

Behavioral Entropy of a Cellular Phone User

Behavioral Entropy of a Cellular Phone User Behavioral Entropy of a Cellular Phone User Santi Phithakkitnukoon 1, Husain Husna, and Ram Dantu 3 1 santi@unt.edu, Department of Comp. Sci. & Eng., University of North Texas hjh36@unt.edu, Department

More information

An Analysis of Verifications in Microblogging Social Networks - Sina Weibo

An Analysis of Verifications in Microblogging Social Networks - Sina Weibo An Analysis of Verifications in Microblogging Social Networks - Sina Weibo Junting Chen and James She HKUST-NIE Social Media Lab Dept. of Electronic and Computer Engineering The Hong Kong University of

More information

Evolving Networks with Distance Preferences

Evolving Networks with Distance Preferences Evolving Networks with Distance Preferences Juergen Jost M. P. Joy SFI WORKING PAPER: 2002-07-030 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent

More information

The physics of networks

The physics of networks The physics of networks Mark Newman Statistical analysis of interconnected groups of computers, animals, or people yields important clues about how they function and even offers predictions of their future

More information

Information Flow and the Locus of Influence in Online User Networks: The Case of ios Jailbreak *

Information Flow and the Locus of Influence in Online User Networks: The Case of ios Jailbreak * Information Flow and the Locus of Influence in Online User Networks: The Case of ios Jailbreak * Nitin Mayande & Charles Weber Department of Engineering and Technology Management Portland State University

More information

Analysis of Topological Characteristics of Huge Online Social Networking Services

Analysis of Topological Characteristics of Huge Online Social Networking Services WWW 2007 / Trac: Semantic Web Session: Semantic Web and Web 2.0 Analysis of Topological Characteristics of Huge Online Social Networing Services Yong Yeol Ahn Department of Physics KAIST, Deajeon, Korea

More information

Group CRM: a New Telecom CRM Framework from Social Network Perspective

Group CRM: a New Telecom CRM Framework from Social Network Perspective Group CRM: a New Telecom CRM Framework from Social Network Perspective Bin Wu Beijing University of Posts and Telecommunications Beijing, China wubin@bupt.edu.cn Qi Ye Beijing University of Posts and Telecommunications

More information

Studying E-mail Graphs for Intelligence Monitoring and Analysis in the Absence of Semantic Information

Studying E-mail Graphs for Intelligence Monitoring and Analysis in the Absence of Semantic Information Studying E-mail Graphs for Intelligence Monitoring and Analysis in the Absence of Semantic Information Petros Drineas, Mukkai S. Krishnamoorthy, Michael D. Sofka Bülent Yener Department of Computer Science,

More information

How Placing Limitations on the Size of Personal Networks Changes the Structural Properties of Complex Networks

How Placing Limitations on the Size of Personal Networks Changes the Structural Properties of Complex Networks How Placing Limitations on the Size of Personal Networks Changes the Structural Properties of Complex Networks Somayeh Koohborfardhaghighi, Jörn Altmann Technology Management, Economics, and Policy Program

More information

Social Networks and Social Media

Social Networks and Social Media Social Networks and Social Media Social Media: Many-to-Many Social Networking Content Sharing Social Media Blogs Microblogging Wiki Forum 2 Characteristics of Social Media Consumers become Producers Rich

More information

Distance Degree Sequences for Network Analysis

Distance Degree Sequences for Network Analysis Universität Konstanz Computer & Information Science Algorithmics Group 15 Mar 2005 based on Palmer, Gibbons, and Faloutsos: ANF A Fast and Scalable Tool for Data Mining in Massive Graphs, SIGKDD 02. Motivation

More information

Department of Biological Sciences, National University of Singapore, Singapore

Department of Biological Sciences, National University of Singapore, Singapore 1 2 3 4 5 6 Extreme inequalities of citation counts in environmental sciences Deepthi Chimalakonda 1, Alex R. Cook 2, 3, L. Roman Carrasco 1,* 1 Department of Biological Sciences, National University of

More information

Exploring spatial decay effect in mass media and social media: a case study of China

Exploring spatial decay effect in mass media and social media: a case study of China Exploring spatial decay effect in mass media and social media: a case study of China Yihong Yuan Department of Geography, Texas State University, San Marcos, TX, USA, 78666. Tel: +1(512)-245-3208 Email:yuan@txtate.edu

More information

MINFS544: Business Network Data Analytics and Applications

MINFS544: Business Network Data Analytics and Applications MINFS544: Business Network Data Analytics and Applications March 30 th, 2015 Daning Hu, Ph.D., Department of Informatics University of Zurich F Schweitzer et al. Science 2009 Stop Contagious Failures in

More information

Analyzing the Facebook graph?

Analyzing the Facebook graph? Logistics Big Data Algorithmic Introduction Prof. Yuval Shavitt Contact: shavitt@eng.tau.ac.il Final grade: 4 6 home assignments (will try to include programing assignments as well): 2% Exam 8% Big Data

More information

A box-covering algorithm for fractal scaling in scale-free networks

A box-covering algorithm for fractal scaling in scale-free networks CHAOS 17, 026116 2007 A box-covering algorithm for fractal scaling in scale-free networks J. S. Kim CTP & FPRD, School of Physics and Astronomy, Seoul National University, NS50, Seoul 151-747, Korea K.-I.

More information