Mark Walters

Connectivity of random <i>k</i>-nearest-neighbour graphs

Paul Balister, Béla Bollobás, Amites Sarkar et al. · Advances in Applied Probability · 2005 · 98 citations · Full text

Geometric Graph Theory, Nearest Neighbours, Network Science +11

Continuum percolation with steps in the square or the disc

Paul Balister, Béla Bollobás, Mark Walters · Random Structures and Algorithms · 2005 · 82 citations

Critical Area, Pattern Formation, Continuum Percolation +6

Random majority percolation

Paul Balister, Béla Bollobás, J. Robert Johnson et al. · Random Structures and Algorithms · 2009 · 40 citations

Network Science, Graph Theory, Engineering +13

A critical constant for the <i>k</i> nearest-neighbour model

Paul Balister, Béla Bollobás, Amites Sarkar et al. · Advances in Applied Probability · 2009 · 34 citations · Full text

Geometric Graph Theory, Graph Theory, Random Graph +10

Rigorous confidence intervals for critical probabilities

Oliver Riordan, Mark Walters · Physical Review E · 2007 · 30 citations · Full text