1 citations · 1 across the 4 of their papers we have counts for
6 papers
Matchings on trees and the adjacency matrix: A determinantal viewpoint
András Mészáros
Let be a finite tree. For any matching of , let be the set of vertices uncovered by . Let be a uniform random maximum size matching of . In…
On the free energy density of factor models on biregular graphs
András Mészáros
Let be a symmetric concave sequence. For a -biregular factor graph and , we define the Hamiltonian \[H_G(x)=\sum_{f\in F} h\left(\…
A BK inequality for random matchings
András Mészáros
Let be a bipartite graph. For a matching of , let be the set of vertices covered by , and let be the symmetric difference of and . We…
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…
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…
The distribution of sandpile groups of random regular graphs
András Mészáros
We study the distribution of the sandpile group of random d-regular graphs. For the directed model, we prove that it follows the Cohen-Lenstra heuristics, that is, the limiting pro…