1 citations · 1 across the 4 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2020★ 1 cited
Atoms of the matching measure
Ferenc Bencs, András Mészáros
We prove that the matching measure of an infinite vertex-transitive connected graph has no atoms. Generalizing the results of Salez, we show that for an ergodic non-amenable unimod…
math.PR2019
Limiting entropy of determinantal processes
András Mészáros
We extend Lyons's tree entropy theorem to general determinantal measures. As a byproduct we show that the sofic entropy of an invariant determinantal measure does not depend on the…