Mathew D. Penrose

Affiliations:
  • University of Bath, UK


According to our database1, Mathew D. Penrose authored at least 16 papers between 1998 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Inhomogeneous random graphs, isolated vertices, and Poisson approximation.
J. Appl. Probab., 2018

On the critical threshold for continuum AB percolation.
J. Appl. Probab., 2018

2016
The strong giant in a random digraph.
J. Appl. Probab., 2016

Random Graphs, Geometry and Asymptotic Structure.
London Mathematical Society student texts 84, Cambridge University Press, ISBN: 978-1-316-50191-7, 2016

2014
Continuum AB percolation and AB random geometric graphs.
J. Appl. Probab., 2014

2013
Percolation and limit theory for the poisson lilypond model.
Random Struct. Algorithms, 2013

2010
Discussant of Response to the <i>Computer Journal Lecture</i> by Francois Baccelli.
Comput. J., 2010

2008
Limit theory for the random on-line nearest-neighbor graph.
Random Struct. Algorithms, 2008

2006
Gaussian limits for multidimensional random sequential packing at saturation (extended version)
CoRR, 2006

2003
Random Geometric Graphs.
Oxford University Press, ISBN: 9780198506263, 2003

2001
Approximating Layout Problems on Random Geometric Graphs.
J. Algorithms, 2001

2000
Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs.
Comb. Probab. Comput., 2000

1999
On k-connectivity for a geometric random graph.
Random Struct. Algorithms, 1999

Linear Orderings of Random Geometric Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Layout Problems on Lattice Graphs.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Random minimal spanning tree and percolation on the N-cube.
Random Struct. Algorithms, 1998


  Loading...