spreading random connection functions
DESCRIPTION
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. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/1.jpg)
Spreading random connection functions
Massimo Franceschetti
Newton Institute for Mathematical Sciences
April, 7, 2010joint work with
Mathew Penrose and Tom Rosoman
![Page 2: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/2.jpg)
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
![Page 3: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/3.jpg)
Bond percolation on the square grid
![Page 4: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/4.jpg)
The holy grail
![Page 5: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/5.jpg)
Site percolation on the square grid
![Page 6: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/6.jpg)
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
![Page 7: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/7.jpg)
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
![Page 8: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/8.jpg)
Poisson distribution of points of density λpoints within unit range are connected
S
D
Gilbert graph
A continuum version of a percolation model
![Page 9: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/9.jpg)
Simplest communication model
A connected component represents nodes which can reach each other along a chain of successive relayed communications
![Page 10: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/10.jpg)
The critical density
![Page 11: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/11.jpg)
The critical density
![Page 12: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/12.jpg)
Random Connection Model
![Page 13: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/13.jpg)
Simple model for unreliable communication
![Page 14: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/14.jpg)
Question
![Page 15: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/15.jpg)
The expected node degree is preserved but connections are spatially stretched
Spreading transformation
![Page 16: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/16.jpg)
Weak inequality
![Page 17: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/17.jpg)
Proof sketch of weak inequality
![Page 18: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/18.jpg)
Strict inequality
It follows that the approach to this limit is strictly monotone from above and spreading is strictly advantageous for connectivity
![Page 19: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/19.jpg)
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 Stacey’s family (see Mathew’s talk on Friday)And use of a dynamic construction of the Poisson point process and some scaling arguments
![Page 20: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/20.jpg)
Proof sketch of strict inequality
![Page 21: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/21.jpg)
Spread-out annuli
![Page 22: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/22.jpg)
Mixture of short and long edges
Edges are made all longer
Spread-out visualisation
![Page 23: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/23.jpg)
Spread-out dimension
![Page 24: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/24.jpg)
Open problems
Monotonicity of annuli-spreading and dimension-spreading Monotonicity of spreading in the discrete setting
![Page 25: Spreading random connection functions](https://reader030.vdocument.in/reader030/viewer/2022020320/56814238550346895dae54e2/html5/thumbnails/25.jpg)
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!