Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.

Slides:

Advertisements

Similar presentations

Peer-to-Peer and Social Networks Power law graphs Small world graphs.

Advertisements

Complex Networks Advanced Computer Networks: Part1.

Scale Free Networks.

Complex Networks Luis Miguel Varela COST meeting, Lisbon March 27 th 2013.

Graphs: basic definitions and notation Definition A (undirected, unweighted) graph is a pair G = (V, E), where V = {v 1, v 2,..., v n } is a set of vertices,

Small-world networks.

Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.

Analysis and Modeling of Social Networks Foudalis Ilias.

VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.

Rumors and Routes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopRumors and Routes1.

Analysis of Social Media MLD , LTI William Cohen

 Copyright 2011 Digital Enterprise Research Institute. All rights reserved. Digital Enterprise Research Institute Enabling Networked Knowledge.

CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.

CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.

Hierarchy in networks Peter Náther, Mária Markošová, Boris Rudolf Vyjde : Physica A, dec

1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.

Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.

CS728 Lecture 5 Generative Graph Models and the Web.

Power law random graphs. Loose definition: distribution is power-law if Over some range of values for some exponent Examples  Degree distributions of.

Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.

Network Statistics Gesine Reinert. Yeast protein interactions.

Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏

Global topological properties of biological networks.

Search in a Small World JIN Xiaolong Based on [1].

Advanced Topics in Data Mining Special focus: Social Networks.

Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.

1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006

On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.

The Erdös-Rényi models

(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.

Author: M.E.J. Newman Presenter: Guoliang Liu Date:5/4/2012.

Class 2: Graph theory and basic terminology Learning the language Network Science: Graph Theory 2012 Prof. Albert-László Barabási Dr. Baruch Barzel, Dr.

Small-world networks. What is it? Everyone talks about the small world phenomenon, but truly what is it? There are three landmark papers: Stanley Milgram.

Part 1: Biological Networks 1.Protein-protein interaction networks 2.Regulatory networks 3.Expression networks 4.Metabolic networks 5.… more biological.

Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.

3. SMALL WORLDS The Watts-Strogatz model. Watts-Strogatz, Nature 1998 Small world: the average shortest path length in a real network is small Six degrees.

Neural Network of C. elegans is a Small-World Network Masroor Hossain Wednesday, February 29 th, 2012 Introduction to Complex Systems.

Class 9: Barabasi-Albert Model-Part I

Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.

Project 2 22C:021 Computer Science II : Data Structures.

1 CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014 Network models Tamer Kahveci.

Performance Evaluation Lecture 1: Complex Networks Giovanni Neglia INRIA – EPI Maestro 10 December 2012.

Class 2: Graph Theory IST402. Can one walk across the seven bridges and never cross the same bridge twice? Network Science: Graph Theory THE BRIDGES OF.

Informatics tools in network science

Class 2: Graph Theory IST402.

Models of Web-Like Graphs: Integrated Approach

Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.

Network (graph) Models

Lecture 23: Structure of Networks

Structures of Networks

Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama

Lecture 1: Complex Networks

Learning to Generate Networks

Advanced Computer Networks: Part1

Network analysis.

Peer-to-Peer and Social Networks

Community detection in graphs

Lecture 23: Structure of Networks

Network Science: A Short Introduction i3 Workshop

The Watts-Strogatz model

Graph Algorithm.

Section 8.2: Shortest path and small world effect

Shortest path and small world effect

Small World Networks Scotty Smith February 7, 2007.

Department of Computer Science University of York

Peer-to-Peer and Social Networks

Lecture 23: Structure of Networks

Network Science: A Short Introduction i3 Workshop

Network Models Michael Goodrich Some slides adapted from:

Advanced Topics in Data Mining Special focus: Social Networks

Presentation transcript:

Networks

Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where

Network models- Random graph (Erdoes-Renyi) algorithm: -number of vertices |V| is constant. -run through all pairs of vertices ij (i < j) and establish an edge e ij with probability p.

Network models- Small world (Watts-Strogatz) algorithm: -number of vertices |V| is constant. -Construct a regular ring lattice (i.e. a graph with nodes each connected to K, K/2 neighbors on each side. -For every node v i, take every edge v i, v j (i < j) and rewire it with probability p. -Rewiring is done by replacing e ij with e ik where k is chosen randomly.

Network models- Preferential attachment (Barabasi- Albert) algorithm: -number of vertices |V| is growing. -In every step, add a new node v i. -Connect v i to v j according to the preferential attachment rule: k i … degree (i.e. number of neighbors) of vertex i

Network measures -node degree distribution (i.e. histogram of the number of neighbors of each node i) -clustering coefficient of node i C = 1 C = 2/3 C = 1/3 C = 0 -average Clustering coefficient -Topological coefficient -Average topological coefficient of vertex i if i and j interact otherwise neighbors if vertex i

Network measures (contd.) -average shortest path, diameter -Betweeness centrality of vertex i - Neighborhood connectivity of vertex i -Closeness centrality of vertex i

Cytoscape files: contain the network as edge list (i.e. ).NA files: contain attributes of nodes (i.e. = ).EA files: contain attributes of edges (i.e. (identifier) = )

Python