The network growth model that considered community information

Size: px
Start display at page:

Download "The network growth model that considered community information"

Transcription

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 the most, a network grows up only by the state of the node that is the component of the network. However, the real network growth takes the influence by the community. In this study, We suggest the growth model that added community information to a rule of the growth of the network. In addition, with a change of the community structure by the network generation that applied suggestion technique. We observe a change by the progress about quantity of characteristic to numbers of increase and decrease of the number of the community, clustering origin in time and we compare the suggestion model with CNN model about the growth process of the network. 1. web CNN 1) Connecting Nearest Neighbor CNN 1) DEB 2) CNN V = v i, E = e ij ( 1 ) u(0 u 1) ( 2 ) 1 Graduate School of Information Science and Technology,Hokkaido University 1 c 2009 Information Processing Society of Japan

2 ( a ) 1 u v j V v i v i V v i v j v i ( b ) u 2.2 Modularity Aaron Clauset 3) Modularity Q Modularity V l a l V l V m M e lm Q = Q i = (e ii a 2 i ) (1) i 1...I i 1...I 2.3 Clauset Newman Moore (CNM) Clauset 3) Modularity Q ( 1 ) 1 Q Q (i+j) = Q i + Q j + 2e ij 2a i a j (2) Q ij = 2(e ij a ia j) ( 2 ) i, j i, j k Q Q ik + Q jk : if k connected with i, j Q jk = Q ik 2a ja k : if k connected with i Q jk 2a i a k : if k connected with j (3) ( 3 ) Q CNM CNM Modularity 2.4 Clauset LocalModul- arity:r 4) R R G = (N, E) C G C C U G C U B G ( 1 ) B 1 : v i, v j B ij = v i, v j B 0 : B LocalModularity R Bijδ(i, j) ij R = = I T ij B ij δ(i, j) v i B v j C 1 0 T B I B U Clauset 4) 1 LocalModularity C ( 1 ) v 0 C B v 0 v 0 U ( 2 ) C ( 3 ) v j U R j (4) (5) 2 c 2009 Information Processing Society of Japan

3 1 4) 2 ( 4 ) R j v j C v j U ( 5 ) R B R j 5 6 R j = x Ry z(1 = R) T z + y x v j B y v j C T (k j x) z v j C T 3. CNN CNN 3 CNN Modularity GN, 5) NF 6) GN (6) Clauset LocalModularity CNN ( 1 ) 3 c 2009 Information Processing Society of Japan

4 ( 2 ) ( a ) 1 u v i ( i ) v i (LC) 2.4 ( ii ) v j ( iii ) v j ( 2.4 ) ( b ) u CNN R < Modularrity : Q 4.2 CNN, 3 µ Modularity CNN Modularity CNM 3 Modularity :CNN : Modularity CNN 2 Modularity Modularity CNM CNN Modularity Modularity CNN 3 Modularity 5 CNN CNN 4 c 2009 Information Processing Society of Japan

5 4 :CNN : (c) 6 µ = 0.1 µ = 0.5 (c)µ = :CNN : 6 7 µ = c 2009 Information Processing Society of Japan

6 7 µ = 0.9 Localmodularity 6, 1) Vázquez, A.: Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations, Phys. Rev. E, Vol.67, No.5, p (2003). 2) Davidsen, J., Ebel, H. and Bornholdt, S.: Emergence of a Small World from Local Interactions: Modeling Acquaintance Networks, Phys. Rev. Lett., Vol.88, No.12, p (2002). 3) Clauset, A., Newman, M. E.J. and Moore, C.: Finding community structure in very large networks, Phys. Rev. E, Vol.70, No.6, p (2004). 4) Clauset, A.: Finding local community structure in networks, Phys. Rev. E, Vol.72, No.2, p (2005). 5) Girvan, M. and Newman, M. E.: Community structure in social and biological networks., Proc Natl Acad Sci U S A, Vol.99, No.12, pp (2002). 6) Newman, M. E.J.: Fast algorithm for detecting community structure in networks, Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), Vol.69, No.6 (2004). 5., 6 c 2009 Information Processing Society of Japan

Chaos, Complexity, and Inference (36-462)

Chaos, Complexity, and Inference (36-462) Chaos, Complexity, and Inference (36-462) Lecture 21 Cosma Shalizi 3 April 2008 Models of Networks, with Origin Myths Erdős-Rényi Encore Erdős-Rényi with Node Types Watts-Strogatz Small World Graphs Exponential-Family

More information

Chaos, Complexity, and Inference (36-462)

Chaos, Complexity, and Inference (36-462) Chaos, Complexity, and Inference (36-462) Lecture 21: More Networks: Models and Origin Myths Cosma Shalizi 31 March 2009 New Assignment: Implement Butterfly Mode in R Real Agenda: Models of Networks, with

More information

On Resolution Limit of the Modularity in Community Detection

On 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 information

Evolution of a social network: The role of cultural diversity

Evolution 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 information

Network models: random graphs

Network models: random graphs Network models: random graphs Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Structural Analysis

More information

Modeling Dynamic Evolution of Online Friendship Network

Modeling Dynamic Evolution of Online Friendship Network Commun. Theor. Phys. 58 (2012) 599 603 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,

More information

Link Prediction. Eman Badr Mohammed Saquib Akmal Khan

Link 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 information

Triadic closure as a basic generating mechanism of communities in complex networks.

Triadic 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 information

The Trouble with Community Detection

The Trouble with Community Detection The Trouble with Community Detection Aaron Clauset Santa Fe Institute 7 April 2010 Nonlinear Dynamics of Networks Workshop U. Maryland, College Park Thanks to National Science Foundation REU Program James

More information

Modularity in several random graph models

Modularity in several random graph models Modularity in several random graph models Liudmila Ostroumova Prokhorenkova 1,3 Advanced Combinatorics and Network Applications Lab Moscow Institute of Physics and Technology Moscow, Russia Pawe l Pra

More information

Groups 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 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 information

Networks as a tool for Complex systems

Networks 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 information

An evolving network model with community structure

An 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 information

Deterministic scale-free networks

Deterministic 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 information

arxiv: v1 [physics.soc-ph] 27 Dec 2013

arxiv: 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 information

Causality and communities in neural networks

Causality and communities in neural networks Causality and communities in neural networks Leonardo Angelini, Daniele Marinazzo, Mario Pellicoro, Sebastiano Stramaglia TIRES-Center for Signal Detection and Processing - Università di Bari, Bari, Italy

More information

Mutual selection model for weighted networks

Mutual 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 information

Modularity and Graph Algorithms

Modularity and Graph Algorithms Modularity and Graph Algorithms David Bader Georgia Institute of Technology Joe McCloskey National Security Agency 12 July 2010 1 Outline Modularity Optimization and the Clauset, Newman, and Moore Algorithm

More information

Erzsébet Ravasz Advisor: Albert-László Barabási

Erzsé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 information

Social Networks- Stanley Milgram (1967)

Social 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 information

arxiv:physics/ v1 [physics.soc-ph] 11 Mar 2005

arxiv:physics/ v1 [physics.soc-ph] 11 Mar 2005 arxiv:physics/0503099v1 [physics.soc-ph] 11 Mar 2005 Public transport systems in Poland: from Bia lystok to Zielona Góra by bus and tram using universal statistics of complex networks Julian Sienkiewicz

More information

A Modified Earthquake Model Based on Generalized Barabási Albert Scale-Free

A 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 information

Measuring the shape of degree distributions

Measuring 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 information

Emerging communities in networks a flow of ties

Emerging communities in networks a flow of ties Emerging communities in networks a flow of ties Małgorzata J. Krawczyk, Przemysław Gawroński, Krzysztof Kułakowski Complex Systems Group Faculty of Physics and Applied Computer Science AGH University of

More information

arxiv:physics/ v1 9 Jun 2006

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 information

Stability and topology of scale-free networks under attack and defense strategies

Stability 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 information

A Modified Method Using the Bethe Hessian Matrix to Estimate the Number of Communities

A Modified Method Using the Bethe Hessian Matrix to Estimate the Number of Communities Journal of Advanced Statistics, Vol. 3, No. 2, June 2018 https://dx.doi.org/10.22606/jas.2018.32001 15 A Modified Method Using the Bethe Hessian Matrix to Estimate the Number of Communities Laala Zeyneb

More information

arxiv: v1 [physics.soc-ph] 15 Dec 2009

arxiv: 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 information

Physica A. Opinion formation in a social network: The role of human activity

Physica 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 information

6.207/14.15: Networks Lecture 12: Generalized Random Graphs

6.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 information

Community detection in time-dependent, multiscale, and multiplex networks

Community detection in time-dependent, multiscale, and multiplex networks Community detection in time-dependent, multiscale, and multiplex networks P. J. Mucha, T. Richardson, K. Macon, M. A. Porter, J.-P. Onnela Jukka-Pekka Onnela Harvard University MERSIH, November 13, 2009

More information

Spectral Analysis of Directed Complex Networks. Tetsuro Murai

Spectral 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 information

arxiv: v1 [physics.soc-ph] 20 Oct 2010

arxiv: v1 [physics.soc-ph] 20 Oct 2010 arxiv:00.098v [physics.soc-ph] 20 Oct 200 Spectral methods for the detection of network community structure: A comparative analysis Hua-Wei Shen and Xue-Qi Cheng Institute of Computing Technology, Chinese

More information

Opinion Dynamics on Triad Scale Free Network

Opinion 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 information

Random matrix analysis of complex networks

Random matrix analysis of complex networks Random matrix analysis of complex networks Sarika Jalan and Jayendra N. Bandyopadhyay Max-Planck Institute for the Physics of Complex Systems, Nöthnitzerstr. 38, D-87 Dresden, Germany Continuing our random

More information

Structure of Mutualistic Complex Networks

Structure of Mutualistic Complex Networks Structure of Mutualistic Complex Networks Jun Kyung Hwang, Seong Eun Maeng, Moon Yong Cha, and Jae Woo Lee Department of Physics, Inha University, Incheon 42-751 Korea jaewlee@inha.ac.kr http://statmech.inha.ac.kr

More information

THE EMERGENCE AND EVOLUTION OF COOPERATION ON COMPLEX NETWORKS

THE 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 information

arxiv:cond-mat/ v1 [cond-mat.dis-nn] 4 May 2000

arxiv: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 information

Complex networks: an introduction

Complex networks: an introduction Alain Barrat Complex networks: an introduction CPT, Marseille, France ISI, Turin, Italy http://www.cpt.univ-mrs.fr/~barrat http://cxnets.googlepages.com Plan of the lecture I. INTRODUCTION II. I. Networks:

More information

Learning latent structure in complex networks

Learning latent structure in complex networks Learning latent structure in complex networks Lars Kai Hansen www.imm.dtu.dk/~lkh Current network research issues: Social Media Neuroinformatics Machine learning Joint work with Morten Mørup, Sune Lehmann

More information

Tipping Points of Diehards in Social Consensus on Large Random Networks

Tipping Points of Diehards in Social Consensus on Large Random Networks Tipping Points of Diehards in Social Consensus on Large Random Networks W. Zhang, C. Lim, B. Szymanski Abstract We introduce the homogeneous pair approximation to the Naming Game (NG) model, establish

More information

Community structure in complex networks. Santo Fortunato

Community structure in complex networks. Santo Fortunato Community structure in complex networks Santo Fortunato Me in a nutshell Computational Social Science Networks Science of Science Computational social science Science of science - c P(c/c) Agricultural

More information

Shlomo Havlin } Anomalous Transport in Scale-free Networks, López, et al,prl (2005) Bar-Ilan University. Reuven Cohen Tomer Kalisky Shay Carmi

Shlomo Havlin } Anomalous Transport in Scale-free Networks, López, et al,prl (2005) Bar-Ilan University. Reuven Cohen Tomer Kalisky Shay Carmi Anomalous Transport in Complex Networs Reuven Cohen Tomer Kalisy Shay Carmi Edoardo Lopez Gene Stanley Shlomo Havlin } } Bar-Ilan University Boston University Anomalous Transport in Scale-free Networs,

More information

Graph Alignment and Biological Networks

Graph Alignment and Biological Networks Graph Alignment and Biological Networks Johannes Berg http://www.uni-koeln.de/ berg Institute for Theoretical Physics University of Cologne Germany p.1/12 Networks in molecular biology New large-scale

More information

Data science with multilayer networks: Mathematical foundations and applications

Data science with multilayer networks: Mathematical foundations and applications Data science with multilayer networks: Mathematical foundations and applications CDSE Days University at Buffalo, State University of New York Monday April 9, 2018 Dane Taylor Assistant Professor of Mathematics

More information

arxiv:physics/ v1 [physics.soc-ph] 14 Dec 2006

arxiv: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 information

ECS 253 / MAE 253, Lecture 15 May 17, I. Probability generating function recap

ECS 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 information

Asymptotic Modularity of some Graph Classes

Asymptotic Modularity of some Graph Classes Asymptotic Modularity of some Graph Classes Fabien de Montgolfier 1, Mauricio Soto 1, and Laurent Viennot 2 1 LIAFA, UMR 7089 CNRS - Université Paris Diderot. 2 INRIA and Université Paris Diderot fm@liafa.jussieu.fr

More information

Partition-Merge: Distributed Inference and Modularity Optimization

Partition-Merge: Distributed Inference and Modularity Optimization Partition-Merge: Distributed Inference and Modularity Optimization Vincent Blondel Universite Catholique de Louvain, Belgium Kyomin Jung Seoul National University, South Korea Pushmeet Kohli DeepMind,

More information

Lecture VI Introduction to complex networks. Santo Fortunato

Lecture 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 information

Application of random matrix theory to microarray data for discovering functional gene modules

Application of random matrix theory to microarray data for discovering functional gene modules Application of random matrix theory to microarray data for discovering functional gene modules Feng Luo, 1 Jianxin Zhong, 2,3, * Yunfeng Yang, 4 and Jizhong Zhou 4,5, 1 Department of Computer Science,

More information

CS224W: Analysis of Networks Jure Leskovec, Stanford University

CS224W: 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 information

Phylogenetic trees 07/10/13

Phylogenetic trees 07/10/13 Phylogenetic trees 07/10/13 A tree is the only figure to occur in On the Origin of Species by Charles Darwin. It is a graphical representation of the evolutionary relationships among entities that share

More information

An Application of Integer Linear Programming in Network Analysis

An Application of Integer Linear Programming in Network Analysis An Application of Integer Linear Programming in Network Analysis A Report on joint work with William Y.C.Chen and Winking Q.Yu from the Center for Combinatorics, LPMC, Nankai University, Tianjin 300071,

More information

Multislice community detection

Multislice community detection Multislice community detection P. J. Mucha, T. Richardson, K. Macon, M. A. Porter, J.-P. Onnela Jukka-Pekka JP Onnela Harvard University NetSci2010, MIT; May 13, 2010 Outline (1) Background (2) Multislice

More information

Cluster Analysis of Gene Expression Microarray Data. BIOL 495S/ CS 490B/ MATH 490B/ STAT 490B Introduction to Bioinformatics April 8, 2002

Cluster Analysis of Gene Expression Microarray Data. BIOL 495S/ CS 490B/ MATH 490B/ STAT 490B Introduction to Bioinformatics April 8, 2002 Cluster Analysis of Gene Expression Microarray Data BIOL 495S/ CS 490B/ MATH 490B/ STAT 490B Introduction to Bioinformatics April 8, 2002 1 Data representations Data are relative measurements log 2 ( red

More information

[11] [3] [1], [12] HITS [4] [2] k-means[9] 2 [11] [3] [6], [13] 1 ( ) k n O(n k ) 1 2

[11] [3] [1], [12] HITS [4] [2] k-means[9] 2 [11] [3] [6], [13] 1 ( ) k n O(n k ) 1 2 情報処理学会研究報告 1,a) 1 1 2 IT Clustering by Clique Enumeration and Data Cleaning like Method Abstract: Recent development on information technology has made bigdata analysis more familiar in research and industrial

More information

Network landscape from a Brownian particle s perspective

Network landscape from a Brownian particle s perspective Network landscape from a Brownian particle s perspective Haijun Zhou Max-Planck-Institute of Colloids and Interfaces, 14424 Potsdam, Germany Received 22 August 2002; revised manuscript received 13 January

More information

When are networks truly modular?

When are networks truly modular? Physica D 224 (2006) 20 26 www.elsevier.com/locate/physd When are networks truly modular? Jörg Reichardt, Stefan Bornholdt Institute for Theoretical Physics, University of Bremen, Otto-Hahn-Allee, 28359

More information

arxiv: v1 [stat.me] 2 Mar 2015

arxiv: v1 [stat.me] 2 Mar 2015 Statistics Surveys Vol. 0 (2006) 1 8 ISSN: 1935-7516 Two samples test for discrete power-law distributions arxiv:1503.00643v1 [stat.me] 2 Mar 2015 Contents Alessandro Bessi IUSS Institute for Advanced

More information

SMALL-WORLD NAVIGABILITY. Alexandru Seminar in Distributed Computing

SMALL-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 information

Universality of Competitive Networks in Complex Networks

Universality 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 information

Overview of Network Theory

Overview of Network Theory Overview of Network Theory MAE 298, Spring 2009, Lecture 1 Prof. Raissa D Souza University of California, Davis Example social networks (Immunology; viral marketing; aliances/policy) M. E. J. Newman The

More information

Relations Between Adjacency And Modularity Graph Partitioning: Principal Component Analysis vs. Modularity Component Analysis

Relations Between Adjacency And Modularity Graph Partitioning: Principal Component Analysis vs. Modularity Component Analysis Relations Between Adjacency And Modularity Graph Partitioning: Principal Component Analysis vs. Modularity Component Analysis Hansi Jiang Carl Meyer North Carolina State University October 27, 2015 1 /

More information

Universal dependence of distances on nodes degrees in complex networks

Universal 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 information

arxiv: v1 [nlin.cg] 23 Sep 2010

arxiv: v1 [nlin.cg] 23 Sep 2010 Complex networks derived from cellular automata Yoshihiko Kayama Department of Media and Information, BAIKA Women s University, 2-9-5, Shukuno-sho, Ibaraki-city, Osaka-pref., Japan arxiv:009.4509v [nlin.cg]

More information

arxiv:cond-mat/ v2 [cond-mat.stat-mech] 29 Apr 2008

arxiv:cond-mat/ v2 [cond-mat.stat-mech] 29 Apr 2008 Self-similarity in Fractal and Non-fractal Networks arxiv:cond-mat/0605587v2 [cond-mat.stat-mech] 29 Apr 2008 J. S. Kim, B. Kahng, and D. Kim Center for Theoretical Physics & Frontier Physics Research

More information

CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University

CS224W: 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 information

A LINE GRAPH as a model of a social network

A 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 information

Small-world communication of residues and significance for protein dynamics

Small-world communication of residues and significance for protein dynamics Running Title: Residues organize into a small world Small-world communication of residues and significance for protein dynamics Ali Rana Atilgan, Pelin Akan, 2 and Canan Baysal 2 School of Engineering,

More information

Nearest Correlation Louvain Method for Fast and Good Selection of Input Variables of Statistical Model

Nearest Correlation Louvain Method for Fast and Good Selection of Input Variables of Statistical Model Preprints of the 9th International Symposium on Advanced Control of Chemical Processes The International Federation of Automatic Control MoM3.6 Nearest Correlation Louvain Method for Fast and Good Selection

More information

Small-world structure of earthquake network

Small-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 information

Complex Networks, Course 303A, Spring, Prof. Peter Dodds

Complex Networks, Course 303A, Spring, Prof. Peter Dodds Complex Networks, Course 303A, Spring, 2009 Prof. Peter Dodds Department of Mathematics & Statistics University of Vermont Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License.

More information

The architecture of complexity: the structure and dynamics of complex networks.

The architecture of complexity: the structure and dynamics of complex networks. SMR.1656-36 School and Workshop on Structure and Function of Complex Networks 16-28 May 2005 ------------------------------------------------------------------------------------------------------------------------

More information

arxiv:physics/ v2 [physics.soc-ph] 9 Feb 2007

arxiv: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 information

Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network

Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network Michael Hinczewski Feza Gürsey Research Institute, TÜBİTAK, Bosphorus University, Çengelköy

More information

The Critical Point of k-clique Percolation in the Erd ós Rényi Graph

The Critical Point of k-clique Percolation in the Erd ós Rényi Graph Journal of Statistical Physics, Vol. 128, Nos. 1/2, July 2007 ( C 2007 ) DOI: 10.1007/s10955-006-9184-x The Critical Point of k-clique Percolation in the Erd ós Rényi Graph Gergely Palla, 1,2 Imre Derényi

More information

Meeting Strangers and Friends of Friends: How Random are Social Networks?

Meeting Strangers and Friends of Friends: How Random are Social Networks? Meeting Strangers and Friends of Friends: How Random are Social Networks? Matthew O. Jackson and Brian W. Rogers * 0 May 2004 Revised: October 27, 2006 Forthcoming, American Economic Review Abstract We

More information

arxiv: v2 [physics.soc-ph] 13 Jun 2009

arxiv: v2 [physics.soc-ph] 13 Jun 2009 Alternative approach to community detection in networks A.D. Medus and C.O. Dorso Departamento de Física, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabellón 1, Ciudad Universitaria,

More information

A Dynamical Method to Extract Communities Induced by Low or Middle-degree Nodes

A Dynamical Method to Extract Communities Induced by Low or Middle-degree Nodes A Dynamical Method to Extract Communities Induced by Low or Middle-degree Nodes Junhua Zhang,, Zhi-Ping Liu,, Xiang-Sun Zhang, and Luonan Chen, Key Laboratory of Random Complex Structures and Data Science,

More information

Self-organized scale-free networks

Self-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 information

Supplementary Information for Enhancing synchronization stability in a multi-area power grid

Supplementary Information for Enhancing synchronization stability in a multi-area power grid Supplementary Information for Enhancing synchronization stability in a multi-area power grid Bing Wang, 1, 2, Hideyuki Suzuki, 3 and Kazuyuki Aihara 2 1 School of Computer Engineering and Science, Shanghai

More information

Empirical analysis of dependence between stations in Chinese railway network

Empirical 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 information

The non-backtracking operator

The non-backtracking operator The non-backtracking operator Florent Krzakala LPS, Ecole Normale Supérieure in collaboration with Paris: L. Zdeborova, A. Saade Rome: A. Decelle Würzburg: J. Reichardt Santa Fe: C. Moore, P. Zhang Berkeley:

More information

arxiv:cond-mat/ v1 28 Feb 2005

arxiv:cond-mat/ v1 28 Feb 2005 How to calculate the main characteristics of random uncorrelated networks Agata Fronczak, Piotr Fronczak and Janusz A. Hołyst arxiv:cond-mat/0502663 v1 28 Feb 2005 Faculty of Physics and Center of Excellence

More information

Self-organized Criticality in a Modified Evolution Model on Generalized Barabási Albert Scale-Free Networks

Self-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 information

A HYPOTHESIS TESTING FRAMEWORK FOR MODULARITY BASED NETWORK COMMUNITY DETECTION

A HYPOTHESIS TESTING FRAMEWORK FOR MODULARITY BASED NETWORK COMMUNITY DETECTION Statistica Sinica 27 (2017), 000-000 437-456 doi:http://dx.doi.org/10.5705/ss.202015.0040 A HYPOTHESIS TESTING FRAMEWORK FOR MODULARITY BASED NETWORK COMMUNITY DETECTION Jingfei Zhang and Yuguo Chen University

More information

Social and Technological Network Analysis. Lecture 4: Modularity and Overlapping Dr. Cecilia Mascolo

Social and Technological Network Analysis. Lecture 4: Modularity and Overlapping Dr. Cecilia Mascolo Social and Technological Network Analysis Lecture 4: Modularity and Overlapping Communi@es Dr. Cecilia Mascolo In This Lecture We will describe the concept of Modularity and Modularity Op@miza@on. We will

More information

Machine Learning in Simple Networks. Lars Kai Hansen

Machine Learning in Simple Networks. Lars Kai Hansen Machine Learning in Simple Networs Lars Kai Hansen www.imm.dtu.d/~lh Outline Communities and lin prediction Modularity Modularity as a combinatorial optimization problem Gibbs sampling Detection threshold

More information

arxiv:q-bio/ v1 [q-bio.pe] 24 May 2004

arxiv:q-bio/ v1 [q-bio.pe] 24 May 2004 Effects of neighbourhood size and connectivity on the spatial Continuous Prisoner s Dilemma arxiv:q-bio/0405018v1 [q-bio.pe] 24 May 2004 Margarita Ifti a,d Timothy Killingback b Michael Doebeli c a Department

More information

Consensus seeking on moving neighborhood model of random sector graphs

Consensus seeking on moving neighborhood model of random sector graphs Consensus seeking on moving neighborhood model of random sector graphs Mitra Ganguly School of Physical Sciences, Jawaharlal Nehru University, New Delhi, India Email: gangulyma@rediffmail.com Timothy Eller

More information

CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University

CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu Intro sessions to SNAP C++ and SNAP.PY: SNAP.PY: Friday 9/27, 4:5 5:30pm in Gates B03 SNAP

More information

arxiv:cond-mat/ v1 2 Jan 2003

arxiv:cond-mat/ v1 2 Jan 2003 Topology of the World Trade Web M a Ángeles Serrano and Marián Boguñá Departament de Física Fonamental, Universitat de Barcelona, Av. Diagonal 647, 08028 Barcelona, Spain (Dated: July 9, 2004) arxiv:cond-mat/0301015

More information

Long Term Evolution of Networks CS224W Final Report

Long Term Evolution of Networks CS224W Final Report Long Term Evolution of Networks CS224W Final Report Jave Kane (SUNET ID javekane), Conrad Roche (SUNET ID conradr) Nov. 13, 2014 Introduction and Motivation Many studies in social networking and computer

More information

1 Complex Networks - A Brief Overview

1 Complex Networks - A Brief Overview Power-law Degree Distributions 1 Complex Networks - A Brief Overview Complex networks occur in many social, technological and scientific settings. Examples of complex networks include World Wide Web, Internet,

More information

Lecture 10. Under Attack!

Lecture 10. Under Attack! Lecture 10 Under Attack! Science of Complex Systems Tuesday Wednesday Thursday 11.15 am 12.15 pm 11.15 am 12.15 pm Feb. 26 Feb. 27 Feb. 28 Mar.4 Mar.5 Mar.6 Mar.11 Mar.12 Mar.13 Mar.18 Mar.19 Mar.20 Mar.25

More information

ECS 289 F / MAE 298, Lecture 15 May 20, Diffusion, Cascades and Influence

ECS 289 F / MAE 298, Lecture 15 May 20, Diffusion, Cascades and Influence ECS 289 F / MAE 298, Lecture 15 May 20, 2014 Diffusion, Cascades and Influence Diffusion and cascades in networks (Nodes in one of two states) Viruses (human and computer) contact processes epidemic thresholds

More information

Spiking Neural P Systems and Modularization of Complex Networks from Cortical Neural Network to Social Networks

Spiking Neural P Systems and Modularization of Complex Networks from Cortical Neural Network to Social Networks Spiking Neural P Systems and Modularization of Complex Networks from Cortical Neural Network to Social Networks Adam Obtu lowicz Institute of Mathematics, Polish Academy of Sciences Śniadeckich 8, P.O.B.

More information

6.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 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 information

On Defining and Computing Communities

On Defining and Computing Communities Proceedings of the Eighteenth Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia On Defining and Computing Communities Martin Olsen AU Herning Aarhus University Birk Centerpark

More information