Mathew D. Penrose

University of Bath — United Kingdom

Mathematics · Physical Sciences

32h-index6.8kcitations183works0.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Stochastic processes and statistical mechanics(102), Point processes and geometric inequalities(58), Random Matrices and Applications(44), Markov Chains and Monte Carlo Methods(30), Bayesian Methods and Mixture Models(20)

Publications183 total

On k-clusters of high-intensity random geometric graphs
Stochastic Processes and their Applications·2026Open Access
Fluctuations of the connectivity threshold and largest nearest-neighbour link
The Annals of Applied Probability·2025
Random coverage of a manifold with boundary
arXiv (Cornell University)·2025Open Access
Covering One Point Process with Another
Methodology And Computing In Applied Probability·2025· 1 citedOpen Access
On the components of random geometric graphs in the dense limit
arXiv (Cornell University)·2025Open Access
Largest Component and Sharpness in Subcritical Continuum Percolation
arXiv (Cornell University)·2024Open Access
Fluctuations of the connectivity threshold and largest nearest-neighbour link
arXiv (Cornell University)·2024Open Access
Corrections: On the capacity functional of the infinite cluster of a Boolean model
The Annals of Applied Probability·2024· 1 citedOpen Access
Random coverage from within with variable radii, and Johnson-Mehl cover times
arXiv (Cornell University)·2024Open Access
On the rate of convergence in the Hall-Janson coverage theorem
arXiv (Cornell University)·2024Open Access
Covering one point process with another
arXiv (Cornell University)·2024Open Access
Largest nearest-neighbour link and connectivity threshold in a polytopal random sample
Journal of Applied and Computational Topology·2023· 4 citedOpen Access
Random Euclidean coverage from within
Probability Theory and Related Fields·2023· 15 citedOpen Access
Largest nearest-neighbour link and connectivity threshold in a polytopal random sample
arXiv (Cornell University)·2023Open Access
On $k$-clusters of high-intensity random geometric graphs
arXiv (Cornell University)·2022Open Access
Giant component of the soft random geometric graph
arXiv (Cornell University)·2022Open Access
Giant component of the soft random geometric graph
Electronic Communications in Probability·2022· 5 citedOpen Access
Limit theory of combinatorial optimization for random geometric graphs
The Annals of Applied Probability·2021· 1 citedOpen Access
Random Euclidean coverage from within
arXiv (Cornell University)·2021Open Access
Untitled
Pure (University of Bath)·2020· 8 citedOpen Access
page 1 of 10Next →

Frequent Co-authors

J. E. Yukich(7), Günter Last(6), Josep Dı́az(2), Jordi Petit(2), Marı́a Serna(2), Andrew R. Wade(2), Matthias Schulte(2), Christoph Thäle(2), Norbert Henze(1), Ágoston Pisztora(1), Ronald Meester(1), Anish Sarkar(1), T. Schreiber(1), Aidan Sudbury(1), Zhidong Bai(1), Sung Chul Lee(1), Antoine Gloria(1)