Spreading random connection functions Massimo Franceschetti Newton Institute for Mathematical Sciences April, 7, 2010 joint work with Mathew Penrose and.

Slides:

Advertisements

Similar presentations

Fundamental Relationship between Node Density and Delay in Wireless Ad Hoc Networks with Unreliable Links Shizhen Zhao, Luoyi Fu, Xinbing Wang Department.

Advertisements

Diffusion and Cascading Behavior in Random Networks Marc Lelarge (INRIA-ENS) Columbia University Joint CS/EE Networking Seminar June 2, 2011.

Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.

The Capacity of Wireless Networks

Scalable and Dynamic Quorum Systems Moni Naor & Udi Wieder The Weizmann Institute of Science.

Collective Dynamics of ‘Small World’ Networks C+ Elegans: Ilhan Savut, Spencer Telford, Melody Lim 29/10/13.

Secure connectivity of wireless sensor networks Ayalvadi Ganesh University of Bristol Joint work with Santhana Krishnan and D. Manjunath.

1 Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov CAIDA/UCSD Joint work with F. Papadopoulos, M.

Diffusion and Cascading Behavior in Random Networks Marc Lelarge (INRIA-ENS) WIDS MIT, May 31, 2011.

Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.

MASSIMO FRANCESCHETTI University of California at Berkeley Wireless sensor networks with noisy links.

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

Detecting Phantom Nodes in Wireless Sensor Networks Joengmin Hwang Tian He Yongdae Kim Department of Computer Science, University of Minnesota, Minneapolis.

Size of giant component in Random Geometric Graphs

Lecture 7 CS 728 Searchable Networks. Errata: Differences between Copying and Preferential Attachment In generative model: let p k be fraction of nodes.

Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.

4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.

Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.

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

Conceptual issues in scaling sensor networks Massimo Franceschetti, UC Berkeley.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 19th Lecture Christian Schindelhauer.

Towards a theory of large scale networks Massimo Franceschetti.

Building Low-Diameter P2P Networks Eli Upfal Department of Computer Science Brown University Joint work with Gopal Pandurangan and Prabhakar Raghavan.

MASSIMO FRANCESCHETTI University of California at Berkeley Ad-hoc wireless networks with noisy links Lorna Booth, Matt Cook, Shuki Bruck, Ronald Meester.

MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective.

Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.

Physical Mechanism Underlying Opinion Spreading

1 Random Walks in WSN 1.Efficient and Robust Query Processing in Dynamic Environments using Random Walk Techniques, Chen Avin, Carlos Brito, IPSN 2004.

Fast Isocontouring For Improved Interactivity Chandrajit L. Bajaj Valerio Pascucci Daniel R. Schikore.

The moment generating function of random variable X is given by Moment generating function.

MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective.

Lin Chen∗, Kaigui Bian∗, Lin Chen† Wei Yan∗, and Xiaoming Li∗

Clustering with Bregman Divergences Arindam Banerjee, Srujana Merugu, Inderjit S. Dhillon, Joydeep Ghosh Presented by Rohit Gupta CSci 8980: Machine Learning.

MASSIMO FRANCESCHETTI University of California at Berkeley Percolation of Wireless Networks.

STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.

Information Networks Power Laws and Network Models Lecture 3.

Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.

Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.

Fluid Limits for Gossip Processes Vahideh Manshadi and Ramesh Johari DARPA ITMANET Meeting March 5-6, 2009 TexPoint fonts used in EMF. Read the TexPoint.

Percolation in self-similar networks Dmitri Krioukov CAIDA/UCSD M. Á. Serrano, M. Boguñá UNT, March 2011.

Searching via Your Neighbor’s Neighbor: The Power of Lookahead in P2P Networks Moni Naor Udi Wieder The Weizmann Institute of Science Gurmeet Manku Stanford.

Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.

Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.

Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.

Networks Igor Segota Statistical physics presentation.

Efficient Labeling Scheme for Scale-Free Networks The scheme in detailsPerformance of the scheme First we fix the number of hubs (to O(log(N))) and show.

Computing with Defects

p = 0.50 Site percolation Square lattice 400 x 400

Percolation Processes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopPercolation Processes1.

Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,

March 23 & 28, Csci 2111: Data and File Structures Week 10, Lectures 1 & 2 Hashing.

March 23 & 28, Hashing. 2 What is Hashing? A Hash function is a function h(K) which transforms a key K into an address. Hashing is like indexing.

Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.

1 Use graphs and not pure logic Variables represented by nodes and dependencies by edges. Common in our language: “threads of thoughts”, “lines of reasoning”,

Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.

Percolation in self-similar networks PRL 106:048701, 2011

Brief Announcement : Measuring Robustness of Superpeer Topologies Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,

Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China

Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,

Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.

Ticket in the Door 3-29 Solving Radical Inequalities Solve the following inequalities for x. Show work!

Percolation of Clustered Wireless Networks

Models of Network Formation

Models of Network Formation

Statistical properties of network community structure

Models of Network Formation

Department of Computer Science University of York

Models of Network Formation

Introduction Wireless Ad-Hoc Network

Introducing complex networks into quantum regime

Presentation transcript:

Spreading random connection functions Massimo Franceschetti Newton Institute for Mathematical Sciences April, 7, 2010 joint work with Mathew Penrose and Tom Rosoman

The result in a nutshell In networks generated by Random Connection Models in Euclidean space, occasional long-range connections can be exploited to achieve connectivity (percolation) at a lower node density value

Bond percolation on the square grid

The holy grail

Site percolation on the square grid

Still very far from the holy grail Grimmett and Stacey (1998) showed that this inequality holds for a wide range of graphs beside the square grid

Proof of by dynamic coupling Can reach anywhere inside a green site percolation cluster via a subset of the open edges in the edge percolation model The same procedure works for any graph, not only the grid

Poisson distribution of points of density λ points within unit range are connected S D Gilbert graph A continuum version of a percolation model

Simplest communication model A connected component represents nodes which can reach each other along a chain of successive relayed communications

The critical density

Random Connection Model

Simple model for unreliable communication

Question

The expected node degree is preserved but connections are spatially stretched Spreading transformation

Weak inequality

Proof sketch of weak inequality

Strict inequality It follows that the approach to this limit is strictly monotone from above and spreading is strictly advantageous for connectivity

Main tools for the proof of The key technique is enhancement Menshikov (1987), Aizenman and Grimmett (1991), Grimmett and Stacey (1998) We also need the inequality for RCM graphs which are not included in Grimmett and Staceys family (see Mathews talk on Friday) And use of a dynamic construction of the Poisson point process and some scaling arguments

Proof sketch of strict inequality

Spread-out annuli

Mixture of short and long edges Edges are made all longer Spread-out visualisation

Spread-out dimension

Open problems Monotonicity of annuli-spreading and dimension- spreading Monotonicity of spreading in the discrete setting

Conclusion Main philosophy is to compare different RCM percolation thresholds rather than search for exact values in specific cases In real networks spread-out long-range connections can be exploited to achieve connectivity at a strictly lower density value Thank you!