Local limits of determinantal processes
Probability
2025-10-23 v1 Combinatorics
Abstract
Let be the row space of a signed adjacency matrix of a -free bipartite bi-regular graph in which one part has degree and the other part has degree where is a fixed integer. We show that the local limit as of the determinantal process corresponding to the orthogonal projection on is a variant of a Poisson 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 cell complexes, discrete Grassmanians, incidence matroids and more, as long as their degree tends to .
Keywords
Cite
@article{arxiv.2510.19563,
title = {Local limits of determinantal processes},
author = {Asaf Nachmias and Yuval Peled},
journal= {arXiv preprint arXiv:2510.19563},
year = {2025}
}