Local limits of determinantal processes
Abstract
Let Hn be the row space of a signed adjacency matrix of a C4-free bipartite bi-regular graph in which one part has degree d(n)∞ and the other part has degree k+1 where k≥ 1 is a fixed integer. We show that the local limit as n ∞ of the determinantal process corresponding to the orthogonal projection on Hn 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 ∞.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.