Dr Mark Walters
Senior Lecturer in Pure Mathematics / Director of Education
Email: m.walters@qmul.ac.ukTelephone: +44 (0)20 7882 5446Room Number: Queens’ Building, Room: W309Website: http://www.maths.qmul.ac.uk/~waltersOffice Hours: Please email for an appointment
Profile
Mark Walters is a Senior Lecturer in Pure Mathematics, and the Director of Education for the School of Mathematical Sciences. His research interests are in Combinatorics, particularly Random Combinatorics, including Percolation.
Before joining Queen Mary he completed a PhD at the University of Cambridge, and then held a research fellowship in Trinity College, Cambridge followed by a teaching fellowship at Peterhouse, Cambridge.
Research
Research Interests:
I am a member of the Combinatorics research group. I have interests in many parts of combinatorics but particularly in random combinatorial structures.
Publications
-
Balister P, Bollobas B, Gunderson K et al. (2018). RANDOM GEOMETRIC GRAPHS AND ISOMETRIES OF NORMED SPACES.
-
JOHNSON JR, Leader I, Walters M (2017). Transitive Avoidance Games.
-
Balister P, Bollobas B, Haenggi M et al. (2017). Sentry selection in senso rnetworks: theory and algorithms.
-
Balister PB, Bollobas B, Furedi Z et al. (2016). Subtended Angles.
-
Erde J, Walters M (2016). An n-in-a-row type game.
-
Russell PA, Walters M (2013). Probably Intersecting Families are Not Nested.
-
Falgas-Ravry V, Walters M (2012). SHARPNESS IN THE k-NEAREST-NEIGHBOURS RANDOM GEOMETRIC GRAPH MODEL.
-
Walters M (2012). Small components in k-nearest neighbour graphs.
-
Bollobas B, Leader I, Walters M (2012). Lion and man-can both win?.
-
Leader I, Russell PA, Walters M (2012). Transitive sets in Euclidean Ramsey theory.
-
Balogh J, Bollobas B, Krivelevich M et al. (2011). HAMILTON CYCLES IN RANDOM GEOMETRIC GRAPHS.
-
Balister P, Bollobas B, Johnson JR et al. (2010). Random Majority Percolation.
-
Balister P, Bollobas B, Sarkar A et al. (2010). SENTRY SELECTION IN WIRELESS NETWORKS.
-
Balister P, Bollobas B, Walters M (2009). RANDOM TRANSCEIVER NETWORKS.
-
Balister P, Bollobas B, Sarkar A et al. (2009). A CRITICAL CONSTANT FOR THE k-NEAREST-NEIGHBOUR MODEL.
-
Balister P, Bollobas B, Sarkar A et al. (2009). Highly connected random geometric graphs.
-
Balister P, Bollobas B, Sarkar A et al. (2008). Connectivity of a Gaussian network.
-
Balister P, Bollobas B, Haenggi M et al. (2008). Sentry selection in sensor networks: A sufficient condition for k single covers.
-
Walters M (2007). Extensions of the polynomial Hales-Jewett theorem.
-
Riordan O, Walters M (2007). Rigorous confidence intervals for critical probabilities.
-
Balister P, Bollobas B, Walters M (2005). Continuum percolation with steps in the square or the disc.
-
Balister P, Bollobas B, Sarkar A et al. (2005). Connectivity of random k-nearest-neighbour graphs.
-
WALTERS MJ, Bollobas B, Balister P (2004). Continuum percolation with steps in an annulus.