Andr'as M'esz'aros

activity

20182023

most citedThe distribution of sandpile groups of random regular graphs

28 citations · 32 across the 9 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2021★ 2 cited

The local weak limit of $k$ -dimensional hypertrees

András Mészáros

Let $C (n, k)$ be the set of $k$ -dimensional simplicial complexes $C$ over a fixed set of $n$ vertices such that: (1) $C$ has a complete $k - 1$ -skeleton; (2) $C$ has precise…

math.CO2020

Matchings on trees and the adjacency matrix: A determinantal viewpoint

András Mészáros

Let $G$ be a finite tree. For any matching $M$ of $G$ , let $U (M)$ be the set of vertices uncovered by $M$ . Let $M_{G}$ be a uniform random maximum size matching of $G$ . In…

math.CO2020

On the free energy density of factor models on biregular graphs

András Mészáros

Let $h (0), h (1), \dots, h (k)$ be a symmetric concave sequence. For a $(d, k)$ -biregular factor graph $G$ and $x \in {0, 1}^{V}$ , we define the Hamiltonian \[H_G(x)=\sum_{f\in F} h\left(\…

math.CO2020

A BK inequality for random matchings

András Mészáros

Let $G = (S, T, E)$ be a bipartite graph. For a matching $M$ of $G$ , let $V (M)$ be the set of vertices covered by $M$ , and let $B (M)$ be the symmetric difference of $V (M)$ and $S$ . We…

math.CO2018★ 28 cited

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…

The local weak limit of k-dimensional hypertrees

Matchings on trees and the adjacency matrix: A determinantal viewpoint

On the free energy density of factor models on biregular graphs

A BK inequality for random matchings

The distribution of sandpile groups of random regular graphs

The local weak limit of $k$ -dimensional hypertrees