Grafos

© All Rights Reserved

0 views

Grafos

© All Rights Reserved

- Hamed Hatami, Svante Janson, Balázs Szegedy - Graph properties, graph limits and entropy (arXiv, 2013, December 19th)
- miningce
- TLee_WISC05
- 9 Shortest Paths
- ChinTaejin(0112)
- Stavros Garoufalidis and Roland Van Der Veen- Asymptotics of Quantum Spin Networks at a Fixed Root of Unity
- p221-gabow
- Graph Coloring
- 404 Matsunaga
- 1753-4631-1-3
- 2002-10-17
- 2012 - A Rotation and Scale Invariance Face Recognition Method Based on Complex Network and Image Contour
- Community Detection in Networks Using Page Rank Vectors
- cse213_lecture16
- Using Linear Algebra to Solve Graph Problems
- hw3-soln.pdf
- Secchi
- 1710__04217
- Zumning Feng, Yi Sun - USA and International Mathematical Olympiads 2007-2008 - 76p.pdf
- Hello

You are on page 1of 38

Measuring Networks

Networks Models

Some other concepts

Flavia Bonomo

Introduction

Measuring Networks

Networks Models

Some other concepts

What is a network?

Network: a collection of entities that are interconnected with

links. For example:

computers that are interconnected

web pages that point to each other

proteins that interact

In terms of graph theory, the entities are called vertices and the

links edges.

Introduction

Measuring Networks

Networks Models

Some other concepts

Large graphs of real life are called complex networks. Some of the

main questions about them are the following:

What are the statistics of real life networks?

Can we explain how the networks were generated?

Introduction

Measuring Networks

Networks Models

Some other concepts

Introduction

Measuring Networks

Networks Models

Some other concepts

More examples

Social networks:

networks of acquaintances

collaboration networks

phone-call networks

Technological networks:

the Internet

telephone networks

transportation networks

Biological networks

protein-protein interaction networks

gene regulation networks

the food web

Introduction

Measuring Networks

Networks Models

Some other concepts

Around 1999...

Watts and Strogatz, Dynamics and small-world

phenomenon

Faloutsos, Faloutsos and Faloutsos, On power-law

relationships of the Internet Topology

Kleinberg et al., The Web as a graph

Barabasi and Albert, The emergence of scaling in real

networks

Introduction

Measuring Networks

Networks Models

Some other concepts

edges incident on i

degree sequence:

[d(1), d(2), d(3), d(4), d(5)] =

[2, 2, 3, 2, 1]

degree distribution:

[(1, 1), (2, 3), (3, 1)]

Introduction

Measuring Networks

Networks Models

Some other concepts

shortest path between two vertices

of the graph

Introduction

Measuring Networks

Networks Models

Some other concepts

if d(i) > 1, is the number of edges

between neighbors of i divided by

d(i)(d(i) 1)/2

if d(i) 1 can be defined as 0 or 1

clustering coefficient of vertex 3: 1/6

clustering coefficient of vertex 1: 1

Introduction

Measuring Networks

Networks Models

Some other concepts

Betweenness centrality: number of short paths going through

a vertex.

Communities: can one identify cliques within the network?

Correlations between degree and other quantities.

Local motifs: What is the structure of the building blocks of

complex networks?

Motifs: Subgraphs that have a significantly higher density in

the observed network than in the randomizations of the same.

Assortativity: do highly-connected nodes preferentially

connect to other highly-connected nodes?

Introduction

Measuring Networks

Networks Models

Some other concepts

Assortativity

A network is said to be assortatively mixed by degree if high

degree vertices tend to connect to other high degree vertices.

A network is disassortatively mixed by degree if high degree

vertices tend to connect to low degree vertices.

Introduction

Measuring Networks

Networks Models

Some other concepts

Most vertices have only a small number of neighbors (degree),

but there are some vertices with very high degree (power-law

degree distribution)

scale-free networks

If a vertex x is connected to y and z, then y and z are likely

to be connected

high clustering coefficient

Most vertices are just a few edges away on average.

small world networks

Networks from very diverse areas (from internet to biological

networks) have similar properties

Is it possible that there is a unifying underlying generative

process?

Introduction

Measuring Networks

Networks Models

Some other concepts

each edge is generated independently with probability p

Very well studied model but:

most vertices have about the same degree

the probability of two nodes being linked is independent of

whether they share a neighbor

the average paths are short

Real life networks are not random in this sense of

randomness.

Can we define a model that generates graphs with statistical

properties similar to those in real life?

Introduction

Measuring Networks

Networks Models

Some other concepts

Degree distributions

degree k = probability of a

randomly selected node to

have degree k

Problem: find the

probability distribution that

best fits the observed data.

Introduction

Measuring Networks

Networks Models

Some other concepts

Degree distribution

These graphs have the same degree distribution but their diameter,

modularity and robustness are very different.

Flavia Bonomo Introduction to complex networks

Introduction

Measuring Networks

Networks Models

Some other concepts

Power-law distributions

The degree distributions of most real-life networks follow a

power law

P(k) = Ck

degree (hubs)

scale-free: no characteristic scale, average is not informative.

In contrast with the random graph model!

Poisson degree distribution

(np)k np

P(k) = e

k!

highly concentrated around the mean

the probability of very high degree nodes is exponentially small

Flavia Bonomo Introduction to complex networks

Introduction

Measuring Networks

Networks Models

Some other concepts

Power-law signature

Introduction

Measuring Networks

Networks Models

Some other concepts

distribution with exponent 2.1

Out-degree distribution: Power-law

distribution with exponent 2.7

The fact that the exponent is

greater than 2 implies that the

expected value of the degree is a

constant (not growing with n).

Therefore, the expected number of

edges is linear in the number of

vertices n.

Introduction

Measuring Networks

Networks Models

Some other concepts

Introduction

Measuring Networks

Networks Models

Some other concepts

Expected degrees

Average degree:

For random graphs: np.

For scale-free graphs, it is constant if 2, and it diverges if

< 2.

Maximum degree:

For random graphs, the maximum degree is highly

concentrated around the average degree.

For scale-free graphs kmax n1/(1) .

Introduction

Measuring Networks

Networks Models

Some other concepts

Connected components

connected components, in particular, is there a giant

component?

Network Resilience: Study how the graph properties change

when performing random or targeted node deletions.

Introduction

Measuring Networks

Networks Models

Some other concepts

Motifs

global measurements... can we say something about the local

structure of the networks?

Motifs: Find small subgraphs that over-represented in the

network.

Finding interesting motifs: Count the frequency of the motifs

of interest and compare against the frequency of the motif in

a random graph with the same number of nodes and the same

degree distribution.

Introduction

Measuring Networks

Networks Models

Some other concepts

rewire two edges. Repeat many times.

compare characteristic measured from a real network with those of

randomized ones with the same degree distribution, for example,

the presence of motifs.

Introduction

Measuring Networks

Networks Models

Some other concepts

deterministic) for generating a graph

Models of static graphs

input: a set of parameters , and the size of the graph n

output: a graph G (, n)

Models of evolving graphs

input: a set of parameters , and an initial graph G0

output: a graph Gt for each time t

Introduction

Measuring Networks

Networks Models

Some other concepts

input: the degree sequence [d1 , d2 , . . . , dn ]

process:

I Create di copies of vertex i

I Take a random matching (pairing) of the copies, and then

there will be one link from i to j for each link from a copy of i

to a copy of j.

I Self-loops and multiple edges are allowed.

Introduction

Measuring Networks

Networks Models

Some other concepts

Example

Suppose that the degree sequence is

network

Introduction

Measuring Networks

Networks Models

Some other concepts

number of edges m

process: generate edge (i, j) with probability di dj /m

preserves the expected degrees

easier to analyze.

Introduction

Measuring Networks

Networks Models

Some other concepts

networks.

each new paper is generated with m citations (mean)

new papers cite previous papers with probability proportional

to their indegree (citations) plus one (to give some chance to

papers with no citations).

Power law with exponent = 2 + 1/m.

The Barabasi-Albert model is similar and results in power law

with exponent = 3.

Introduction

Measuring Networks

Networks Models

Some other concepts

Start with a ring, where every vertex is connected to the next

z vertices.

With probability p, rewire two edges (or, add a shortcut to a

uniformly chosen destination).

diameter.

Flavia Bonomo Introduction to complex networks

Introduction

Measuring Networks Gossip and Epidemics

Networks Models Fractal dimension of scale-free networks

Some other concepts

Spread in networks

failures etc) is one of the driving forces behind network analysis.

Introduction

Measuring Networks Gossip and Epidemics

Networks Models Fractal dimension of scale-free networks

Some other concepts

Percolation in networks

as occupied or not-occupied. We are interested in measuring

the size of the largest connected component of non-occupied

vertices.

Bond Percolation: Each edge of the network is randomly set

as occupied or not-occupied. We are interested in measuring

the size of the largest component of vertices connected by

non-occupied edges.

Good model for failures or attacks.

Introduction

Measuring Networks Gossip and Epidemics

Networks Models Fractal dimension of scale-free networks

Some other concepts

Percolation threshold

network to not have a giant component? (the network does

not percolate).

For scale free graphs of power law exponent less than 3, there

is always a giant component (the network always percolates).

But... if the vertices are removed preferentially (according to

degree), then it is easy to disconnect a scale free graph by

removing a small fraction of the vertices.

Scale-free graphs are resilient to random attacks, but sensitive

to targeted attacks. For random networks there is smaller

difference between the two.

Introduction

Measuring Networks Gossip and Epidemics

Networks Models Fractal dimension of scale-free networks

Some other concepts

In a recent work (C. Song, S. Havlin and H. A. Makse, 2005),

the authors identify for some complex networks a power law

relation between the number of boxes needed to cover the

network and the size of the box, which defines a finite fractal

dimension.

A box of size k in a graph is a subset of vertices pairwise at

distance at most k.

We need the minimum number of boxes: NP-hard

optimization problem! (clique covering in G k ). They use

some heuristics.

Introduction

Measuring Networks Gossip and Epidemics

Networks Models Fractal dimension of scale-free networks

Some other concepts

Introduction

Measuring Networks Gossip and Epidemics

Networks Models Fractal dimension of scale-free networks

Some other concepts

Fractal networks:

WWW, biological networks.

Are characterized by the relation

NB (`B )/n `d

B

B

NB (`B ) is the minimum number of boxes

of size `B necessary to cover the

network.

Are disassortative.

Non-Fractal networks:

Internet, social networks (citations,

IMDB), models based on uncorrelated

preferential attachment.

Are assortative.

Introduction

Measuring Networks Gossip and Epidemics

Networks Models Fractal dimension of scale-free networks

Some other concepts

as a single vertex and ask what is the degree distribution of the

network of boxes at different scales ?

The scale-free degree distribution is invariant under this

renormalization.

Internet is not fractal, but it is renormalizable.

Introduction

Measuring Networks Gossip and Epidemics

Networks Models Fractal dimension of scale-free networks

Some other concepts

Introduction

Measuring Networks Gossip and Epidemics

Networks Models Fractal dimension of scale-free networks

Some other concepts

Mariano Sigman, for some ideas for this talk.

- Hamed Hatami, Svante Janson, Balázs Szegedy - Graph properties, graph limits and entropy (arXiv, 2013, December 19th)Uploaded byTommaso Cimino
- miningceUploaded byapi-19969042
- TLee_WISC05Uploaded bytlee2scribd
- 9 Shortest PathsUploaded byFaiznor Aishah
- ChinTaejin(0112)Uploaded byHarta Wijaya
- Stavros Garoufalidis and Roland Van Der Veen- Asymptotics of Quantum Spin Networks at a Fixed Root of UnityUploaded byLopmaz
- p221-gabowUploaded byWisllay Vitrio
- Graph ColoringUploaded bytutorciecleteam
- 404 MatsunagaUploaded byYermakov Vadim Ivanovich
- 1753-4631-1-3Uploaded byমেঘে ঢাকা তারা
- 2002-10-17Uploaded byapi-168623254
- 2012 - A Rotation and Scale Invariance Face Recognition Method Based on Complex Network and Image ContourUploaded byLuiGy Machaca
- Community Detection in Networks Using Page Rank VectorsUploaded byijbbjournal
- cse213_lecture16Uploaded byketer
- Using Linear Algebra to Solve Graph ProblemsUploaded byGo Bluth
- hw3-soln.pdfUploaded byPhilip Mak
- SecchiUploaded byPaperino Paperut
- 1710__04217Uploaded byhuevonomar05
- Zumning Feng, Yi Sun - USA and International Mathematical Olympiads 2007-2008 - 76p.pdfUploaded byElliot
- HelloUploaded byTwinkal Meena
- Complex Brain NetworksUploaded byRakesh Sharma
- Paper38 Rani JCMCCUploaded byRemelyn R. Llurca
- Total Eccentricity Index of Some Composite GraphsUploaded byBalachandran
- LabProgsUploaded bySuper Man

- ontolog-social-web-keynote.pdfUploaded byAngelRibeiro10
- You Only Look Once - Unified, Real-Time Object Detection ( J Redmon Et Al 2016)Uploaded byDavid Budaghyan
- CompositionUploaded byAngelRibeiro10
- The Polyglot ProjectUploaded byroutrhead
- Ontolog Social Web KeynoteUploaded byAngelRibeiro10
- ML InterperatabilityUploaded byrcoca_1
- A Survey of Heterogeneous Information Network AnalysisUploaded byAngelRibeiro10
- Biopython_Tutorial.pdfUploaded byAngelRibeiro10
- Language, Music and Computing - Mitrenina, Eds - 2019.pdfUploaded byAngelRibeiro10
- Guide to Unconventional Computing for MusicUploaded bySonnenschein
- Fundamentals of Algorithmics Brassard InglesUploaded byTusharVatsa
- egc2013_tutoriel_MissaouiUploaded byAngelRibeiro10
- Review Text BasedUploaded byAngelRibeiro10
- Overlap Coefficient - WikipediaUploaded byAngelRibeiro10
- inplementar.pdfUploaded byAngelRibeiro10
- Text MiningUploaded byAngelRibeiro10
- Jacard vs PMIUploaded byAngelRibeiro10
- Redes Complexas 2Uploaded byAngelRibeiro10
- book_270.pdfUploaded bygerman2210
- Sound LabUploaded byAngelRibeiro10
- How to Use the Hungarian Algorithm_ 10 Steps (With Pictures)Uploaded byAngelRibeiro10
- Introduction to Computer Programming With MATLABUploaded byAngelRibeiro10
- acustica.txtUploaded byAngelRibeiro10
- jumping-nlp-curves.pdfUploaded byAngelRibeiro10
- natural language processingUploaded byAngelRibeiro10
- Programa Escola RCUploaded byAngelRibeiro10
- Beethoven's Letters. (1790--1826.) Vol. iUploaded byAngelRibeiro10
- Gary OldmanUploaded byAngelRibeiro10

- 20.pdfUploaded byRevanKumarBattu
- Midterm 12 SolUploaded byShinee Jayasilan
- STRIPPING.pdfUploaded byLuAlvarado
- 1-s2.0-S1385894713013351-main[1] Copy.pdfUploaded bymala saputri
- P&IDUploaded byMustika Saraswati
- Sr. Cbse Test Paper ChemistryUploaded byHimanshu Ranjan
- Tier 1 Bridge Heavy Load Assessment Criteria -2013 (Main Road)Uploaded byyyanan1118
- Directional Drilling PPIUploaded byironeous
- Abraham Pais-Niels Bohr's Times,_ in Physics, Philosophy, And Polity-Oxford University Press, USA (1994)Uploaded byClaudio Daniel
- 1983, Holst T. L., Numerical Computation of Transonic Flow Governed by the Full-Potential Equation, NASA TM 84310.pdfUploaded byAnatoli Krasilnikov
- 1995-Water-In-oil Emulsion Formation a Review of Physics and Mathematical Modelling. Merv Fingas.Uploaded bySilvia Nathalia Contreras
- 11th Chemistry Model PaperUploaded byAnonymous Hu2yVNTu
- CHAPTER 1 - Actuators in Automation SystemUploaded bynurliyana
- Can Plantar Pressure Predict Foot Motion - Friso HagmanUploaded byAngel Javier Vazquez Lopez
- cp organicsUploaded byClarence AG Yue
- strain.pdfUploaded byChandra Clark
- MEMS 411 Morphing Wing RC Glider Senior Design Project.pdfUploaded byAnilkumar Naidu
- Analysis of the Drilling of Attack Angle EffectUploaded byGabriel Giraldo
- Allowable Drift or Side Sway Calculation According to Diff CodeUploaded byKawser Hossain
- Oil Demulsifier Selection and OptimizationUploaded byAhmed Abu-Alhareth
- Beam EquationsUploaded byAhmed Abotoor
- Worksheet Medium Work Energy ProblemsUploaded byIsrael Lives
- E 494 – 95 (Reapproved 2001) Std. Practice for Measuring Ultrasonic Velocity in Materials1.pdfUploaded byJORGE ARTURO TORIBIO HUERTA
- 1 friction generatedUploaded bygriffone1
- Ece471 Hw1 SolUploaded bySaied Aly Salamah
- Primitive Equation Sigma Coordinates TransformationUploaded byMisael Cardozo
- FEM&BestpracticesUploaded byHem A
- UB as ColumnsUploaded bysuvra
- Film Thickness Variation About a T-junctionUploaded bySam Ban
- 9 ELECTRONIC REINFORCEMENT OF SOUND.pptUploaded byMadeRadit

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.