Recent & Upcoming Talks

2021

Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes

I will present a joint work (in progress) with Daniel Dadush, Uri Grupel, Sophie Huiberts and Galyna Livshyts. The combinatorial …
Nov 26, 2021 4:00 PM
Gilles Bonnet (University of Groningen)

Semi-random process

The semi-random graph process is a single-player game that begins with an empty graph on n vertices. In each round, a vertex u is …
Nov 19, 2021 4:00 PM
Paweł Prałat (Ryerson University)

Convex characters, algorithms and matchings

A phylogenetic (i.e. evolutionary) tree is an unrooted binary tree T in which the leaves are in bijection with a set of labels X, where …

Nov 12, 2021 4:00 PM
Steven Kelk (Department of Data Science and Knowledge Engineering (DKE), Maastricht University)

Poisson process approximation under stabilization and Palm coupling

We present some Poisson process approximation results for stabilizing functionals of Poisson (or Binomial) processes that arise in …
Oct 22, 2021 4:00 PM
D. Yogeshwaran (Indian Statistical Institute, Bangalore)

The jump of the clique chromatic number of random graphs

The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is …
Oct 8, 2021 4:00 PM
Dieter Mitsche (Institut Camille Jordan UMR CNRS-UNS)

The threshold for simple-connectedness in hypercube percolation

We study the fundamental group of certain random 2-dimensional cubical complexes. We show a 2-dimensional generalization of a theorem …
Oct 1, 2021 4:00 PM
Elliot Paquette (McGill University)

Contact process on low-rank graphs

In this talk I will introduce the contact process for general infection matrices (which is slightly more general than graphs) as a …
Jun 11, 2021 4:00 PM
Eric Cator (Radboud University)

Height function delocalisation on cubic planar graphs

We consider models of integer-valued height functions on shift-invariant planar graphs whose maximum degree is three. We prove …
May 28, 2021 4:00 PM
Piet Lammers (IHES Paris)

What do the strongly connected components of a large directed graph with i.i.d. degree tuples look like?

Universal scaling limits of random graph models can be considered the Central Limit Theorems of graph theory and have attracted a lot …
May 21, 2021 4:00 PM
Serte Donderwinkel (University of Oxford)

Percolation of worms

We consider the following correlated percolation model on the d dimensional lattice Z^d, d >=5. From each vertex of Z^d, we start …
May 14, 2021 4:00 PM
Balázs Ráth (Budapest University of Technology)

Statistical learning and inference for spatiotemporal data

In this presentation, I will talk about what we as a statistician can do for our society and how we can help to find solutions for …
Apr 30, 2021 4:00 PM
Jun Yu (Umeå University)

Perfect matchings in the random bipartite geometric graph.

We consider the standard random bipartite geometric graph process in which n red vertices and n blue vertices are placed at …
Apr 16, 2021 4:00 PM
Xavier Pérez Giménez (University of Nebraska-Lincoln)

Dyson models with random boundary conditions

I discuss the low-temperature behaviour of Dyson models (long-range Ising models in one dimension) in the presence of random boundary …
Apr 9, 2021 4:00 PM
Aernout van Enter (University of Groningen)

Extremal stationary values for random digraphs

In this talk, we will discuss the extremal values of the stationary distribution of a random walk on a directed random graph with given …
Mar 19, 2021 4:00 PM
Guillem Perarnau (Universitat Politècnica de Catalunya)

Percolation on hyperbolic Poisson-Voronoi tessellations

I will discuss percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. That …
Feb 25, 2021 5:00 PM
Tobias Müller (University of Groningen)

Maximum likelihood estimation in stochastic channel models

We propose Monte Carlo maximum likelihood estimation as a novel approach in the context of calibration and selection of stochastic …
Feb 23, 2021 1:15 PM
Christian Hirsch (University of Groningen)

Improved network reconstruction with shrinkage-based Gaussian graphical models

Gaussian graphical models (GGMs) are undirected network models where the nodes represent the random variables and the edges their …
Feb 12, 2021 4:00 PM
Victor Bernal (University of Groningen)

Stochastic modelling of COVID-19 spread in Italy

Italy was particularly hard hit during COVID-19 pandemic and the aim of this work is to describe the dynamics of infections within each …
Jan 22, 2021 4:00 PM
Luca del Core (University of Groningen)

Non Homogeneous Dynamic Bayesian Network Models

One of the main objectives of systems biology is to learn network topologies from gene expression time series. The ultimate goal is to …
Jan 8, 2021 4:00 PM
Abdul Salam (University of Groningen)

2020

Sharp thresholds for Glauber dynamics percolation

Sharp threshold is a phenomena that characterizes abrupt change of behavior in a phase transition. In this talk, we prove that the …
Dec 11, 2020 4:00 PM
Rangel Baldasso (University of Leiden)

A class of stick breaking models

(Joint work with Krishanu Maulik and Subhabrata Sen). We start with a white stick of unit length and for a uniformly chosen point, we …
Nov 27, 2020 4:00 PM
Deepan Basu (University of Groningen)

Graph theoretical design strategies for tile-based DNA self-assembly

Recent advances in DNA self-assembly have resulted in increasingly sophisticated nanoscale wire-frame structures that can be modeled by …
Oct 23, 2020 4:00 PM
Jo Ellis-Monaghan (University of Amsterdam)

The contact process on random hyperbolic graphs

We consider the contact process on the model of hyperbolic random graph, in the regime when the degree distribution obeys a power law …
Oct 9, 2020 4:00 PM
Daniel Valesin (University of Groningen)

The weight-dependent random connection model

We investigate a large class of random graphs on the points of a Poisson process in d-dimensional space, which combine scalefree degree …
Sep 25, 2020 4:00 PM
Markus Heydenreich (LMU Munich)

Large deviation estimates for subsets of size conditioned Galton-Watson trees

We prove a Large Deviation Principle for the logarithmic number of subtrees of size conditioned Galton-Watson trees, provided that two …
Sep 18, 2020 4:00 PM
Daniel Willhalm (University of Groningen)

Functional CLT for persistent Betti numbers on point processes and networks

Persistent Betti numbers form a key tool in topological data analysis as they track the appearance and disappearance of topological …
Sep 4, 2020 4:00 PM
Christian Hirsch (University of Groningen)