Modeling Dynamic Evolution of Online Friendship Network
|
|
- Oswald Hubbard
- 5 years ago
- Views:
Transcription
1 Commun. Theor. Phys. 58 (2012) Vol. 58, No. 4, October 15, 2012 Modeling Dynamic Evolution of Online Friendship Network WU Lian-Ren ( ) 1,2, and YAN Qiang ( Ö) 1 1 School of Economics and Management, Beijing University of Posts and Telecommunications, Beijing , China 2 Department of Electrical Engineering, Arizona State University, Tempe AZ, USA (Received May 2, 2012; revised manuscript received July 2, 2012) Abstract In this paper, we study the dynamic evolution of friendship network in SNS (Social Networking Site). Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has within the community, but also on the friendship network generated by those friends. In addition, we propose a model which is based on two processes: first, connecting nearest neighbors; second, strength driven attachment mechanism. The model reflects two facts: first, in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor; second, new nodes connect more likely to nodes which have larger weights and interactions, a phenomenon called strength driven attachment (also called weight driven attachment). From the simulation results, we find that degree distribution P(k), strength distribution P(s), and degree-strength correlation are all consistent with empirical data. PACS numbers: Hc, Kg, q Key words: friendship network, common neighbor, CNN, strength driven 1 Introduction The generation of communities and their development over time are the central research issues in the social sciences [1 4] political movements, professional organizations, and religious denominations all provide fundamental examples of such communities. In the era of internet, on-line groups are becoming increasingly prominent due to the growth of community and social networking sites such as Facebook and MySpace. However, the difficulty of collecting and analyzing large-scale timestamp data on social networks has posed some open questions about the evolution of social networks. What factors influence new individuals joining in communities? And what factors determine the growth of communities? Understanding the structure and dynamics of communities is a goal of network analysis. However, the analysis of dynamic communities is still in its infancy. Fortunato insisted that studies in this direction have been mostly hindered by the fact that the problem of graph clustering is already controversial on single graph realizations, so it is understandable that most efforts still concentrate on the static version of the problem. [4] Recently, the rapid development of data mining technology, has made collection of large-scale timestamp data become possible. So it has become possible to investigate how communities form, evolve, and die. Leskovec et al. presented a detailed study of network evolution by analyzing four large online social networks with temporal information about node and edge arrivals. [5] They have also investigated a wide variety of network formation strategies, and shown that edge locality plays a critical role in evolution of networks. Kumar et al. studied the evolution of large online social networks and presented a simple model of network growth. [6] Palla et al. performed a systematic analysis of dynamic communities. [7] They studied two social systems: a graph of phone calls between customers of a mobile phone company in a year s time and a collaboration network between scientists. Backstrom et al. have carried out an analysis of group dynamics in the free online community of LiveJournal and in a co-authorship network of computer scientists. [8] They have found that the probability that an individual joins a community grows with the number of friends/co-authors who are already in the community and with their degree of interconnectedness. In order to investigate the communities generate mechanisms, some models have been proposed. Such as DEB model, which proposed by Davidsen, Ebel, and Bornholdt. [9] The basic assumption of their model is that the evolution of social connections is mainly determined by the creation of new relations between pairs of individuals with a common friend. Vazquez proposed CNN (Connecting Nearest Neighbors) model, suggesting that in social networks it is more probable that two nodes with a common neighbor get connected than two nodes chosen at random. [10] Yuta et al. proposed CNNR model, which based on two processes: connecting nearest neighbors with Supported by Program for New Centurty Excellent Talents in University under Grant No. NCET , and the Fundamental Research Funds for the Central Universities under Grant No. 2012RC1002 Corresponding author, lianrenw@asu.edu c 2011 Chinese Physical Society and IOP Publishing Ltd
2 600 Communications in Theoretical Physics Vol. 58 apparently random linkage. [11] Rudolf et al. presented a detailed analysis of the CNN model by Vazquez. [12] They have also shown that the degree distribution follows a power law, but the scaling exponent can vary with the parameter setting. In this paper, we use the data from Renren Network which is the largest real-name social networking site in China. By observing user s social interaction, we study the formation and evolution of local friendship networks. Furthermore, we propose a model and show that the model can explain some statistical properties including long-tail degree distribution and degree-strength correlation. In Sec. 2, we describe the data and present the basic statistic results. In Sec. 3, we propose a simple model with connecting nearest neighbors and strength-driven attachment, which we refer to as CNNSD. Then we perform numerical simulation of the model and show that it can explain the statistical properties. Section 4 is the conclusion. 2 Social Networking Site and Dataset The Renren Network, formerly known as Xiaonei Network (literally on-campus network ), is a Chinese social networking service that is similar to Facebook. It is popular among college students in China. In April 2011, Renren made an announcement that it had a total of 31 million active monthly users. Renren Network provides an arena on the internet, where millions of people are creating personal pages. After the registration, people communicate with each other by sending messages and thus grow up friendship. Renren has actively collaborated with academic researchers to understand the growth and structure of its user community. Jiang et al. studied the Renren social graph structure, and found it similar to prior studies of Facebook s social graph. [13] There are some kinds of activities on Renren, such as visiting friends homepages, blogging, voting and sharing others blogs. Here, we focus on the activities of visiting interaction (referred to as the interaction). We study 272 students of the School of Economics and Management in the BUPT (Beijing University of Posts and Telecommunications), they are all Renren users. The data set we consider is the interactions record between these 272 Renren users and their friends in Renren network. In more than two years, users received a total of 787,631 visits. For each visitation, the timestamp and visitor were recorded. For each user i, the number of visits who received is marked as strength s i and the number of friends is marked as degree k i. Basic analysis of dataset, we find that the degree distribution and strength distribution of friendship network follow power laws. In addition, we find that the correlation of degree k and strength s is linear in log-log scale (Figs. 1 3). The friendship network comprises nodes. Fig. 1 The distribution of degree P(k). Fig. 2 The distribution of strength P(s). Fig. 3 The correlation of degree k and strength s. 3 Model and Simulation CNNSD Model (Connecting nearest neighbors with the strength driven attachment mechanism) In order to investigate the formation and evolution of local friendship network, we propose a CNNSD model. The model reflects two facts: first, in the social network it
3 No. 4 Communications in Theoretical Physics 601 is a universal phenomenon that two nodes are connected when they have at least one common neighbor; second, new nodes connect more likely to nodes, which have larger weights and interactions, a phenomenon called strength driven attachment. [14 17] The model dynamics starts from an initial seed of N 0 nodes connected by random links, and iteratively performs the following. (i) With probability 1 u, add a new node in the network. Create a link from the new node to a previously existing node i according to the probability distribution s i / j s j. At the same time, create a set of potential edges from the new node to all the neighbors of node i. (ii) With probability u convert one potential edge selected at random into an edge. CNN Model (Connecting Nearest Neighbors model) The CNN model has been inspired by social networks. [10] It is assumed that in such networks two nodes with a common neighbor are connected with greater probability then two randomly chosen nodes. [6,8,10,14] An analytical understanding of the CNN model has been achieved using the notions of potential edges and potential degree. According to Ref. [10], a potential edge is defined as follows: two nodes are connected by a potential edge, if they are not connected by an edge and they have at least one common neighbor. The network dynamics will be defined by the transition rates between the three possible states: disconnected (d), potential edge (p), or an edge (e). For each node i has the set of transition rates: ν x y (i); x, y {d, p, e}. Consider a network with N nodes. We can write the rate equations for the evolution of the number of nodes with degree k and potential degree k. [12] k i N = ν d eˆk i + ν p e k i (ν e d + ν e p )k i, (1) k i N = ν d pˆk i + ν e p k i (ν p d + ν p e )k i, (2) ˆk i = N k i k i, (3) ν x y is the transition rate from state x to state y per unit of N and ˆk i is the number of remaining neighbors, which are not connected by a potential edge or by an edge to node i. If a new nodei is connected to an existing node j then a potential edge is created between i and all neighbors of j. Hence ν d p = ν d e k i, ν p d = ν e d k i. In order to simplify Eqs. (1) (3), Vazquez and Rudolf were introduced several assumptions: [10,12] (i) All processes leading to edge deletion are neglected: ν e p = ν e d = 0. (ii) The transition from a potential edge to an edge has a higher probability of occurrence than the transition from being disconnected to an edge ν p e = µ 1 N, ν d e = µ 0 N 2, where µ 1 > 0 and µ 0 > 0 are constants. Under these approximations the system of Eqs. (1) (3) is reduced to N k i N = µ 0 + µ 1 ki, With solution where N k i N = µ 0k i µ 1 k i. k i (N) = k 0 ( N N i ) β, k i (N) = k 0( N N i ) β, β = µ [ ( µ ) ] 0. 2 µ 1 The degree distribution of the system is therefore power law with the exponent. [10,12] γ = β. Simulation Research In the model, we adopt the parameters as the following: u = 0.5, N 0 = 200 and final network size N = The results are averaged over 10 independent realizations. From the simulation results (Figs. 4 6), we find that degree distribution P(k), strength distribution P(s), and degree-strength correlation are all consistent with empirical data. Fig. 4 The distribution of degree P(k). Fig. 5 The distribution of strength P(s).
4 602 Communications in Theoretical Physics Vol. 58 such as weight. [16 17] Using the same way, we fix parameters u = 200, N = 10 5 and let N 0 = 100, N 0 = 200, N 0 = 500, N 0 = 100 respectively. We find that all the exponents did not change. However, clustering coefficient of the network has changed significantly (Fig. 8). Finally, we generate a small friendship network by the proposed model. Network parameters are u = 0.5, N 0 = 10, network size N = 50 (Fig. 9). We can see that most nodes displaying star structure. There have many edges joining nodes of the same community and comparatively few edges joining nodes of different communities. Fig. 6 The correlation of degree k and strength s. Fig. 9 Schematic of friendship networks. Fig. 7 Degree distribution for different values of u, N 0 = 200, N = 10 5, and the results average over 10 independent realizations. Fig. 8 The clustering coefficient depends on the parameter N 0. In order to analyze the influence of parameter u, we fix parameters N 0 = 200, N = 10 5 and let the parameter u = 0.3, u = 0.5, u = 0.7 respectively. We find that only the exponents of degree distribution changed (Fig. 7) and the addition rate u just control the nodes degree. The exponent of strength distribution depends on other factors, 4 Conclusion In recent years, many models have been proposed for the evolution of complex networks. These models are typically advanced in order to reproduce statistical network properties observed in real-world data. In this paper, we investigate the formation and evolution of local friendship networks. In particular, we analyze the structure and evolution of communities, which have different size. We find that the prominent community structure is stars, a common feature of online social networks. This phenomenon indicates that local relation plays a critical role in the evolution of communities. Based on these empirical observations, we propose a model, which is an extension of CNN model. [10] The model reflects two facts: first, in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor; second, new nodes connect more likely to nodes, which have larger weights and interactions, a phenomenon called strength driven attachment. [14 17] The numerical results show that degree distribution P(k), strength distribution P(s), and degree-strength correlation are all consistent with empirical data. Therefore, our present model will demonstrate its applications in the modeling of online social networks.
5 No. 4 Communications in Theoretical Physics 603 References [1] E. Ravasz and A.L. Barabasi, Phys. Rev. E 67 (2003) [2] R. Albert and A.L. Barabasi, Rev. Mod. Phys. 74 (2002) 47. [3] G. Kossinets and D.J. Watts, Science 311 (2006) 88. [4] S. Fortunato, Phys. Reports 486 (2010) 75. [5] J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins, Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM press, New York (2008) p. 9. [6] R. Kumar, J. Novak, and A. Tomkins, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM press, New York (2006) p. 7. [7] G. Palla, A.L. Barabasi, and T. Vicsek, Nature (London) 446 (2007) 664. [8] L. Backstrom, D. Huttenlocher, J. Kleinberg, and X.Y. Lan, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM press, New York (2006) p. 11. [9] J. Davidsen, H. Ebel, and S. Bornholdt, Phys. Rev. Lett. 88 (2002) [10] A. Vazquez, Phys. Rev. E 67 (2003) [11] K. Yuta, N. Ono, and Y. Fujiwara, eprint physics / [12] B. Rudolf, Phys. Rev. E 85 (2012) [13] J. Jiang, C. Wilson, X. Wang, P. Huang, W.P. Sha, Y.F. Dai, and B.Y. Zhao, Proc. of Internet Measurement Conference (IMC), Melbourne, Australia (2010). [14] M.E.J. Newman, Phys. Rev. E 64 (2001) (R). [15] L.H. Dufresne, A. Allard, V. Marceau, P.A. Noel, and L.J. Dube, Phys. Rev. Lett. 107 (2011) [16] A. Barrat, M. Barthelemy, and A. Vespignani, Phys. Rev. Lett. 92 (2004) [17] W.X. Wang, B.H. Wang, B. Hu, G. Yan, and Q. Ou, Phys. Rev. Lett. 94 (2005)
arxiv:physics/ v1 9 Jun 2006
Weighted Networ of Chinese Nature Science Basic Research Jian-Guo Liu, Zhao-Guo Xuan, Yan-Zhong Dang, Qiang Guo 2, and Zhong-Tuo Wang Institute of System Engineering, Dalian University of Technology, Dalian
More informationarxiv:cond-mat/ v1 [cond-mat.dis-nn] 4 May 2000
Topology of evolving networks: local events and universality arxiv:cond-mat/0005085v1 [cond-mat.dis-nn] 4 May 2000 Réka Albert and Albert-László Barabási Department of Physics, University of Notre-Dame,
More informationModeling population growth in online social networks
Zhu et al. Complex Adaptive Systems Modeling 3, :4 RESEARCH Open Access Modeling population growth in online social networks Konglin Zhu *,WenzhongLi, and Xiaoming Fu *Correspondence: zhu@cs.uni-goettingen.de
More informationOpinion Dynamics on Triad Scale Free Network
Opinion Dynamics on Triad Scale Free Network Li Qianqian 1 Liu Yijun 1,* Tian Ruya 1,2 Ma Ning 1,2 1 Institute of Policy and Management, Chinese Academy of Sciences, Beijing 100190, China lqqcindy@gmail.com,
More informationDeterministic scale-free networks
Physica A 299 (2001) 559 564 www.elsevier.com/locate/physa Deterministic scale-free networks Albert-Laszlo Barabasi a;, Erzsebet Ravasz a, Tamas Vicsek b a Department of Physics, College of Science, University
More informationSpatial and Temporal Behaviors in a Modified Evolution Model Based on Small World Network
Commun. Theor. Phys. (Beijing, China) 42 (2004) pp. 242 246 c International Academic Publishers Vol. 42, No. 2, August 15, 2004 Spatial and Temporal Behaviors in a Modified Evolution Model Based on Small
More informationPhase Transitions of an Epidemic Spreading Model in Small-World Networks
Commun. Theor. Phys. 55 (2011) 1127 1131 Vol. 55, No. 6, June 15, 2011 Phase Transitions of an Epidemic Spreading Model in Small-World Networks HUA Da-Yin (Ù ) and GAO Ke (Ô ) Department of Physics, Ningbo
More informationOptimal contact process on complex networks
Optimal contact process on complex networks Rui Yang, 1 Tao Zhou, 2,3 Yan-Bo Xie, 2 Ying-Cheng Lai, 1,4 and Bing-Hong Wang 2 1 Department of Electrical Engineering, Arizona State University, Tempe, Arizona
More informationarxiv: v1 [physics.soc-ph] 15 Dec 2009
Power laws of the in-degree and out-degree distributions of complex networks arxiv:0912.2793v1 [physics.soc-ph] 15 Dec 2009 Shinji Tanimoto Department of Mathematics, Kochi Joshi University, Kochi 780-8515,
More informationA Modified Earthquake Model Based on Generalized Barabási Albert Scale-Free
Commun. Theor. Phys. (Beijing, China) 46 (2006) pp. 1011 1016 c International Academic Publishers Vol. 46, No. 6, December 15, 2006 A Modified Earthquake Model Based on Generalized Barabási Albert Scale-Free
More informationSmall-world structure of earthquake network
Small-world structure of earthquake network Sumiyoshi Abe 1 and Norikazu Suzuki 2 1 Institute of Physics, University of Tsukuba, Ibaraki 305-8571, Japan 2 College of Science and Technology, Nihon University,
More informationSMALL-WORLD NAVIGABILITY. Alexandru Seminar in Distributed Computing
SMALL-WORLD NAVIGABILITY Talk about a small world 2 Zurich, CH Hunedoara, RO From cliché to social networks 3 Milgram s Experiment and The Small World Hypothesis Omaha, NE Boston, MA Wichita, KS Human
More informationPhysica A. Opinion formation in a social network: The role of human activity
Physica A 388 (2009) 961 966 Contents lists available at ScienceDirect Physica A journal homepage: www.elsevier.com/locate/physa Opinion formation in a social network: The role of human activity Andrzej
More information6.207/14.15: Networks Lecture 12: Generalized Random Graphs
6.207/14.15: Networks Lecture 12: Generalized Random Graphs 1 Outline Small-world model Growing random networks Power-law degree distributions: Rich-Get-Richer effects Models: Uniform attachment model
More informationEvolution of a social network: The role of cultural diversity
PHYSICAL REVIEW E 73, 016135 2006 Evolution of a social network: The role of cultural diversity A. Grabowski 1, * and R. A. Kosiński 1,2, 1 Central Institute for Labour Protection National Research Institute,
More informationThe network growth model that considered community information
1 1 1 1 CNN The network growth model that considered community information EIJI MIYOSHI, 1 IKUO SUZUKI, 1 MASAHITO YAMAMOTO 1 and MASASHI FURUKAWA 1 There is a study of much network model, but, as for
More informationEvolving network with different edges
Evolving network with different edges Jie Sun, 1,2 Yizhi Ge, 1,3 and Sheng Li 1, * 1 Department of Physics, Shanghai Jiao Tong University, Shanghai, China 2 Department of Mathematics and Computer Science,
More informationUnderstanding Social Characteristic from Spatial Proximity in Mobile Social Network
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL ISSN 1841-9836, 10(4):539-550, August, 2015. Understanding Social Characteristic from Spatial Proximity in Mobile Social Network D. Hu, B. Huang,
More informationSynchronization and Bifurcation Analysis in Coupled Networks of Discrete-Time Systems
Commun. Theor. Phys. (Beijing, China) 48 (2007) pp. 871 876 c International Academic Publishers Vol. 48, No. 5, November 15, 2007 Synchronization and Bifurcation Analysis in Coupled Networks of Discrete-Time
More informationEvolutionary Games on Networks. Wen-Xu Wang and G Ron Chen Center for Chaos and Complex Networks
Evolutionary Games on Networks Wen-Xu Wang and G Ron Chen Center for Chaos and Complex Networks Email: wenxuw@gmail.com; wxwang@cityu.edu.hk Cooperative behavior among selfish individuals Evolutionary
More informationUniversal dependence of distances on nodes degrees in complex networks
Universal dependence of distances on nodes degrees in complex networs Janusz A. Hołyst, Julian Sieniewicz, Agata Froncza, Piotr Froncza, Krzysztof Sucheci and Piotr Wójcici Faculty of Physics and Center
More informationAn evolving network model with community structure
INSTITUTE OF PHYSICS PUBLISHING JOURNAL OF PHYSICS A: MATHEMATICAL AND GENERAL J. Phys. A: Math. Gen. 38 (2005) 9741 9749 doi:10.1088/0305-4470/38/45/002 An evolving network model with community structure
More informationStability and topology of scale-free networks under attack and defense strategies
Stability and topology of scale-free networks under attack and defense strategies Lazaros K. Gallos, Reuven Cohen 2, Panos Argyrakis, Armin Bunde 3, and Shlomo Havlin 2 Department of Physics, University
More informationMutual selection model for weighted networks
Mutual selection model for weighted networks Wen-Xu Wang, Bo Hu, Tao Zhou, Bing-Hong Wang,* and Yan-Bo Xie Nonlinear Science Center and Department of Modern Physics, University of Science and Technology
More informationAverage Range and Network Synchronizability
Commun. Theor. Phys. (Beijing, China) 53 (2010) pp. 115 120 c Chinese Physical Society and IOP Publishing Ltd Vol. 53, No. 1, January 15, 2010 Average Range and Network Synchronizability LIU Chao ( ),
More informationNonlinear Dynamical Behavior in BS Evolution Model Based on Small-World Network Added with Nonlinear Preference
Commun. Theor. Phys. (Beijing, China) 48 (2007) pp. 137 142 c International Academic Publishers Vol. 48, No. 1, July 15, 2007 Nonlinear Dynamical Behavior in BS Evolution Model Based on Small-World Network
More informationOn Resolution Limit of the Modularity in Community Detection
The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 492 499 On Resolution imit of the
More informationA LINE GRAPH as a model of a social network
A LINE GRAPH as a model of a social networ Małgorzata Krawczy, Lev Muchni, Anna Mańa-Krasoń, Krzysztof Kułaowsi AGH Kraów Stern School of Business of NY University outline - ideas, definitions, milestones
More informationarxiv: v1 [physics.soc-ph] 23 May 2010
Dynamics on Spatial Networks and the Effect of Distance Coarse graining An Zeng, Dong Zhou, Yanqing Hu, Ying Fan, Zengru Di Department of Systems Science, School of Management and Center for Complexity
More informationModels of Communication Dynamics for Simulation of Information Diffusion
Models of Communication Dynamics for Simulation of Information Diffusion Konstantin Mertsalov, Malik Magdon-Ismail, Mark Goldberg Rensselaer Polytechnic Institute Department of Computer Science 11 8th
More informationLink Prediction. Eman Badr Mohammed Saquib Akmal Khan
Link Prediction Eman Badr Mohammed Saquib Akmal Khan 11-06-2013 Link Prediction Which pair of nodes should be connected? Applications Facebook friend suggestion Recommendation systems Monitoring and controlling
More informationUniversality of Competitive Networks in Complex Networks
J Syst Sci Complex (2015) 28: 546 558 Universality of Competitive Networks in Complex Networks GUO Jinli FAN Chao JI Yali DOI: 10.1007/s11424-015-3045-0 Received: 27 February 2013 / Revised: 18 December
More informationECS 253 / MAE 253, Lecture 15 May 17, I. Probability generating function recap
ECS 253 / MAE 253, Lecture 15 May 17, 2016 I. Probability generating function recap Part I. Ensemble approaches A. Master equations (Random graph evolution, cluster aggregation) B. Network configuration
More informationLecture VI Introduction to complex networks. Santo Fortunato
Lecture VI Introduction to complex networks Santo Fortunato Plan of the course I. Networks: definitions, characteristics, basic concepts in graph theory II. III. IV. Real world networks: basic properties
More informationSelf-organized scale-free networks
Self-organized scale-free networks Kwangho Park and Ying-Cheng Lai Departments of Electrical Engineering, Arizona State University, Tempe, Arizona 85287, USA Nong Ye Department of Industrial Engineering,
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu Non-overlapping vs. overlapping communities 11/10/2010 Jure Leskovec, Stanford CS224W: Social
More informationAttack Strategies on Complex Networks
Attack Strategies on Complex Networks Lazaros K. Gallos 1, Reuven Cohen 2, Fredrik Liljeros 3, Panos Argyrakis 1, Armin Bunde 4, and Shlomo Havlin 5 1 Department of Physics, University of Thessaloniki,
More informationarxiv:physics/ v1 [physics.soc-ph] 14 Dec 2006
Europhysics Letters PREPRINT Growing network with j-redirection arxiv:physics/0612148v1 [physics.soc-ph] 14 Dec 2006 R. Lambiotte 1 and M. Ausloos 1 1 SUPRATECS, Université de Liège, B5 Sart-Tilman, B-4000
More informationTriadic closure as a basic generating mechanism of communities in complex networks.
Triadic closure as a basic generating mechanism of communities in complex networks. Bianconi, G; Darst, RK; Iacovacci, J; Fortunato, S For additional information about this publication click this link.
More informationProjective synchronization of a complex network with different fractional order chaos nodes
Projective synchronization of a complex network with different fractional order chaos nodes Wang Ming-Jun( ) a)b), Wang Xing-Yuan( ) a), and Niu Yu-Jun( ) a) a) School of Electronic and Information Engineering,
More informationEmpirical analysis of dependence between stations in Chinese railway network
Published in "Physica A 388(14): 2949-2955, 2009" which should be cited to refer to this work. Empirical analysis of dependence between stations in Chinese railway network Yong-Li Wang a, Tao Zhou b,c,
More informationarxiv:physics/ v2 [physics.soc-ph] 9 Feb 2007
Europhysics Letters PREPRINT Growing network with j-redirection arxiv:physics/0612148v2 [physics.soc-ph] 9 Feb 2007 R. Lambiotte 1 and M. Ausloos 1 1 GRAPES, Université de Liège, B5 Sart-Tilman, B-4000
More information6.207/14.15: Networks Lecture 7: Search on Networks: Navigation and Web Search
6.207/14.15: Networks Lecture 7: Search on Networks: Navigation and Web Search Daron Acemoglu and Asu Ozdaglar MIT September 30, 2009 1 Networks: Lecture 7 Outline Navigation (or decentralized search)
More informationCS224W: Analysis of Networks Jure Leskovec, Stanford University
CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/30/17 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu 2
More informationMinimum spanning trees of weighted scale-free networks
EUROPHYSICS LETTERS 15 October 2005 Europhys. Lett., 72 (2), pp. 308 314 (2005) DOI: 10.1209/epl/i2005-10232-x Minimum spanning trees of weighted scale-free networks P. J. Macdonald, E. Almaas and A.-L.
More informationarxiv:cond-mat/ v1 [cond-mat.dis-nn] 8 Jun 2004
Exploring complex networks by walking on them Shi-Jie Yang Department of Physics, Beijing Normal University, Beijing 100875, China (February 2, 2008) arxiv:cond-mat/0406177v1 [cond-mat.dis-nn] 8 Jun 2004
More informationRenormalization group analysis of the small-world network model
6 December 999 Physics Letters A 63 999 34 346 www.elsevier.nlrlocaterphysleta Renormalization group analysis of the small-world network model M.E.J. Newman ), D.J. Watts Santa Fe Institute, 399 Hyde Park
More informationGreedy Search in Social Networks
Greedy Search in Social Networks David Liben-Nowell Carleton College dlibenno@carleton.edu Joint work with Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, and Andrew Tomkins. IPAM, Los Angeles 8 May 2007
More informationEvolution of Cooperation in Evolutionary Games for Heterogeneous Interactions
Commun. Theor. Phys. 57 (2012) 547 552 Vol. 57, No. 4, April 15, 2012 Evolution of Cooperation in Evolutionary Games for Heterogeneous Interactions QIAN Xiao-Lan ( ) 1, and YANG Jun-Zhong ( ) 2 1 School
More informationErzsébet Ravasz Advisor: Albert-László Barabási
Hierarchical Networks Erzsébet Ravasz Advisor: Albert-László Barabási Introduction to networks How to model complex networks? Clustering and hierarchy Hierarchical organization of cellular metabolism The
More informationObservation theory of moving objects
1 3 4 PHYSICS ESSAYS 4, 1 011 Observation theory of moving objects Zifeng Li a Department of Petroleum Engineering, Yanshan University, Qinhuangdao, Hebei 066004, China Received 1 January 010; accepted
More informationDiscovering Urban Spatial-Temporal Structure from Human Activity Patterns
ACM SIGKDD International Workshop on Urban Computing (UrbComp 2012) Discovering Urban Spatial-Temporal Structure from Human Activity Patterns Shan Jiang, shanjang@mit.edu Joseph Ferreira, Jr., jf@mit.edu
More informationarxiv:cond-mat/ v2 [cond-mat.stat-mech] 3 Oct 2005
Growing Directed Networks: Organization and Dynamics arxiv:cond-mat/0408391v2 [cond-mat.stat-mech] 3 Oct 2005 Baosheng Yuan, 1 Kan Chen, 1 and Bing-Hong Wang 1,2 1 Department of Computational cience, Faculty
More informationSocial and Technological Network Analysis. Lecture 11: Spa;al and Social Network Analysis. Dr. Cecilia Mascolo
Social and Technological Network Analysis Lecture 11: Spa;al and Social Network Analysis Dr. Cecilia Mascolo In This Lecture In this lecture we will study spa;al networks and geo- social networks through
More informationarxiv: v2 [physics.soc-ph] 23 Sep 2015
, Dynamic Patterns of Academic Forum Activities arxiv:1505.08159v2 [physics.soc-ph] 23 Sep 2015 Zhi-Dan Zhao 1,2, Ya-Chun Gao 3, Shi-Min Cai 1,2, and Tao Zhou 1, 1 CompleX Lab, Web Sciences Center, University
More informationSocial Networks- Stanley Milgram (1967)
Complex Networs Networ is a structure of N nodes and 2M lins (or M edges) Called also graph in Mathematics Many examples of networs Internet: nodes represent computers lins the connecting cables Social
More informationposter presented at: Complex Networks: from Biology to Information Technology Pula (CA), Italy, July 2-6, 2007
poster presented at: Complex Networks: from Biology to Information Technology Pula (CA), Italy, July 2-6, 2007 What network analysis can reveal about tourism destinations Rodolfo Baggio Master in Economics
More informationModelling self-organizing networks
Paweł Department of Mathematics, Ryerson University, Toronto, ON Cargese Fall School on Random Graphs (September 2015) Outline 1 Introduction 2 Spatial Preferred Attachment (SPA) Model 3 Future work Multidisciplinary
More informationGrowing scale-free small-world networks with tunable assortative coefficient
ARTICLE IN RESS hysica A 371 (2006) 814 822 www.elsevier.com/locate/physa Growing scale-free small-world networks with tunable assortative coefficient Qiang Guo a,, Tao Zhou b, Jian-Guo Liu c, Wen-Jie
More informationCombining Geographic and Network Analysis: The GoMore Rideshare Network. Kate Lyndegaard
Combining Geographic and Network Analysis: The GoMore Rideshare Network Kate Lyndegaard 10.15.2014 Outline 1. Motivation 2. What is network analysis? 3. The project objective 4. The GoMore network 5. The
More informationInfo-Cluster Based Regional Influence Analysis in Social Networks
Info-Cluster Based Regional Influence Analysis in Social Networks Chao Li,2,3, Zhongying Zhao,2,3,JunLuo, and Jianping Fan Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen
More informationarxiv: v1 [physics.soc-ph] 27 Dec 2013
Spatially embedded growing small-world networks arxiv:1312.7165v1 [physics.soc-ph] 27 Dec 2013 Ari Zitin, 1 Alex Gorowara, 1 Shane Squires, 1, 2 1, 2, 3 Mark Herrera, Thomas M. Antonsen, 1, 2, 4 Michelle
More informationMeasuring the shape of degree distributions
Measuring the shape of degree distributions Dr Jennifer Badham Visiting Fellow SEIT, UNSW Canberra research@criticalconnections.com.au Overview Context What does shape mean for degree distribution Why
More informationAnalysis & Generative Model for Trust Networks
Analysis & Generative Model for Trust Networks Pranav Dandekar Management Science & Engineering Stanford University Stanford, CA 94305 ppd@stanford.edu ABSTRACT Trust Networks are a specific kind of social
More informationGrowing a Network on a Given Substrate
Growing a Network on a Given Substrate 1 Babak Fotouhi and Michael G. Rabbat Department of Electrical and Computer Engineering McGill University, Montréal, Québec, Canada Email: babak.fotouhi@mail.mcgill.ca,
More informationTime varying networks and the weakness of strong ties
Supplementary Materials Time varying networks and the weakness of strong ties M. Karsai, N. Perra and A. Vespignani 1 Measures of egocentric network evolutions by directed communications In the main text
More informationWeb Structure Mining Nodes, Links and Influence
Web Structure Mining Nodes, Links and Influence 1 Outline 1. Importance of nodes 1. Centrality 2. Prestige 3. Page Rank 4. Hubs and Authority 5. Metrics comparison 2. Link analysis 3. Influence model 1.
More informationNetworks as a tool for Complex systems
Complex Networs Networ is a structure of N nodes and 2M lins (or M edges) Called also graph in Mathematics Many examples of networs Internet: nodes represent computers lins the connecting cables Social
More informationKristina Lerman USC Information Sciences Institute
Rethinking Network Structure Kristina Lerman USC Information Sciences Institute Università della Svizzera Italiana, December 16, 2011 Measuring network structure Central nodes Community structure Strength
More informationSelf-organized Criticality in a Modified Evolution Model on Generalized Barabási Albert Scale-Free Networks
Commun. Theor. Phys. (Beijing, China) 47 (2007) pp. 512 516 c International Academic Publishers Vol. 47, No. 3, March 15, 2007 Self-organized Criticality in a Modified Evolution Model on Generalized Barabási
More informationarxiv:physics/ v3 [physics.soc-ph] 28 Jan 2007
arxiv:physics/0603229v3 [physics.soc-ph] 28 Jan 2007 Graph Evolution: Densification and Shrinking Diameters Jure Leskovec School of Computer Science, Carnegie Mellon University, Pittsburgh, PA Jon Kleinberg
More informationRTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs Leman Akoglu Mary McGlohon Christos Faloutsos Carnegie Mellon University, School of Computer Science {lakoglu, mmcgloho, christos}@cs.cmu.edu
More informationVirgili, Tarragona (Spain) Roma (Italy) Zaragoza, Zaragoza (Spain)
Int.J.Complex Systems in Science vol. 1 (2011), pp. 47 54 Probabilistic framework for epidemic spreading in complex networks Sergio Gómez 1,, Alex Arenas 1, Javier Borge-Holthoefer 1, Sandro Meloni 2,3
More informationSpectral Analysis of Directed Complex Networks. Tetsuro Murai
MASTER THESIS Spectral Analysis of Directed Complex Networks Tetsuro Murai Department of Physics, Graduate School of Science and Engineering, Aoyama Gakuin University Supervisors: Naomichi Hatano and Kenn
More informationFinding central nodes in large networks
Finding central nodes in large networks Nelly Litvak University of Twente Eindhoven University of Technology, The Netherlands Woudschoten Conference 2017 Complex networks Networks: Internet, WWW, social
More informationGroups of vertices and Core-periphery structure. By: Ralucca Gera, Applied math department, Naval Postgraduate School Monterey, CA, USA
Groups of vertices and Core-periphery structure By: Ralucca Gera, Applied math department, Naval Postgraduate School Monterey, CA, USA Mostly observed real networks have: Why? Heavy tail (powerlaw most
More informationNetwork skeleton for synchronization: Identifying redundant connections Cheng-Jun Zhang, An Zeng highlights Published in
Published in which should be cited to refer to this work. Network skeleton for synchronization: Identifying redundant connections Cheng-Jun Zhang, An Zeng Institute of Information Economy, Alibaba Business
More informationExact solution of site and bond percolation. on small-world networks. Abstract
Exact solution of site and bond percolation on small-world networks Cristopher Moore 1,2 and M. E. J. Newman 2 1 Departments of Computer Science and Physics, University of New Mexico, Albuquerque, New
More informationMeasurement of Burst Topic in Microblog
, pp.16-20 http://dx.doi.org/10.14257/astl.2014.78.04 Measurement of Burst Topic in Microblog Guozhong Dong 1, Xin Zou 2*, Wei Wang 1, Yaxue Hu 1, Guowei Shen 1, Korawit Orkphol 1,Wu Yang 1 1 Information
More informationSupporting Statistical Hypothesis Testing Over Graphs
Supporting Statistical Hypothesis Testing Over Graphs Jennifer Neville Departments of Computer Science and Statistics Purdue University (joint work with Tina Eliassi-Rad, Brian Gallagher, Sergey Kirshner,
More informationDiversity-optimized cooperation on complex networks
Diversity-optimized cooperation on complex networks Han-Xin Yang, 1 Wen-Xu Wang, 2 Zhi-Xi Wu, 3 Ying-Cheng Lai, 2,4 and Bing-Hong Wang 1,5 1 Department of Modern Physics, University of Science and Technology
More informationInteract with Strangers
Interact with Strangers RATE: Recommendation-aware Trust Evaluation in Online Social Networks Wenjun Jiang 1, 2, Jie Wu 2, and Guojun Wang 1 1. School of Information Science and Engineering, Central South
More informationTHE EMERGENCE AND EVOLUTION OF COOPERATION ON COMPLEX NETWORKS
International Journal of Bifurcation and Chaos, Vol. 22, No. 9 (2012) 1250228 (8 pages) c World Scientific Publishing Company DOI: 10.1142/S0218127412502288 THE EMERGENCE AND EVOLUTION OF COOPERATION ON
More informationModel for cascading failures with adaptive defense in complex networks
Model for cascading failures with adaptive defense in complex networks Hu Ke( 胡柯 ), Hu Tao( 胡涛 ) and Tang Yi( 唐翌 ) Department of Physics and Institute of Modern Physics, Xiangtan University, Xiangtan 411105,
More informationSocio-spatial Properties of Online Location-based Social Networks
Socio-spatial Properties of Online Location-based Social Networks Salvatore Scellato Computer Laboratory University of Cambridge salvatore.scellato@cam.ac.uk Renaud Lambiotte Deparment of Mathematics Imperial
More informationSnowballing Effects in Preferential Attachment: The Impact of The Initial Links
Snowballing Effects in Preferential Attachment: The Impact of The Initial Links Huanyang Zheng and Jie Wu Department of Computer and Information Sciences, Temple University, USA Email: {huanyang.zheng,
More informationOscillations of complex networks
Oscillations of complex networks Xingang Wang, 1,2,3 Ying-Cheng Lai, 4 and Choy Heng Lai 1,2 1 Department of Physics, National University of Singapore, 117542, Singapore 2 Beijing-Hong Kong-Singapore Joint
More informationFriends or Foes: Detecting Dishonest Recommenders in Online Social Networks
Friends or Foes: Detecting Dishonest Recommenders in Online Social Networks Yongkun Li, John C.S. Lui Department of Computer Science & Engineering, The Chinese University of Hong Kong Email: {ykli, cslui}@cse.cuhk.edu.hk
More informationBeating Social Pulse: Understanding Information Propagation via Online Social Tagging Systems 1
Journal of Universal Computer Science, vol. 18, no. 8 (2012, 1022-1031 submitted: 16/9/11, accepted: 14/12/11, appeared: 28/4/12 J.UCS Beating Social Pulse: Understanding Information Propagation via Online
More informationELEC6910Q Analytics and Systems for Social Media and Big Data Applications Lecture 3 Centrality, Similarity, and Strength Ties
ELEC6910Q Analytics and Systems for Social Media and Big Data Applications Lecture 3 Centrality, Similarity, and Strength Ties Prof. James She james.she@ust.hk 1 Last lecture 2 Selected works from Tutorial
More informationSupplementary Information Activity driven modeling of time varying networks
Supplementary Information Activity driven modeling of time varying networks. Perra, B. Gonçalves, R. Pastor-Satorras, A. Vespignani May 11, 2012 Contents 1 The Model 1 1.1 Integrated network......................................
More informationDegree Distribution: The case of Citation Networks
Network Analysis Degree Distribution: The case of Citation Networks Papers (in almost all fields) refer to works done earlier on same/related topics Citations A network can be defined as Each node is
More informationTemporal patterns in information and social systems
Temporal patterns in information and social systems Matúš Medo University of Fribourg, Switzerland COST Workshop Quantifying scientific impact: networks, measures, insights? 12-13 February, 2015, Zurich
More informationInferring Friendship from Check-in Data of Location-Based Social Networks
Inferring Friendship from Check-in Data of Location-Based Social Networks Ran Cheng, Jun Pang, Yang Zhang Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Luxembourg
More informationCSI 445/660 Part 3 (Networks and their Surrounding Contexts)
CSI 445/660 Part 3 (Networks and their Surrounding Contexts) Ref: Chapter 4 of [Easley & Kleinberg]. 3 1 / 33 External Factors ffecting Network Evolution Homophily: basic principle: We tend to be similar
More informationAdventures in random graphs: Models, structures and algorithms
BCAM January 2011 1 Adventures in random graphs: Models, structures and algorithms Armand M. Makowski ECE & ISR/HyNet University of Maryland at College Park armand@isr.umd.edu BCAM January 2011 2 LECTURE
More informationDiffusion of information and social contagion
Diffusion of information and social contagion Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics
More informationMS&E 233 Lecture 9 & 10: Network models
MS&E 233 Lecture 9 & 10: Networ models Ashish Goel, scribed by Riley Matthews April 30, May 2 Review: Application of PR to Netflix movie suggestions Client x: relm 1 ǫ # of users who lied m m: i lies m
More informationUniversal robustness characteristic of weighted networks against cascading failure
PHYSICAL REVIEW E 77, 06101 008 Universal robustness characteristic of weighted networks against cascading failure Wen-Xu Wang* and Guanrong Chen Department of Electronic Engineering, City University of
More informationMóstoles, Spain. Keywords: complex networks, dual graph, line graph, line digraph.
Int. J. Complex Systems in Science vol. 1(2) (2011), pp. 100 106 Line graphs for directed and undirected networks: An structural and analytical comparison Regino Criado 1, Julio Flores 1, Alejandro García
More information