default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathew D. Penrose
Person information
- affiliation: University of Bath, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Mathew D. Penrose
, Xiaochuan Yang, Frankie Higgs:
Largest nearest-neighbour link and connectivity threshold in a polytopal random sample. J. Appl. Comput. Topol. 8(6): 1723-1750 (2024)
2010 – 2019
- 2018
- [j11]Mathew D. Penrose:
Inhomogeneous random graphs, isolated vertices, and Poisson approximation. J. Appl. Probab. 55(1): 112-136 (2018) - [j10]David Dereudre, Mathew D. Penrose:
On the critical threshold for continuum AB percolation. J. Appl. Probab. 55(4): 1228-1237 (2018) - 2016
- [b2]Michael Krivelevich, Konstantinos Panagiotou, Mathew D. Penrose, Colin J. H. McDiarmid:
Random Graphs, Geometry and Asymptotic Structure. London Mathematical Society student texts 84, Cambridge University Press 2016, ISBN 978-1-316-50191-7, pp. 1-122 - [j9]Mathew D. Penrose:
The strong giant in a random digraph. J. Appl. Probab. 53(1): 57-70 (2016) - 2014
- [j8]Mathew D. Penrose:
Continuum AB percolation and AB random geometric graphs. J. Appl. Probab. 51(A): 333-344 (2014) - 2013
- [j7]Günter Last, Mathew D. Penrose:
Percolation and limit theory for the poisson lilypond model. Random Struct. Algorithms 42(2): 226-249 (2013) - 2010
- [j6]Mathew D. Penrose:
Discussant of Response to the Computer Journal Lecture by Francois Baccelli. Comput. J. 53(5): 610-611 (2010)
2000 – 2009
- 2008
- [j5]Mathew D. Penrose, Andrew R. Wade:
Limit theory for the random on-line nearest-neighbor graph. Random Struct. Algorithms 32(2): 125-156 (2008) - 2006
- [i1]T. Schreiber, Mathew D. Penrose, Joseph E. Yukich:
Gaussian limits for multidimensional random sequential packing at saturation (extended version). CoRR abs/math/0610680 (2006) - 2003
- [b1]Mathew D. Penrose:
Random Geometric Graphs. Oxford University Press 2003, ISBN 9780198506263 - 2001
- [j4]Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna:
Approximating Layout Problems on Random Geometric Graphs. J. Algorithms 39(1): 78-116 (2001) - 2000
- [j3]Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna:
Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs. Comb. Probab. Comput. 9(6): 489-511 (2000)
1990 – 1999
- 1999
- [j2]Mathew D. Penrose:
On k-connectivity for a geometric random graph. Random Struct. Algorithms 15(2): 145-164 (1999) - [c2]Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna:
Layout Problems on Lattice Graphs. COCOON 1999: 103-112 - [c1]Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna:
Linear Orderings of Random Geometric Graphs. WG 1999: 291-302 - 1998
- [j1]Mathew D. Penrose:
Random minimal spanning tree and percolation on the N-cube. Random Struct. Algorithms 12(1): 63-82 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
