Conference Agenda
Overview and details of the sessions of this conference. Please select a date or location to show only sessions at that day or location. Please select a single session for detailed view (with abstracts and downloads if available).
Location indicates the building first and then the room number!
Click on "Floor plan" for orientation in the builings and on the campus.
|
|
|
Session Overview |
| Session | ||
S 4 (8): Limit theorems, large deviations and extremes
Session Topics: 4. Limit theorems, large deviations and extremes
| ||
    | ||
3:50 pm - 4:15 pm
Percolation and geometry of Cayley graphs University of Münster
We use invariant percolation to understand geometry of finitely generated groups. More concretely, our incentive will be to characterize geometric properties of groups by constructing suitably dependent percolation models on their Cayley graphs and examining two competing properties, namely large marginals and decaying connectivity. A quantified relation between these two properties will also characterize large scale geometric properties of connected, locally finite graphs. Joint work with Konstantin Recke (Münster).
4:15 pm - 4:40 pm
Stein's Method for Networks University of Oxford
A network, or graph, can be viewed by way of its adjacency matrix, which is a random matrix. We used Stein's density method in order to derive univariate Stein operators for random graphs. We then give an explicit solution to the resulting Stein equation, and use it to derive distributional limit results for certain types of graphs.
| ||
Contact and Legal Notice · Contact Address:  Conference: GPSD 2025 |
Conference Software: ConfTool Pro 2.8.105 © 2001–2025 by Dr. H. Weinreich, Hamburg, Germany |