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
-
(2018). RANDOM GEOMETRIC GRAPHS AND ISOMETRIES OF NORMED SPACES TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY.
-
(2017). Transitive Avoidance Games The Electronic Journal of Combinatorics.
-
(2017). Sentry selection in senso rnetworks: theory and algorithms INTERNATIONAL JOURNAL OF SENSOR NETWORKS.
-
(2016). Subtended Angles Israel Journal of Mathematics.
-
(2016). An n-in-a-row type game ELECTRONIC JOURNAL OF COMBINATORICS.
-
(2013). Probably Intersecting Families are Not Nested COMBINATORICS PROBABILITY & COMPUTING.
-
(2012). SHARPNESS IN THE k-NEAREST-NEIGHBOURS RANDOM GEOMETRIC GRAPH MODEL ADVANCES IN APPLIED PROBABILITY.
-
(2012). Small components in k-nearest neighbour graphs DISCRETE APPLIED MATHEMATICS.
-
(2012). Lion and man-can both win? ISRAEL JOURNAL OF MATHEMATICS.
-
(2012). Transitive sets in Euclidean Ramsey theory JOURNAL OF COMBINATORIAL THEORY SERIES A.
-
(2009). A CRITICAL CONSTANT FOR THE k-NEAREST-NEIGHBOUR MODEL ADV APPL PROBAB.
-
(2009). Highly connected random geometric graphs DISCRETE APPL MATH.
-
(2008). Connectivity of a Gaussian network INT J AD HOC UBIQ CO.
-
(2008). Sentry selection in sensor networks: A sufficient condition for k single covers 2008 INTERNATIONAL ZURICH SEMINAR ON COMMUNICATIONS.
-
(2007). Extensions of the polynomial Hales-Jewett theorem COMB PROBAB COMPUT.
-
(2007). Rigorous confidence intervals for critical probabilities PHYS REV E.
-
(2005). Continuum percolation with steps in the square or the disc RANDOM STRUCT ALGOR.
-
(2005). Connectivity of random k-nearest-neighbour graphs ADV APPL PROBAB.
-
(2004). Continuum percolation with steps in an annulus Annals of Applied Probability.