A LINE GRAPH as a model of a social network

Size: px
Start display at page:

Download "A LINE GRAPH as a model of a social network"

Transcription

1 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

2 outline - ideas, definitions, milestones - line graphs - LiveJournal data R. Albert ea, Nature 46, (27 July 2)

3 Floor-level networing is often staged to loo lie friendly socializing. Nevertheless, it has an instrumental goal: useful contacts. Every networer nows this, so the instrumentality is not latent. It is not completely manifest, either. I presume that there is a mutual implicit contract of not breeching the situation by stating the instrumental goal aloud. The getting of contacts is a conscious but tacit function of socializing. Juha Klemelä, Turu University Managing Mixed Emotions in the Layered Ritual Reality of Networing Events, XVII ISA World Congress of Sociology, Gothenburg, -7 July 2

4 4

5 Cambridge UP, 994 5

6 b. 97 B.Sc. in physics Ph.D. in theoretical and applied mechanics b. 959 B. Sc. in mathematics PhD in applied mathematics D J Watts, S H Strogatz, Collective dynamics of 'small-world' networs, Nature 393 (998)

7 C D Connectivity matrix ( sociomatrix ) A B Clustering coefficient C N i N ( ) i 2L i i 7

8 Mean free path ( diameter ) N L( N) shortest _ path( i, N( N ) i, j Small-world effect j) L( N ) ln( N ) te-in.faceboo.com/group.php?v=info&gid= D J Watts, S H Strogatz, Nature 393 (998)

9 Erdös-Rényi networs -Tae N nodes -Connect each pair with probability p Mean degree <> = (N-)p igraph.sourceforge.net/screenshots2.html Degree distribution P( ) e! 9

10 PhD in complex networs 2 b. 967 MSc in physics and engineering PhD in physics actors www power grid R Albert, A-L Barabasi, Emergence of Scaling in Random Networs, Science 286 (999) 59

11 Growing networs construction for M = Nodes to attach a new node are selected with probability: - constant (exponential graphs) - proportional to their degree (scale-free graphs)

12 networs N # d C actors 45x^4 25x^ www Altavista 2x^9 2x^ /2.7 coauthorship - math 25x^4 5x^ coauthorship - phys 5^^4 25x^ Phone calls 47x^6 8x^ Web chains in water Protein interactions Sexual contacts Words in sentences 46x^4 7x^ M E J Newman, SIAM Review 45, 67 (23)

13 Assortativity r j j( e j 2 q q j q ) where q ( ) p e j fraction of lins between nodes j, MEJ Newman, PRE 67 (23)

14 Why not ALL social networs are scale-free Michael Schnegg, IJMPC 7 (26) 67 4

15 Why social networs are different from other types of networs In this paper we have argued that social and non-social networs differ in two important ways. First, they show distinctly different patterns of correlation between the degrees of adjacent vertices, with degrees being positively correlated (assortative mixing) in most social networs and negatively correlated (disassortative mixing) in most nonsocial networs. Second, social networs show high levels of clustering or networ transitivity, whereas clustering in many non-social networs is no higher than one would expect on the basis of pure chance, given the observed degree distribution. We have shown that both of these differences can be explained by the same hypothesis, that social networs are divided into communities, and non-social networs are not. MEJ Newman, J Par, PRE 68 (23)

16 MEJ Newman, J Par, PRE 68 (23)

17 It is used to assume but it could be

18 Role of line graphs here In the model proposed here, a social networ is the line graph of an initial networ of families, communities, interest groups, school classes and small companies. These groups play the role of nodes, and individuals are represented by lins between these nodes. M J Krawczy et al, arxiv:.246

19 line graph the construction a b c d

20 2 2. If i,j are in the same row or column, then the element C(i,j) of the transformed matrix is A C B D Algorithm. assign numbers to the elements of the connectivity matrix above the diagonal. Mae the matrix symmetric

21 2 2, 2) ( 2) )( ( ) ( ) ( ) ( ) ( ) ( n m n n m m n t n P n n np m mp n np m mp n np P Degree distribution of a line graph n m A. Mańa-Krasoń et al, Comp. Phys. Comm. (2) 8 2

22 Degree distribution P() Erdös-Rényi networs P( ) t e 2 n ( n )!( n )! e 2 (2 )! exponential networs 4 ( c) P t( ) ( )( 2)( 3) c 6 22

23 The degree distribution of a line graph on a scale-free networ P t () <>=6,6 23

24 Clustering coefficient in line graphs n m C 2 n np( n) m mp( m) ( n )( n ( n m 2) ( m 2)( n )( m m 3) 2) C Scale-free Exp E-R <> 24

25 Line graphs - assortativity n m r ' ( ) np( n) mp( m) n m r np( n) mp( m) n m r rp( r)( n m 2) rp( r), m r, m 2 r 2 A. Mańa-Krasoń et al, APPB Proc Suppl 3 (2)

26 Assortativity < ()> Erdös-Rényi networs ' ( ) exponential networs 26

27 Assortativity of a line graph on a scale-free networ < ()> 27

28 LiveJournal LiveJournal is a remarably popular platform for personal blog management, populated with over 8 million blogs and over million of communities. LiveJournal was among the first of such platforms available online and it still remains one of the most active and popular. Its users manage personal blogs where they share their daily experiences, political views or discuss news events. Users can also comment on posts of other users. We defined the networ nodes to correspond to personal blogs. Directional lins connecting these nodes represent the record that a particular user (owning one blog) monitors another blog (owned by another user). M J Krawczy et al, arxiv:

29 LiveJournal: data N=8.* 6 ; #=25* 6 simulations: N=9* 3 P() 29

30 LiveJournal: assortativity < ()> simulations 3

31 LiveJournal simulations C() 3

32 conclusions The degree distribution of a line graph is close to the degree distribution of its initial networ. Line graphs are clusterized and assortative. The degree-dependent clustering coefficient C() indicates the presence of cliques. We have shown that LiveJournal, where P() is scale-free, displays qualitatively the same features. Than you 32

The Beginning of Graph Theory. Theory and Applications of Complex Networks. Eulerian paths. Graph Theory. Class Three. College of the Atlantic

The Beginning of Graph Theory. Theory and Applications of Complex Networks. Eulerian paths. Graph Theory. Class Three. College of the Atlantic Theory and Applications of Complex Networs 1 Theory and Applications of Complex Networs 2 Theory and Applications of Complex Networs Class Three The Beginning of Graph Theory Leonhard Euler wonders, can

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

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

Network Observational Methods and. Quantitative Metrics: II

Network Observational Methods and. Quantitative Metrics: II Network Observational Methods and Whitney topics Quantitative Metrics: II Community structure (some done already in Constraints - I) The Zachary Karate club story Degree correlation Calculating degree

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

Adventures in random graphs: Models, structures and algorithms

Adventures 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 Complex

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

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

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

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

3.2 Configuration model

3.2 Configuration model 3.2 Configuration model 3.2.1 Definition. Basic properties Assume that the vector d = (d 1,..., d n ) is graphical, i.e., there exits a graph on n vertices such that vertex 1 has degree d 1, vertex 2 has

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

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

Design and characterization of chemical space networks

Design and characterization of chemical space networks Design and characterization of chemical space networks Martin Vogt B-IT Life Science Informatics Rheinische Friedrich-Wilhelms-University Bonn 16 August 2015 Network representations of chemical spaces

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

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

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

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

Erdős-Rényi random graph

Erdős-Rényi random graph Erdős-Rényi random graph introduction to network analysis (ina) Lovro Šubelj University of Ljubljana spring 2016/17 graph models graph model is ensemble of random graphs algorithm for random graphs of

More information

Network models: dynamical growth and small world

Network models: dynamical growth and small world Network models: dynamical growth and small world Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics

More information

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

Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks

Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks Maksim Kitsak, 1 Shlomo Havlin, 1,2 Gerald Paul, 1 Massimo Riccaboni, 3 Fabio Pammolli, 1,3,4 and H.

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

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

Evolving network with different edges

Evolving 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 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

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

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

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

Growing a Network on a Given Substrate

Growing 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 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

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

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

Combining Geographic and Network Analysis: The GoMore Rideshare Network. Kate Lyndegaard

Combining 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 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

Shannon Entropy and Degree Correlations in Complex Networks

Shannon Entropy and Degree Correlations in Complex Networks Shannon Entropy and Degree Correlations in Complex etworks SAMUEL JOHSO, JOAQUÍ J. TORRES, J. MARRO, and MIGUEL A. MUÑOZ Instituto Carlos I de Física Teórica y Computacional, Departamento de Electromagnetismo

More information

Chapter 2 Fitness-Based Generative Models for Power-Law Networks

Chapter 2 Fitness-Based Generative Models for Power-Law Networks Chapter 2 Fitness-Based Generative Models for Power-Law Networks Khanh Nguyen and Duc A. Tran Abstract Many real-world complex networks exhibit a power-law degree distribution. A dominant concept traditionally

More information

ECS 253 / MAE 253 April 26, Intro to Biological Networks, Motifs, and Model selection/validation

ECS 253 / MAE 253 April 26, Intro to Biological Networks, Motifs, and Model selection/validation ECS 253 / MAE 253 April 26, 2016 Intro to Biological Networks, Motifs, and Model selection/validation Announcement HW2, due May 3 (one week) HW2b, due May 5 HW2a, due May 5. Will be posted on Smartsite.

More information

Móstoles, Spain. Keywords: complex networks, dual graph, line graph, line digraph.

Mó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

Mining Triadic Closure Patterns in Social Networks

Mining Triadic Closure Patterns in Social Networks Mining Triadic Closure Patterns in Social Networks Hong Huang, University of Goettingen Jie Tang, Tsinghua University Sen Wu, Stanford University Lu Liu, Northwestern University Xiaoming Fu, University

More information

Percolation in Complex Networks: Optimal Paths and Optimal Networks

Percolation in Complex Networks: Optimal Paths and Optimal Networks Percolation in Complex Networs: Optimal Paths and Optimal Networs Shlomo Havlin Bar-Ilan University Israel Complex Networs Networ is a structure of N nodes and 2M lins (or M edges) Called also graph in

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

A Random Dot Product Model for Weighted Networks arxiv: v1 [stat.ap] 8 Nov 2016

A Random Dot Product Model for Weighted Networks arxiv: v1 [stat.ap] 8 Nov 2016 A Random Dot Product Model for Weighted Networks arxiv:1611.02530v1 [stat.ap] 8 Nov 2016 Daryl R. DeFord 1 Daniel N. Rockmore 1,2,3 1 Department of Mathematics, Dartmouth College, Hanover, NH, USA 03755

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

arxiv: v1 [physics.soc-ph] 17 Mar 2015

arxiv: v1 [physics.soc-ph] 17 Mar 2015 Hyperbolic Graph Generator Rodrigo Aldecoa a,, Chiara Orsini b, Dmitri Krioukov a,c arxiv:53.58v [physics.soc-ph] 7 Mar 25 a Northeastern University, Department of Physics, Boston, MA, USA b Center for

More information

Community Detection. fundamental limits & efficient algorithms. Laurent Massoulié, Inria

Community Detection. fundamental limits & efficient algorithms. Laurent Massoulié, Inria Community Detection fundamental limits & efficient algorithms Laurent Massoulié, Inria Community Detection From graph of node-to-node interactions, identify groups of similar nodes Example: Graph of US

More information

Data Mining and Analysis: Fundamental Concepts and Algorithms

Data Mining and Analysis: Fundamental Concepts and Algorithms Data Mining and Analysis: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA

More information

Decision Making and Social Networks

Decision Making and Social Networks Decision Making and Social Networks Lecture 4: Models of Network Growth Umberto Grandi Summer 2013 Overview In the previous lecture: We got acquainted with graphs and networks We saw lots of definitions:

More information

Characteristics of Small World Networks

Characteristics of Small World Networks Characteristics of Small World Networks Petter Holme 20th April 2001 References: [1.] D. J. Watts and S. H. Strogatz, Collective Dynamics of Small-World Networks, Nature 393, 440 (1998). [2.] D. J. Watts,

More information

The Spreading of Epidemics in Complex Networks

The Spreading of Epidemics in Complex Networks The Spreading of Epidemics in Complex Networks Xiangyu Song PHY 563 Term Paper, Department of Physics, UIUC May 8, 2017 Abstract The spreading of epidemics in complex networks has been extensively studied

More information

Networks. Can (John) Bruce Keck Founda7on Biotechnology Lab Bioinforma7cs Resource

Networks. Can (John) Bruce Keck Founda7on Biotechnology Lab Bioinforma7cs Resource Networks Can (John) Bruce Keck Founda7on Biotechnology Lab Bioinforma7cs Resource Networks in biology Protein-Protein Interaction Network of Yeast Transcriptional regulatory network of E.coli Experimental

More information

Network Analysis and Modeling

Network Analysis and Modeling lecture 0: what are networks and how do we talk about them? 2017 Aaron Clauset 003 052 002 001 Aaron Clauset @aaronclauset Assistant Professor of Computer Science University of Colorado Boulder External

More information

Scale-free random graphs and Potts model

Scale-free random graphs and Potts model PRAMAA c Indian Academy of Sciences Vol. 64, o. 6 journal of June 25 physics pp. 49 59 D-S LEE,2, -I GOH, B AHG and D IM School of Physics and Center for Theoretical Physics, Seoul ational University,

More information

arxiv:physics/ v2 [physics.soc-ph] 16 Aug 2005

arxiv:physics/ v2 [physics.soc-ph] 16 Aug 2005 Statistical analysis of 22 public transport networs in Poland Julian Sieniewicz and Janusz A. Ho lyst Faculty of Physics and Center of Excellence for Complex Systems Research, Warsaw University of Technology,

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

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

Deterministic Decentralized Search in Random Graphs

Deterministic Decentralized Search in Random Graphs Deterministic Decentralized Search in Random Graphs Esteban Arcaute 1,, Ning Chen 2,, Ravi Kumar 3, David Liben-Nowell 4,, Mohammad Mahdian 3, Hamid Nazerzadeh 1,, and Ying Xu 1, 1 Stanford University.

More information

arxiv: v2 [physics.soc-ph] 16 May 2008

arxiv: v2 [physics.soc-ph] 16 May 2008 Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications arxiv:0711.3199v2 [physics.soc-ph] 16 May 2008 Luciano da Fontoura Costa 1 Osvaldo N. Oliveira Jr. 1 Gonzalo

More information

networks in molecular biology Wolfgang Huber

networks in molecular biology Wolfgang Huber networks in molecular biology Wolfgang Huber networks in molecular biology Regulatory networks: components = gene products interactions = regulation of transcription, translation, phosphorylation... Metabolic

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

MS&E 233 Lecture 9 & 10: Network models

MS&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 information

arxiv:cond-mat/ v3 [cond-mat.dis-nn] 10 Dec 2003

arxiv:cond-mat/ v3 [cond-mat.dis-nn] 10 Dec 2003 Efficient Immunization Strategies for Computer Networs and Populations Reuven Cohen, Shlomo Havlin, and Daniel ben-avraham 2 Minerva Center and Department of Physics, Bar-Ilan University, Ramat-Gan, 529,

More information

Spectral Graph Theory Tools. Analysis of Complex Networks

Spectral Graph Theory Tools. Analysis of Complex Networks Spectral Graph Theory Tools for the Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Acknowledgments Christine Klymko (Emory) Ernesto Estrada (Strathclyde, UK) Support:

More information

Network Science (overview, part 1)

Network Science (overview, part 1) Network Science (overview, part 1) Ralucca Gera, Applied Mathematics Dept. Naval Postgraduate School Monterey, California rgera@nps.edu Excellence Through Knowledge Overview Current research Section 1:

More information

Network Interventions Based on Inversity: Leveraging the Friendship Paradox in Unknown Network Structures

Network Interventions Based on Inversity: Leveraging the Friendship Paradox in Unknown Network Structures Network Interventions Based on Inversity: Leveraging the Friendship Paradox in Unknown Network Structures Vineet Kumar, David Krackhardt, 2 Scott Feld 3 Yale School of Management, Yale University. 2 Heinz

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

Evolutionary dynamics on graphs

Evolutionary dynamics on graphs Evolutionary dynamics on graphs Laura Hindersin May 4th 2015 Max-Planck-Institut für Evolutionsbiologie, Plön Evolutionary dynamics Main ingredients: Fitness: The ability to survive and reproduce. Selection

More information

LINK ANALYSIS. Dr. Gjergji Kasneci Introduction to Information Retrieval WS

LINK ANALYSIS. Dr. Gjergji Kasneci Introduction to Information Retrieval WS LINK ANALYSIS Dr. Gjergji Kasneci Introduction to Information Retrieval WS 2012-13 1 Outline Intro Basics of probability and information theory Retrieval models Retrieval evaluation Link analysis Models

More information

Sparse Linear Algebra Issues Arising in the Analysis of Complex Networks

Sparse Linear Algebra Issues Arising in the Analysis of Complex Networks Sparse Linear Algebra Issues Arising in the Analysis of Complex Networks Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Acknowledgments Christine Klymko (Emory)

More information

Theory and Methods for the Analysis of Social Networks

Theory and Methods for the Analysis of Social Networks Theory and Methods for the Analysis of Social Networks Alexander Volfovsky Department of Statistical Science, Duke University Lecture 1: January 16, 2018 1 / 35 Outline Jan 11 : Brief intro and Guest lecture

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

Math 304 Handout: Linear algebra, graphs, and networks.

Math 304 Handout: Linear algebra, graphs, and networks. Math 30 Handout: Linear algebra, graphs, and networks. December, 006. GRAPHS AND ADJACENCY MATRICES. Definition. A graph is a collection of vertices connected by edges. A directed graph is a graph all

More information

CSI 445/660 Part 6 (Centrality Measures for Networks) 6 1 / 68

CSI 445/660 Part 6 (Centrality Measures for Networks) 6 1 / 68 CSI 445/660 Part 6 (Centrality Measures for Networks) 6 1 / 68 References 1 L. Freeman, Centrality in Social Networks: Conceptual Clarification, Social Networks, Vol. 1, 1978/1979, pp. 215 239. 2 S. Wasserman

More information

Models of Communication Dynamics for Simulation of Information Diffusion

Models 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 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

How to count trees? arxiv:cond-mat/ v3 [cond-mat.stat-mech] 7 Apr 2005

How to count trees? arxiv:cond-mat/ v3 [cond-mat.stat-mech] 7 Apr 2005 How to count trees? arxiv:cond-mat/0501594v3 [cond-mat.stat-mech] 7 Apr 2005 Sebastian Piec, Krzysztof Malarz and Krzysztof Ku lakowski AGH University of Science and Technology, Faculty of Physics and

More information

Mini course on Complex Networks

Mini course on Complex Networks Mini course on Complex Networks Massimo Ostilli 1 1 UFSC, Florianopolis, Brazil September 2017 Dep. de Fisica Organization of The Mini Course Day 1: Basic Topology of Equilibrium Networks Day 2: Percolation

More information

Analysis & Generative Model for Trust Networks

Analysis & 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 information

Greedy Search in Social Networks

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

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

arxiv:physics/ v2 [physics.soc-ph] 19 Feb 2007 Betweenness Centrality of Fractal and Non-Fractal Scale-Free Model Networks and Tests on Real Networks Maksim Kitsak, 1 Shlomo Havlin, 1,2 Gerald Paul, 1 Massimo arxiv:physics/0702001v2 [physics.soc-ph]

More information

Numerical evaluation of the upper critical dimension of percolation in scale-free networks

Numerical evaluation of the upper critical dimension of percolation in scale-free networks umerical evaluation of the upper critical dimension of percolation in scale-free networks Zhenhua Wu, 1 Cecilia Lagorio, 2 Lidia A. Braunstein, 1,2 Reuven Cohen, 3 Shlomo Havlin, 3 and H. Eugene Stanley

More information

The Probabilistic Method

The Probabilistic Method Lecture 3: Tail bounds, Probabilistic Method Today we will see what is nown as the probabilistic method for showing the existence of combinatorial objects. We also review basic concentration inequalities.

More information

Statistical and Computational Phase Transitions in Planted Models

Statistical and Computational Phase Transitions in Planted Models Statistical and Computational Phase Transitions in Planted Models Jiaming Xu Joint work with Yudong Chen (UC Berkeley) Acknowledgement: Prof. Bruce Hajek November 4, 203 Cluster/Community structure in

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

Temporal patterns in information and social systems

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

arxiv:cond-mat/ v1 [cond-mat.dis-nn] 24 Mar 2005

arxiv:cond-mat/ v1 [cond-mat.dis-nn] 24 Mar 2005 APS/123-QED Scale-Free Networks Emerging from Weighted Random Graphs Tomer Kalisky, 1, Sameet Sreenivasan, 2 Lidia A. Braunstein, 2,3 arxiv:cond-mat/0503598v1 [cond-mat.dis-nn] 24 Mar 2005 Sergey V. Buldyrev,

More information

Competition and multiscaling in evolving networks

Competition and multiscaling in evolving networks EUROPHYSICS LETTERS 5 May 2 Europhys. Lett., 54 (4), pp. 436 442 (2) Competition and multiscaling in evolving networs G. Bianconi and A.-L. Barabási,2 Department of Physics, University of Notre Dame -

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

Percolation of networks with directed dependency links

Percolation of networks with directed dependency links Percolation of networs with directed dependency lins 9] to study the percolation phase transitions in a random networ A with both connectivity and directed dependency lins. Randomly removing a fraction

More information

arxiv: v1 [cond-mat.other] 31 Aug 2009

arxiv: v1 [cond-mat.other] 31 Aug 2009 Weighted Fractal Networs Timoteo Carletti, Simone Righi Département de Mathématique, Facultés Universitaires Notre Dame de la Paix 8 rempart de la vierge B5000 Namur, Belgium corresponding author (*) timoteo.carletti@fundp.ac.be

More information

Spectral Methods for Subgraph Detection

Spectral Methods for Subgraph Detection Spectral Methods for Subgraph Detection Nadya T. Bliss & Benjamin A. Miller Embedded and High Performance Computing Patrick J. Wolfe Statistics and Information Laboratory Harvard University 12 July 2010

More information

STA141C: Big Data & High Performance Statistical Computing

STA141C: Big Data & High Performance Statistical Computing STA141C: Big Data & High Performance Statistical Computing Lecture 12: Graph Clustering Cho-Jui Hsieh UC Davis May 29, 2018 Graph Clustering Given a graph G = (V, E, W ) V : nodes {v 1,, v n } E: edges

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

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

Google Matrix, dynamical attractors and Ulam networks Dima Shepelyansky (CNRS, Toulouse)

Google Matrix, dynamical attractors and Ulam networks Dima Shepelyansky (CNRS, Toulouse) Google Matrix, dynamical attractors and Ulam networks Dima Shepelyansky (CNRS, Toulouse) wwwquantwareups-tlsefr/dima based on: OGiraud, BGeorgeot, DLS (CNRS, Toulouse) => PRE 8, 267 (29) DLS, OVZhirov

More information

Spectral Perturbation of Small-World Networks with Application to Brain Disease Detection

Spectral Perturbation of Small-World Networks with Application to Brain Disease Detection Spectral Perturbation of Small-World Networks with Application to Brain Disease Detection Chenhui Hu May 4, 22 Introduction Many real life systems can be described by complex networks, which usually consist

More information

Bayesian nonparametric models for bipartite graphs

Bayesian nonparametric models for bipartite graphs Bayesian nonparametric models for bipartite graphs François Caron Department of Statistics, Oxford Statistics Colloquium, Harvard University November 11, 2013 F. Caron 1 / 27 Bipartite networks Readers/Customers

More information

Degree Distribution: The case of Citation Networks

Degree 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 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

Link Analysis. Leonid E. Zhukov

Link Analysis. Leonid E. Zhukov Link Analysis Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Structural Analysis and Visualization

More information