Local limits of determinantal processes
classification
🧮 math.PR
math.CO
keywords
determinantaldegreeinftylocalpartprocessprocessesadjacency
read the original abstract
Let $H_n$ be the row space of a signed adjacency matrix of a $C_4$-free bipartite bi-regular graph in which one part has degree $d(n)\to\infty$ and the other part has degree $k+1$ where $k\geq 1$ is a fixed integer. We show that the local limit as $n\to \infty$ of the determinantal process corresponding to the orthogonal projection on $H_n$ is a variant of a Poisson$(k)$ branching process conditioned to survive. This setup covers a wide class of determinantal processes such as uniform spanning trees, Kalai's determinantal hypertrees, hyperforests in regular polytopal complexes, discrete Grassmanians and incidence matroids, as long as their degree tends to $\infty$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.