Related papers: Local limits of determinantal processes

We study the adjacency matrices of random $d$-regular graphs with large but fixed degree $d$. In the bulk of the spectrum $[-2\sqrt{d-1}+\varepsilon, 2\sqrt{d-1}-\varepsilon]$ down to the optimal spectral scale, we prove that the Green's…

We extend the results of Arguin et al and A\"\i{}d\'ekon et al on the convergence of the extremal process of branching Brownian motion by adding an extra dimension that encodes the "location" of the particle in the underlying Galton-Watson…

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…

Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…

Determinantal point processes have arisen in diverse settings in recent years and have been investigated intensively. We study basic combinatorial and probabilistic aspects in the discrete case. Our main results concern relationships with…

We study the local limits of uniform high genus bipartite maps with prescribed face degrees. We prove the convergence towards a family of infinite maps of the plane, the q-IBPMs, which exhibit both a spatial Markov property and a hyperbolic…

A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d-dimensional Poisson process has a one-ended…

We consider the random graph $G_{n, {\bf d}}$ chosen uniformly at random from the set of all graphs with a given sparse degree sequence ${\bf d}$. We assume ${\bf d}$ has minimum degree at least 4, at most a power law tail, and place one…

Suppose we want to construct some structure on a bounded-degree graph, e.g., an almost maximum matching, and we want to decide about each edge depending only on its constant-radius neighborhood. We examine and compare the strengths of…

We present normal approximation results at the process level for local functionals defined on dynamic Poisson processes in $\mathbb{R}^d$. The dynamics we study here are those of a Markov birth-death process. We prove functional limit…

We continue our analysis of the number partitioning problem with $n$ weights chosen i.i.d. from some fixed probability distribution with density $\rho$. In Part I of this work, we established the so-called local REM conjecture of Bauke,…

We consider a one dimensional random-walk-like process, whose steps are centered Gaussians with variances which are determined according to the sequence of arrivals of a Poisson process on the line. This process is decorated by independent…

Rank-constrained matrix problems appear frequently across science and engineering. The convergence analysis of iterative algorithms developed for these problems often hinges on local error bounds, which correlate the distance to the…

Let $F$ be a non-discrete non-Archimedean local field. For any subset $S\subset F$ with finite Haar measure, there is a stationary determinantal point process on $F$ with correlation kernel $\widehat{\mathbb{1}}_S(x-y)$, where…

A set of vertices in a graph is a Hamiltonian subset if it induces a subgraph containing a Hamiltonian cycle. Kim, Liu, Sharifzadeh and Staden proved that among all graphs with minimum degree $d$, $K_{d+1}$ minimises the number of…

We consider a discrete-time version of a Hawkes process defined as a Poisson auto-regressive process whose parameters depend on the past of the trajectory. We allow these parameters to take on negative values, modelling inhibition. More…

The bulk scaling limit of eigenvalue distribution on the complex plane ${\mathbb{C}}$ of the complex Ginibre random matrices provides a determinantal point process (DPP). This point process is a typical example of disordered hyperuniform…

We obtain local weak limits in probability for Collapsed Branching Processes (CBP), which are directed random networks obtained by collapsing random-sized families of individuals in a general continuous-time branching process. The local…

Consider a `dense' Erd\H{o}s--R\'enyi random graph model $G=G_{n,M}$ with $n$ vertices and $M$ edges, where we assume the edge density $M/\binom{n}{2}$ is bounded away from 0 and 1. Fix $k=k(n)$ with $k/n$ bounded away from 0 and~1, and let…

We introduce a new way to sample inhomogeneous random graphs designed to have a lot of flexibility in the assignment of the degree sequence and the individual edge probabilities while remaining tractable. To achieve this we run a Poisson…