Plum Pudding Models for Growing Small-World Networks

Slides:



Advertisements
Similar presentations
Routing in Poisson small-world networks A. J. Ganesh Microsoft Research, Cambridge Joint work with Moez Draief.
Advertisements

Peer-to-Peer and Social Networks Power law graphs Small world graphs.
Complex Networks Advanced Computer Networks: Part1.
Purnamrita Sarkar (Carnegie Mellon) Deepayan Chakrabarti (Yahoo! Research) Andrew W. Moore (Google, Inc.)
1 Analyzing Kleinberg’s Small-world Model Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.
‘Small World’ Networks (An Introduction) Presenter : Vishal Asthana
Collective Dynamics of ‘Small World’ Networks C+ Elegans: Ilhan Savut, Spencer Telford, Melody Lim 29/10/13.
The A-tree: An Index Structure for High-dimensional Spaces Using Relative Approximation Yasushi Sakurai (NTT Cyber Space Laboratories) Masatoshi Yoshikawa.
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
Analysis and Modeling of Social Networks Foudalis Ilias.
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
It’s a Small World by Jamie Luo. Introduction Small World Networks and their place in Network Theory An application of a 1D small world network to model.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
The Impact of Imperfect Information on Network Attack Andrew Melchionna (University of Rochester) Jesús Caloca (Boise State University) Advisors: S. Squires,
Information Networks Small World Networks Lecture 5.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
1 Analyzing Kleinberg’s (and other) Small-world Models Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.
Search in a Small World JIN Xiaolong Based on [1].
Purnamrita Sarkar (UC Berkeley) Deepayan Chakrabarti (Yahoo! Research) Andrew W. Moore (Google, Inc.) 1.
Advanced Topics in Data Mining Special focus: Social Networks.
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.
Ji-Yong Shin * Bernard Wong +, and Emin Gün Sirer * * Cornell University + University of Waterloo 2 nd ACM Symposium on Cloud ComputingOct 27, 2011 Small-World.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial
Purnamrita Sarkar (Carnegie Mellon) Deepayan Chakrabarti (Yahoo! Research) Andrew W. Moore (Google, Inc.)
Author: M.E.J. Newman Presenter: Guoliang Liu Date:5/4/2012.
Section 8 – Ec1818 Jeremy Barofsky March 31 st and April 1 st, 2010.
LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.
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.
Network Characterization via Random Walks B. Ribeiro, D. Towsley UMass-Amherst.
1 presentation of article: Small-World File-Sharing Communities Article: Adriana Iamnitchi, Matei Ripeanu, Ian Foster Presentation: Periklis Akritidis.
MEDUSA – New Model of Internet Topology Using k-shell Decomposition Shai Carmi Shlomo Havlin Bloomington 05/24/2005.
1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi.
Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Xiaowei Ying, Xintao Wu Univ. of North Carolina at Charlotte PAKDD-09 April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks.
1 The Other Kind of Networking: Social Networks on the Web Dr. Jennifer Golbeck University of Maryland, College Park March 20, 2006.
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
1 Costas Busch Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks Costas Busch Rensselaer Polytechnic Institute.
381 Self Organization Map Learning without Examples.
1 CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014 Network models Tamer Kahveci.
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Simulating the Social Processes of Science Leiden| 9 April 2014 INGENIO [CSIC-UPV] Ciudad Politécnica de la Innovación | Edif 8E 4º Camino de Vera s/n.
Siddhartha Gunda Sorabh Hamirwasia.  Generating small world network model.  Optimal network property for decentralized search.  Variation in epidemic.
Class 4: It’s a Small World After All Network Science: Small World February 2012 Dr. Baruch Barzel.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Random Walk for Similarity Testing in Complex Networks
Structures of Networks
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Peer-to-Peer and Social Networks
Milgram’s experiment really demonstrated two striking facts about large social networks: first, that short paths are there in abundance;
Prof. Carolina Ruiz Department of Computer Science
The Watts-Strogatz model
Theoretical Justification of Popular Link Prediction Heuristics
Shortest path and small world effect
Department of Computer Science University of York
Lecture 9: Network models CS 765: Complex Networks
NETWORKS.
Network Science: A Short Introduction i3 Workshop
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Other Random Graph Models
Prof. Carolina Ruiz Department of Computer Science
Presentation transcript:

Plum Pudding Models for Growing Small-World Networks Ari Zitin (University of North Carolina), Alex Gorowara (Worcester Polytechnic Institute) S. Squires, M. Herrera, T. Antonsen, M. Girvan, E. Ott (University of Maryland) Image Credit to transductions.net

Motivation and Background Small-World Networks Path lengths are short (grow logarithmically or slower with the number of nodes N) Clustering (probability that a node's neighbors are connected to each other) is high Real networks grow in spatial dimensions Neurological and cellular networks exist, expand, and connect in three dimensions of space The formation of new connections between nodes is limited by proximity Lattice Small-world model Random Image from Watts-Strogatz Nature 1998

Our Models We place new nodes in a ball (the Plum Pudding Network Model) or on a sphere (the Thomson Network Model) of d dimensions Each new node connects to its m nearest neighbors Nodes repel each other until they achieve a roughly uniform spatial distribution Image from Wikimedia Commons

1-Dimensional Thomson Network Images from Ozik et. al. Physical Review E 2004

Addition of a New Node to the 2-D Plum Pudding Network

Path Length is Logarithmic in Plum Pudding Network Model

Clustering Decays with Dimension in Plum Pudding Network Model High Clustering Low Clustering

General Results Different models (Plum vs. Thomson) of the same dimension have similar characteristics Some contribution due to edge effects Consistent small-world characteristics Logarithmic path length, asymptotic clustering Substantial differences due to dimension Approaches “dimensionless” behavior as the dimension grows large Applications to neuronal networks

With Thanks to J. J. Thomson Image from Wikimedia Commons