M'arton Borb'enyi

activity

20202024

most citedRandom interlacement is a factor of i.i.d

3 citations · 4 across the 4 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

math.PR2020★ 1 cited

Connectedness of the Free Uniform Spanning Forest as a function of edge weights

Marcell Alexy, Márton Borbényi, András Imolay +1

Let $G$ be the Cartesian product of a regular tree $T$ and a finite connected transitive graph $H$ . It is shown in arXiv:2006.06387 that the Free Uniform Spanning Forest ($\mathsf{…

math.CO2020

Matchings in regular graphs: minimizing the partition function

Márton Borbényi, Péter Csikvári

For a graph $G$ on $v (G)$ vertices let $m_{k} (G)$ denote the number of matchings of size $k$ , and consider the partition function $M_{G} (λ) = \sum_{k = 0}^{n} m_{k} (G) λ^{k}$ . In this paper we s…