Complex Networks: My view & research

Similar documents
Properties of Biological Networks

(Social) Networks Analysis III. Prof. Dr. Daning Hu Department of Informatics University of Zurich

Introduction to network metrics

Critical Phenomena in Complex Networks

Heuristics for the Critical Node Detection Problem in Large Complex Networks

Wednesday, March 8, Complex Networks. Presenter: Jirakhom Ruttanavakul. CS 790R, University of Nevada, Reno

Failure in Complex Social Networks

Summary: What We Have Learned So Far

M.E.J. Newman: Models of the Small World

Advanced Algorithms and Models for Computational Biology -- a machine learning approach

CAIM: Cerca i Anàlisi d Informació Massiva

Graph Theory. Graph Theory. COURSE: Introduction to Biological Networks. Euler s Solution LECTURE 1: INTRODUCTION TO NETWORKS.

Supplementary material to Epidemic spreading on complex networks with community structures

Complex Networks. Structure and Dynamics

Network Thinking. Complexity: A Guided Tour, Chapters 15-16

Nick Hamilton Institute for Molecular Bioscience. Essential Graph Theory for Biologists. Image: Matt Moores, The Visible Cell

Graph-theoretic Properties of Networks

Models of Network Formation. Networked Life NETS 112 Fall 2017 Prof. Michael Kearns

Networks and Discrete Mathematics

Response Network Emerging from Simple Perturbation

- relationships (edges) among entities (nodes) - technology: Internet, World Wide Web - biology: genomics, gene expression, proteinprotein

An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization

A Generating Function Approach to Analyze Random Graphs

Phase Transitions in Random Graphs- Outbreak of Epidemics to Network Robustness and fragility

Exploiting the Scale-free Structure of the WWW

Basics of Network Analysis

Cineworld Unlimited Survey

SELF-HEALING NETWORKS: REDUNDANCY AND STRUCTURE

Networks in economics and finance. Lecture 1 - Measuring networks

The Complex Network Phenomena. and Their Origin

Lesson 4. Random graphs. Sergio Barbarossa. UPC - Barcelona - July 2008

Examples of Complex Networks

Plan of the lecture I. INTRODUCTION II. DYNAMICAL PROCESSES. I. Networks: definitions, statistical characterization, examples II. Modeling frameworks

Second-Order Assortative Mixing in Social Networks

Characteristics of Preferentially Attached Network Grown from. Small World

Complex Networks: A Review

Charlotte 49ers. Charlotte Athletics 9201 University City Blvd. Charlotte, NC *Address Applies to All * Please include Att:

CS-E5740. Complex Networks. Scale-free networks

Immunization for complex network based on the effective degree of vertex

An introduction to the physics of complex networks

SMALL WORLD NETWORK. -Naveen Teja Vempati -Ravi Teja Mitta

Structure of biological networks. Presentation by Atanas Kamburov

Epidemic spreading on networks

The Establishment Game. Motivation

Introduction to Networks and Business Intelligence

Constructing a G(N, p) Network

Random graph models with fixed degree sequences: choices, consequences and irreducibilty proofs for sampling

caution in interpreting graph-theoretic diagnostics

Constructing a G(N, p) Network

Introduction to Complex Networks Analysis

SNA 8: network resilience. Lada Adamic

Overlay (and P2P) Networks

6.207/14.15: Networks Lecture 5: Generalized Random Graphs and Small-World Model

Chapter 1. Social Media and Social Computing. October 2012 Youn-Hee Han

Erdős-Rényi Model for network formation

Random Simplicial Complexes

PhoneBook (Sorting) You will be modifying your PhoneBook class to sort by different fields in a contact.

On Complex Dynamical Networks. G. Ron Chen Centre for Chaos Control and Synchronization City University of Hong Kong

Hyperbolic Geometry of Complex Network Data

An Evolving Network Model With Local-World Structure

PeeWee Flag Players: Players: Caruthers, Coby. Brooker, Kainen. Whitlock, Trenten

Midterm Review NETS 112

Small World Properties Generated by a New Algorithm Under Same Degree of All Nodes

Complex-Network Modelling and Inference

How Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns

Introduction to Network Analysis. Some materials adapted from Lada Adamic, UMichigan

Recommender Systems. Techniques of AI

SLANG Session 4. Jason Quinley Roland Mühlenbernd Seminar für Sprachwissenschaft University of Tübingen

Final GLOCK Girl Side Match Rankings for the GGSM - BMT - 18 held at the Billings Rod and Gun Club in Billings, MT Match Date: 8/11/18

arxiv:cond-mat/ v5 [cond-mat.dis-nn] 16 Aug 2006

Graph theoretic concepts. Devika Subramanian Comp 140 Fall 2008

CSE 258 Lecture 12. Web Mining and Recommender Systems. Social networks

Online Social Networks 2

E6885 Network Science Lecture 5: Network Estimation and Modeling

Election Summary Report

2018/2019 CANADA CUP SERIES Results Ladies' Ski Slopestyle WHITEHORSE, YUKON (CAN) SAT 1 DEC 2018 Start Time: 11:45

Attack vulnerability of complex networks

Cascade dynamics of complex propagation

1 Random Graph Models for Networks

Claude Paré. Production Designer

COMP6237 Data Mining and Networks. Markus Brede. Lecture slides available here:

Exercise set #2 (29 pts)

CS-E5740. Complex Networks. Network analysis: key measures and characteristics

Topology and Dynamics of Complex Networks

CS249: SPECIAL TOPICS MINING INFORMATION/SOCIAL NETWORKS

The coupling effect on VRTP of SIR epidemics in Scale- Free Networks

Network Theory Introduction

Complex networks Phys 682 / CIS 629: Computational Methods for Nonlinear Systems

Biological Networks Analysis Dijkstra s algorithm and Degree Distribution

An Introduction to Complex Systems Science

CSE 255 Lecture 13. Data Mining and Predictive Analytics. Triadic closure; strong & weak ties

Pete Yarbro 2-MA 3-FTR st FTR Rick Frost 4-SS 3-FTR

Path Length. 2) Verification of the Algorithm and Code

Topic mash II: assortativity, resilience, link prediction CS224W

Patient-Centered Medical Home (PCMH) Listing for Regional Care Directors, Program Consultants and Program Representatives

Theory and Applications of Complex Networks

Distributed Data Management

Melissa Campbell Monique Eskandari Jordan Beauchamp Emily Feinle-Bisset Lily Bellman

3 Global Properties of Networks

Social Networks, Social Interaction, and Outcomes

Transcription:

CSC / Computational Biology September 14, 2007, ACCESS board meeting http://www.csc.kth.se/ pholme/

what is a network? a system where things interact, or are coupled, pairwise

nodes, vertices, links, edges vertex, node, site, actor, agent edge, link, tie, bond, arc number of neighbors = degree

examples: internet

examples: metabolism

examples: scientific collaborations

examples: friendship

examples: dating Patsy Kensit Salma Hayek Tom Green Kurt Cobain Liam Gallagher David Schwimmer Drew Barrymore Edward Norton Daniel Johns Rod Stewart Nicole Appleton Noah Wyle Cortney Love Eric Erlandsson Rachel Hunter Mel C Luke Wilson Keri Russell Jennifer Aniston Natalie Prince Imbruglia Felipe of Spain Scott Speedman P Diddy Geri Halliwell Prince Nicholas of Greece Jude Law Robbie Williams Chris Martin Jennifer Lopez Gwyneth Paltrow Sadie Frost Ben Affleck Nicole Kidman Lenny Kravitz Brad Gisele Pitt Bundchen Bridget Hall Tom Cruise Liv Leonardo Tyler Alicia DiCaprio Silverstone Jared Janet Leto Jackson Penelope Vanessa Cruz Paradis Juliette Tobey Lewis Maguire Demi Naomi Moore Campbell Claire Cameron Danes Justin Diaz Timberlake Johnny Depp Virgine Ledoyen Alyssa Milano Eric Clapton Neve Campbell Matt Damon Colin Farrell Winona Ryder Kristen Dunst Bruce Willis Britney Spears Matt Dillon Sheryl Crow Ashton Kutcher Pamela Anderson Kid Rock Minnie Driver John Cusack Sherilyn Fenn Kate Moss Fred Dust Jennifer Grey Owen Wils Meg Ryan Beck Brittany Murphy Heather Locklear Marcus Schenkenberg Russell Crowe Tommy Lee Dave Grohl Dennis Quaid Eminem Mariah Carey Richie Sambora

what systems can be modeled as networks? items are coupled pairwise the network is relatively sparse (the average degree is constant) there is a dynamic system on the network the time scale of this dynamics is faster than the dynamics of network evolution

what systems can be modeled as networks? items are coupled pairwise the network is relatively sparse (the average degree is constant) there is a dynamic system on the network the time scale of this dynamics is faster than the dynamics of network evolution

what systems can be modeled as networks? items are coupled pairwise the network is relatively sparse (the average degree is constant) there is a dynamic system on the network the time scale of this dynamics is faster than the dynamics of network evolution

what systems can be modeled as networks? items are coupled pairwise the network is relatively sparse (the average degree is constant) there is a dynamic system on the network the time scale of this dynamics is faster than the dynamics of network evolution

what systems can be modeled as networks? items are coupled pairwise the network is relatively sparse (the average degree is constant) there is a dynamic system on the network the time scale of this dynamics is faster than the dynamics of network evolution

what is? how the network differs a random network to be more precise: how the network differs from a null model

what is? how the network differs a random network to be more precise: how the network differs from a null model

what is? how the network differs a random network to be more precise: how the network differs from a null model

the dogmas of network science real networks have both structure and randomness the relates to the function of the network

the dogmas of network science real networks have both structure and randomness the relates to the function of the network

the dogmas of network science real networks have both structure and randomness the relates to the function of the network

what is network science? Constructing relevant measures of. Measuring structure of real networks, and elucidating correlations between the quantities. Why do real networks have the structure they have? Modeling the evolution of networks. How does the topology affect dynamic systems on the network. How can we control network topology to get some desirable dynamic property.

what is network science? Constructing relevant measures of. Measuring structure of real networks, and elucidating correlations between the quantities. Why do real networks have the structure they have? Modeling the evolution of networks. How does the topology affect dynamic systems on the network. How can we control network topology to get some desirable dynamic property.

what is network science? Constructing relevant measures of. Measuring structure of real networks, and elucidating correlations between the quantities. Why do real networks have the structure they have? Modeling the evolution of networks. How does the topology affect dynamic systems on the network. How can we control network topology to get some desirable dynamic property.

what is network science? Constructing relevant measures of. Measuring structure of real networks, and elucidating correlations between the quantities. Why do real networks have the structure they have? Modeling the evolution of networks. How does the topology affect dynamic systems on the network. How can we control network topology to get some desirable dynamic property.

what is network science? Constructing relevant measures of. Measuring structure of real networks, and elucidating correlations between the quantities. Why do real networks have the structure they have? Modeling the evolution of networks. How does the topology affect dynamic systems on the network. How can we control network topology to get some desirable dynamic property.

what is network science? Constructing relevant measures of. Measuring structure of real networks, and elucidating correlations between the quantities. Why do real networks have the structure they have? Modeling the evolution of networks. How does the topology affect dynamic systems on the network. How can we control network topology to get some desirable dynamic property.

degree distribution

clustering coefficient

clustering coefficient How many triangles are there in the network? The clustering coefficient: C = the number of triangles 3 the number of connected triples of vertices

clustering coefficient How many triangles are there in the network? The clustering coefficient: C = the number of triangles 3 the number of connected triples of vertices

clustering coefficient triangle

clustering coefficient connected triple

assortativity Are high-degree vertices connected to other high-degree vertices? Or are they vertices primarily connected to low-degree vertices. The assortative mixing coefficient: r = 4 k 1 k 2 k 1 + k 2 2 2 k 2 1 + k 2 2 k 1 + k 2 2 where k i is the degree of the i th argument of the edges as they appear in an enumeration of the edges.

assortativity Are high-degree vertices connected to other high-degree vertices? Or are they vertices primarily connected to low-degree vertices. The assortative mixing coefficient: r = 4 k 1 k 2 k 1 + k 2 2 2 k 2 1 + k 2 2 k 1 + k 2 2 where k i is the degree of the i th argument of the edges as they appear in an enumeration of the edges.

network null- Network structures are always relative...... one has to be clear about what to compare with... a null model Null model 1: random graphs (Poisson random graphs, Erdős-Rényi graphs) Null model 2: random graphs constrained to the set of degrees of the original graph

network null- Network structures are always relative...... one has to be clear about what to compare with... a null model Null model 1: random graphs (Poisson random graphs, Erdős-Rényi graphs) Null model 2: random graphs constrained to the set of degrees of the original graph

network null- Network structures are always relative...... one has to be clear about what to compare with... a null model Null model 1: random graphs (Poisson random graphs, Erdős-Rényi graphs) Null model 2: random graphs constrained to the set of degrees of the original graph

network null- Network structures are always relative...... one has to be clear about what to compare with... a null model Null model 1: random graphs (Poisson random graphs, Erdős-Rényi graphs) Null model 2: random graphs constrained to the set of degrees of the original graph

random graphs for each pair of vertices, with probability p, add an edge

random graphs for each pair of vertices, with probability p, add an edge

random graphs for each pair of vertices, with probability p, add an edge

random graphs for each pair of vertices, with probability p, add an edge

random graphs for each pair of vertices, with probability p, add an edge

random graphs for each pair of vertices, with probability p, add an edge

random graphs for each pair of vertices, with probability p, add an edge

random graphs for each pair of vertices, with probability p, add an edge

random graphs for each pair of vertices, with probability p, add an edge

random graphs for each pair of vertices, with probability p, add an edge

random graphs for each pair of vertices, with probability p, add an edge

random graphs for each pair of vertices, with probability p, add an edge

random rewiring start from the original graph choose edge pairs, and swap them

random rewiring start from the original graph choose edge pairs, and swap them

random rewiring start from the original graph choose edge pairs, and swap them

random rewiring start from the original graph choose edge pairs, and swap them

random rewiring start from the original graph choose edge pairs, and swap them

random rewiring start from the original graph edge triples can be swapped too

random rewiring start from the original graph edge triples can be swapped too

random rewiring start from the original graph edge triples can be swapped too

random rewiring start from the original graph edge triples can be swapped too

why (mechanistic)? to understand the mechanisms behind network evolution to predict the future to generate test networks for studies about dynamics

why (mechanistic)? to understand the mechanisms behind network evolution to predict the future to generate test networks for studies about dynamics

why (mechanistic)? to understand the mechanisms behind network evolution to predict the future to generate test networks for studies about dynamics

why (mechanistic)? to understand the mechanisms behind network evolution to predict the future to generate test networks for studies about dynamics

model what? observed network structural quantities possible structure altering events (attacks, overload breakdowns) dynamic processes on the network interaction between such processes and network evolution

model what? observed network structural quantities possible structure altering events (attacks, overload breakdowns) dynamic processes on the network interaction between such processes and network evolution

model what? observed network structural quantities possible structure altering events (attacks, overload breakdowns) dynamic processes on the network interaction between such processes and network evolution

model what? observed network structural quantities possible structure altering events (attacks, overload breakdowns) dynamic processes on the network interaction between such processes and network evolution

model what? observed network structural quantities possible structure altering events (attacks, overload breakdowns) dynamic processes on the network interaction between such processes and network evolution

Barabási Albert model probability of attachment: k i

Barabási Albert model probability of attachment: k i

Barabási Albert model probability of attachment: k i

Barabási Albert model probability of attachment: k i

Barabási Albert model probability of attachment: k i

dynamics on networks traffic dynamics (Internet, vehicular traffic, etc.) specific signalling in biology disease spreading spreading of rumours, fads; and other threshold phenomena local search

dynamics on networks traffic dynamics (Internet, vehicular traffic, etc.) specific signalling in biology disease spreading spreading of rumours, fads; and other threshold phenomena local search

dynamics on networks traffic dynamics (Internet, vehicular traffic, etc.) specific signalling in biology disease spreading spreading of rumours, fads; and other threshold phenomena local search

dynamics on networks traffic dynamics (Internet, vehicular traffic, etc.) specific signalling in biology disease spreading spreading of rumours, fads; and other threshold phenomena local search

dynamics on networks traffic dynamics (Internet, vehicular traffic, etc.) specific signalling in biology disease spreading spreading of rumours, fads; and other threshold phenomena local search

dynamics on networks traffic dynamics (Internet, vehicular traffic, etc.) specific signalling in biology disease spreading spreading of rumours, fads; and other threshold phenomena local search

degree distribution a broad degree distribution makes a network sensitive to attacks but robust to vertex failures and robust to overload breakdowns (depends a little on dynamics) information spreads faster but there is a danger of congestion

degree distribution a broad degree distribution makes a network sensitive to attacks but robust to vertex failures and robust to overload breakdowns (depends a little on dynamics) information spreads faster but there is a danger of congestion

degree distribution a broad degree distribution makes a network sensitive to attacks but robust to vertex failures and robust to overload breakdowns (depends a little on dynamics) information spreads faster but there is a danger of congestion

degree distribution a broad degree distribution makes a network sensitive to attacks but robust to vertex failures and robust to overload breakdowns (depends a little on dynamics) information spreads faster but there is a danger of congestion

degree distribution a broad degree distribution makes a network sensitive to attacks but robust to vertex failures and robust to overload breakdowns (depends a little on dynamics) information spreads faster but there is a danger of congestion

degree distribution a broad degree distribution makes a network sensitive to attacks but robust to vertex failures and robust to overload breakdowns (depends a little on dynamics) information spreads faster but there is a danger of congestion

clustering slows down disease spreading makes memory worse in neural networks

clustering slows down disease spreading makes memory worse in neural networks

clustering slows down disease spreading makes memory worse in neural networks

assortativity high assortativity facilitates small disease outbreaks in disassortative networks outbreaks don t form easily, but if they do they can cover a larger fraction of the population

assortativity high assortativity facilitates small disease outbreaks in disassortative networks outbreaks don t form easily, but if they do they can cover a larger fraction of the population

assortativity high assortativity facilitates small disease outbreaks in disassortative networks outbreaks don t form easily, but if they do they can cover a larger fraction of the population

applications navigation system control prediction

applications navigation system control prediction

applications navigation system control prediction

applications navigation system control prediction