1 / 24

Information Networks

Information Networks. Power Laws and Network Models Lecture 3. Erdös-Renyi Random Graphs. For each pair of vertices (i,j), generate the edge (i,j) independently with probability p degree sequence: Binomial in the limit: Poisson real life networks: power-law distribution

tovah
Download Presentation

Information Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Information Networks Power Laws and Network Models Lecture 3

  2. Erdös-Renyi Random Graphs • For each pair of vertices (i,j), generate the edge (i,j) independently with probability p • degree sequence: Binomial • in the limit: Poisson • real life networks: power-law distribution • Low clustering coefficient: C = z/n • Short paths, but not easy to navigate • Too random… p(k) = Ck-α

  3. Departing from the ER model • We need models that better capture the characteristics of real graphs • degree sequences • clustering coefficient • short paths

  4. Graphs with given degree sequences • Assume that we are given the degree sequence [d1,d2,…,dn] • Create di copies of node i • Take a random matching (pairing) of the copies • self-loops and multiple edges are allowed • Uniform distribution over the graphs with the given degree sequence

  5. The giant component • The phase transition for this model happens when • The clustering coefficient is given by pk: fraction of nodes with degree k

  6. Power-law graphs • The critical value for the exponent α is • The clustering coefficient is • When α<7/3 the clustering coefficient increases with n

  7. A different approach • Given a degree sequence [d1,d2,…,dn], where d1≥d2≥…≥dn, there exists a simple graph with this sequence (the sequence is realizable) if and only if • There exists a connected graph with this sequence if and only if

  8. Getting a random graph • Perform a random walk on the space of all possible simple connected graphs • at each step swap the endpoints of two randomly picked edges

  9. Graphs with given degree sequence • The problem is that these graphs are too contrived • It would be more interesting if the network structure emerged as a side product of a stochastic process

  10. Power Laws • Two quantities y and x are related by a power law if • A (continuous) random variable X follows a power-law distribution if it has density function • Cumulative function

  11. Normalization constant • Assuming a minimum value xmin • The density function becomes

  12. Pareto distribution • Pareto distribution is pretty much the same but we have • and we usually we require

  13. Zipf’s Law • A random variable X follows Zipf’s law if the r-th largest value xr satisfies • Same as requiring a Pareto distribution

  14. Power laws are ubiquitous

  15. But not everything is power law

  16. Measuring power laws Simple log-log plot gives poor estimate

  17. Logarithmic binning • Bin the observations in bins of exponential size

  18. Cumulative distribution

  19. Computing the exponent • Least squares fit of a line • Maximum likelihood estimate

  20. Power-law properties • First moment • Second moment

  21. Scale Free property • A power law holds in all scale • f(bx) = g(b)p(x)

  22. The 80/20 rule • Cumulative distribution is top-heavy

  23. The discrete case

  24. References • M. E. J. Newman, The structure and function of complex networks, SIAM Reviews, 45(2): 167-256, 2003 • M. E. J. Newman, Power laws, Pareto distributions and Zipf's law, Contemporary Physics • M. Mitzenmacher, ABrief History of Generative Models for Power Law and Lognormal Distributions, Internet Mathematics • M. Mihail, N. Vishnoi ,On Generating Graphs with Prescribed Degree Sequences for Complex Network Modeling Applications, Position Paper, ARACNE (Approx. and Randomized Algorithms for Communication Networks) 2002, Rome, IT, 2002.

More Related