Download presentation

Presentation is loading. Please wait.

Published byElvis Hollands Modified over 3 years ago

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

2
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

3
Bond percolation on the square grid

4
The holy grail

5
Site percolation on the square grid

6
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

7
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

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

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

10
The critical density

12
Random Connection Model

13
Simple model for unreliable communication

14
Question

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

16
Weak inequality

17
Proof sketch of weak inequality

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

19
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

20
Proof sketch of strict inequality

21
Spread-out annuli

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

23
Spread-out dimension

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

25
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!

Similar presentations

OK

Ticket in the Door 3-29 Solving Radical Inequalities Solve the following inequalities for x. Show work! 1. 2. 3.4. 5. 6.

Ticket in the Door 3-29 Solving Radical Inequalities Solve the following inequalities for x. Show work! 1. 2. 3.4. 5. 6.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on asian continental divide Ppt on life study of mathematicians Ppt on mesoamerica and south america Ppt on different solid figures first grade Ppt on hindu religion in india Ppt on levels of management Ppt on culture of japan Ppt on semiconductor diodes Animated ppt on magnetism for kids Ppt on airbag working principle