Invariant coupling of determinantal measures on sofic groups

DOI10.1017/ETDS.2014.70zbMATH Open1355.37018arXiv1402.0969OpenAlexW1989647559WikidataQ61677655 ScholiaQ61677655MaRDI QIDQ2808042FDOQ2808042

Andreas Thom, Russell Lyons

Publication date: 26 May 2016

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Abstract: To any positive contraction $Q$ on $el{l}^2(W)$, there is associated a determinantal probability measure ${mathbfP}^Q$ on $2^W$, where $W$ is a denumerable set. Let $Gamma$ be a countable sofic finitely generated group and $G=(Gamma,mathsfE)$ be a Cayley graph of $Gamma$. We show that if $Q_1$ and $Q_2$ are two $Gamma$-equivariant positive contractions on $el{l}^2(Gamma)$ or on $el{l}^2(mathsfE)$ with $Q_{1}le{Q}_2$, then there exists a $Gamma$-invariant monotone coupling of the corresponding determinantal probability measures witnessing the stochastic domination $$. In particular, this applies to the wired and free uniform spanning forests, which was known before only when $Gamma$ is residually amenable. In the case of spanning forests, we also give a second more explicit proof, which has the advantage of showing an explicit way to create the free uniform spanning forest as a limit over a sofic approximation. Another consequence of our main result is to prove that all determinantal probability measures $$ as above are $$-limits of finitely dependent processes. Thus, when $Gamma$ is amenable, $$ is isomorphic to a Bernoulli shift, which was known before only when $Gamma$ is abelian. We also prove analogous results for sofic unimodular random rooted graphs.

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

zbMATH Keywords

Cayley graphstochastic dominationBernoulli shiftsofic approximationdeterminantal probability measures

Mathematics Subject Classification ID

Combinatorial probability (60C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Measurable group actions (22F10) Dynamical systems and the theory of (C^*)-algebras (37A55)

Cites Work

• Recurrence of distributional limits of finite planar graphs
• Determinantal point processes for machine learning
• The coincidence approach to stochastic point processes
• Entropy and isomorphism theorems for actions of amenable groups
• Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
• Measure conjugacy invariants for actions of countable sofic groups
• Determinantal probability measures
• Processes on unimodular random networks
• Factors of Bernoulli shifts are Bernoulli shifts
• The Existence of Probability Measures with Given Marginals
• On symmetric random walks with random conductances on \(\mathbb Z^d\)
• Invariant monotone coupling need not exist
• Negative dependence and the geometry of polynomials
• Group cocycles and the ring of affiliated operators
• The dissection of rectangles into squares
• SOME COMPUTATIONS OF 1-COHOMOLOGY GROUPS AND CONSTRUCTION OF NON-ORBIT-EQUIVALENT ACTIONS
• Choosing a spanning tree for the integer lattice uniformly
• Approximating \(L^ 2\)-invariants by their finite-dimensional analogues
• Bernoulli actions are weakly contained in any free action
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Ergodic subequivalence relations induced by a Bernoulli action
• Hyperlinearity, essentially free actions and \(L^2\)-invariants. The sofic property
• Sofic groups and diophantine approximation
• On sofic groups
• Group cohomology, harmonic functions and the first \(L^ 2\)-Betti number
• Couplings of uniform spanning forests
• L²-BETTI NUMBERS OF DISCRETE MEASURED GROUPOIDS
• A sofic group away from amenable groups.
• On sofic actions and equivalence relations
• Sofic groups and direct finiteness.
• Stationary determinantal processes: phase multiplicity, Bernoullicity, entropy, and domination
• Random-cluster measures and uniform spanning trees
• Fixed price of groups and percolation
• Very weak Bernoulli for amenable groups

Cited In (5)

• Limiting entropy of determinantal processes
• Interlacements and the wired uniform spanning forest
• Random interlacement is a factor of i.i.d.
• Stationary determinantal processes on \({\mathbb{Z}}^d\) with \(N\) labeled objects per site. I: Basic properties and full domination
• Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.

This page was built for publication: Invariant coupling of determinantal measures on sofic groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808042)