Presentation on theme: "Spreading random connection functions Massimo Franceschetti Newton Institute for Mathematical Sciences April, 7, 2010 joint work with Mathew Penrose and."— 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
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
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
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!
Your consent to our cookies if you continue to use this website.