Social Networking: Large scale Networks

Slides:

Advertisements

Similar presentations

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

Advertisements

Albert-László Barabási

Network biology Wang Jie Shanghai Institutes of Biological Sciences.

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.

Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.

Synopsis of “Emergence of Scaling in Random Networks”* *Albert-Laszlo Barabasi and Reka Albert, Science, Vol 286, 15 October 1999 Presentation for ENGS.

Information Retrieval Lecture 8 Introduction to Information Retrieval (Manning et al. 2007) Chapter 19 For the MSc Computer Science Programme Dell Zhang.

Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.

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.

Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet

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

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.

Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.

Exp. vs. Scale-Free Poisson distribution Exponential Network Power-law distribution Scale-free Network.

The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.

Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.

A Real-life Application of Barabasi’s Scale-Free Power-Law Presentation for ENGS 112 Doug Madory Wed, 1 JUN 05 Fri, 27 MAY 05.

1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.

From Complex Networks to Human Travel Patterns Albert-László Barabási Center for Complex Networks Research Northeastern University Department of Medicine.

Observing Self-Organized Criticality - an approach to evolution dynamics By Won-Min Song.

Rivers of the World are Small-World Networks Carlos J. Anderson David G. Jenkins John F. Weishampel.

Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)

CS Lecture 6 Generative Graph Models Part II.

Global topological properties of biological networks.

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

Transport Properties of Fractal and Non-Fractal Scale-Free Networks

Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.

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

Error and Attack Tolerance of Complex Networks Albert, Jeong, Barabási (presented by Walfredo)

Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.

Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.

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

Graph Theory in 50 minutes. This Graph has 6 nodes (also called vertices) and 7 edges (also called links)

Nothing in (computational) biology makes sense except in the light of evolution after Theodosius Dobzhansky (1970) Power laws, scalefree networks, the.

Data Analysis in YouTube. Introduction Social network + a video sharing media – Potential environment to propagate an influence. Friendship network and.

Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.

Stefano Boccaletti Complex networks in science and society *Istituto Nazionale di Ottica Applicata - Largo E. Fermi, Florence, ITALY *CNR-Istituto.

Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.

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

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

Networks Igor Segota Statistical physics presentation.

Lars-Erik Cederman and Luc Girardin

L – Modelling and Simulating Social Systems with MATLAB Lesson 6 – Graphs (Networks) Anders Johansson and Wenjian Yu (with S. Lozano.

Complex Network Theory – An Introduction Niloy Ganguly.

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.

The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?

Complex Network Theory – An Introduction Niloy Ganguly.

LECTURE 2 1.Complex Network Models 2.Properties of Protein-Protein Interaction Networks.

Class 19: Degree Correlations PartII Assortativity and hierarchy

March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.

Anonymous communication over social networks Shishir Nagaraja and Ross Anderson Security Group Computer Laboratory.

Teachers Teaching With Technology 2010 Annual Meeting - Atlanta, GA Ray Barton, Olympus High, SLC, UT.

Information Retrieval Search Engine Technology (10) Prof. Dragomir R. Radev.

Abstract Networks. WWW (2000) Scientific Collaboration Girvan & Newman (2002)

Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.

Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.

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.

Social Networks Some content from Ding-Zhu Du, Lada Adamic, and Eytan Adar.

Structures of Networks

Models of networks (synthetic networks or generative models): Random, Small-world, Scale-free, Configuration model and Random geometric model By: Ralucca.

Social Network Analysis

Peer-to-Peer and Social Networks Fall 2017

Peer-to-Peer and Social Networks

From the Synthetic networks slide deck (didn’t have a chance to go over them at that time) By: Ralucca Gera, NPS.

Modelling Structure and Function in Complex Networks

Diffusion in Networks

Presentation transcript:

Social Networking: Large scale Networks Contents: Random Networks Vs. Scale Free Networks Preferential Attachments. Scale Free Networks: Formal Definitions. Scale Free Networks: Other Definitions Strength and Weakness of Scale Free Networks. Scale Free Networks: Examples Degree of Separation Small World Networks: Stanely Milgram’s Experiment. Small World Networks.

Random Networks Vs. Scale Free Networks Scale-free networks follow a power law distribution. The scale free model describes networks as having many nodes with only a few links and a few nodes with many links.

Scale Free Networks: Preferential Attachment

Scale Free Networks: Formal Definition

Scale Free Networks: Other Definition

The Strength and Weakness of Scale Free Networks

Scale Free Network: Examples

Degree of Separation

Small World Networks

Small World Networks

Small World Networks

Test your understanding Q1. Suppose you have two graphs (a) Social Networking site’s graph, where all members are represented as nodes and connections between them are represented as undirected edges, (b) Road network, where cities are represented as node of graph and if there exist road-path between any two cities then, it is represented as undirected edge of graph. It is possible to categorize both networks (i.e. whether scale-free of random network). If yes then what will be the merits and demerits of both networks. Q2. Can you represent the author citation network as small-world network ? Q3. Is it possible to develop scale-free networks without using preferential attachments ? Q4.Can you use the characteristics of scale-free networks for network security ? (describe)

References Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286 (1999) 509-512. Barabási, A.L., Oltvai, Z.N.: Network biology: understanding the cell's functional organization. Nat Rev Genet 5 (2004) 101-113. Bollobas, B.: Random graphs. Cambridge University Press, Cambridge (2001), ISBN: 0-521-80920-7. Barabási, A-L.; Albert, R.; and Jeong, H. "Mean-Field Theory for Scale-Free Random Networks." Physica A 272, 173-187, 1999. Milgram, Stanley (1967). "The Small World Problem". Psychology Today 1 (1): 60–67. Buchanan, Mark (2003). Nexus: Small Worlds and the Groundbreaking Theory of Networks. Norton, W. W. & Company, Inc. ISBN 0-393-32442-7.