Local limits of determinantal processes

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Nachmias, Asaf, Peled, Yuval
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918165725839360
author Nachmias, Asaf
Peled, Yuval
author_facet Nachmias, Asaf
Peled, Yuval
contents 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 cell complexes, discrete Grassmanians, incidence matroids and more, as long as their degree tends to $\infty$.
format Preprint
id arxiv_https___arxiv_org_abs_2510_19563
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Local limits of determinantal processes
Nachmias, Asaf
Peled, Yuval
Probability
Combinatorics
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 cell complexes, discrete Grassmanians, incidence matroids and more, as long as their degree tends to $\infty$.
title Local limits of determinantal processes
topic Probability
Combinatorics
url https://arxiv.org/abs/2510.19563