Limiting entropy of determinantal processes

DOI10.1214/20-AOP1435zbMath1468.60017arXiv1905.11459OpenAlexW3087878764MaRDI QIDQ2212605

András Mészáros

Publication date: 24 November 2020

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.11459

zbMATH Keywords

weak convergencedeterminantal processesspanning treessofic entropytree entropy

Mathematics Subject Classification ID

Special processes (60K99) Combinatorial probability (60C05) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Probability theory on algebraic and topological structures (60B99)

Related Items (1)

Matchings on trees and the adjacency matrix: A determinantal viewpoint

Cites Work

• Unnamed Item
• Unnamed Item
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Choosing a spanning tree for the integer lattice uniformly
• Gibbs measures over locally tree-like graphs and percolative entropy over infinite regular trees
• Recurrence of distributional limits of finite planar graphs
• Change intolerance in spanning forests
• Uniform spanning forests
• Determinantal probability measures
• Processes on unimodular random networks
• Invariant coupling of determinantal measures on sofic groups
• ADDITIVITY PROPERTIES OF SOFIC ENTROPY AND MEASURES ON MODEL SPACES
• Measure conjugacy invariants for actions of countable sofic groups
• Left and right convergence of graphs with bounded degree
• Measurability of Generalized Inverses of Random Linear Operators
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: Limiting entropy of determinantal processes