On 28th November OxTalks will move to the new Halo platform and will become 'Oxford Events' (full details are available on the Staff Gateway).
There will be an OxTalks freeze beginning on Friday 14th November. This means you will need to publish any of your known events to OxTalks by then as there will be no facility to publish or edit events in that fortnight. During the freeze, all events will be migrated to the new Oxford Events site. It will still be possible to view events on OxTalks during this time.
If you have any questions, please contact halo@digital.ox.ac.uk
Spatial random graphs provide an important framework for the analysis of relations and interactions in networks. In particular, the random geometric graph has been intensively studied and applied in various frameworks like network modeling or percolation theory.
In this talk we focus on approximation results for a generalization of the random geometric graph that consists of vertices given by a Gibbs process and (conditionally) independent edges generated from a connection function. Using Stein’s method, we compare this graph model with general spatial random graphs with respect to general integral probability metrics, providing concrete rates in the case of a suitable Wasserstein distance. We then briefly present an application of our results in the context of differential privacy. Finally, we describe how associated kernel Stein discrepancies can be used for goodness-of-fit testing in the framework of point processes and, as future work, spatial random graphs.
