Ferenc Bencs

Researcher
Centrum Wiskunde en Informatik

ferenc(at)cwi.nl
Research interests:

graph theory, partition functions, sampling and counting algorithms, graph limit, probability on graphs and groups, dynamical systems
Preprints:
  • Bencs, F., Borbényi, M., & Csikvári, P. (2024). Number of Eulerian orientations for Benjamini–Schramm convergent graph sequences. arXiv preprint arXiv:2409.18012.
  • Bencs, F., Berrekkal, K., & Regts, G. (2024). Deterministic approximate counting of colorings with fewer than 2Δ colors via absence of zeros. arXiv preprint arXiv:2408.04727.
  • Bencs, F., Berrekkal, K., & Regts, G. (2023). Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees. arXiv preprint arXiv:2310.04338.
  • Bencs, F., & Buys, P. (2023). Optimal zero-free regions for the independence polynomial of bounded degree hypergraphs. arXiv preprint arXiv:2306.00122.
Selected papers:
  • Bencs, F., Buys, P., & Peters, H. (2024). The limit of the zero locus of the independence polynomial for bounded degree graphs. Michigan Mathematical Journal, 1-26. https://doi.org/10.1307/mmj/20226256
  • Bencs, F., Hrušková, A., & Tóth, L. M. (2024). Factor-of-iid schreier decorations of lattices in Euclidean spaces. Discrete Mathematics, 347(9), 114056. https://doi.org/10.1016/j.disc.2024.114056
  • Bencs, F., Huijben, J., & Regts, G. (2024). Approximating the chromatic polynomial is as hard as computing it exactly. Computational Complexity, 33(1), 1. https://doi.org/10.1007/s00037-023-00247-8
  • Bencs, F., Boer, D. de, Buys, P., & Regts, G. (2023). Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite Δ-regular tree for large Δ. Journal of Statistical Physics, 190(8), 140. https://doi.org/10.1007/s10955-023-03145-z
  • Bencs, F., Borbényi, M., & Csikvári, P. (2023). Random cluster model on regular graphs. Communications in Mathematical Physics, 399(1), 203-248. https://doi.org/10.1007/s00220-022-04552-1
  • Bencs, F., Csikvári, P., Srivastava, P., & Vondrák, J. (2023). On complex roots of the independence polynomial. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 675-699). https://doi.org/10.1137/1.9781611977554.ch29
  • Bencs, F., & Tóth, L. (2021). Invariant random subgroups of groups acting on rooted trees. Transactions of the American Mathematical Society, 374(10), 7011-7040. https://doi.org/10.1090/tran/8412
  • Bencs, F., & Csikvári, P. (2022). Evaluations of Tutte polynomials of regular graphs. Journal of Combinatorial Theory, Series B, 157, 500-523. https://doi.org/10.1016/j.jctb.2022.08.003
  • Bencs, F., & Mészáros, A. (2022). Atoms of the matching measure. Electronic Journal of Probability, 27, 1-38. https://doi.org/10.1214/22-EJP809
  • Bencs, F., Csikvári, P., & Regts, G. (2020). Some applications of Wagner's weighted subgraph counting polynomial. arXiv preprint arXiv:2012.00806.
  • Bencs, F. (2018). On trees with real-rooted independence polynomial. Discrete Mathematics, 341(12), 3321-3330. https://doi.org/10.1016/j.disc.2018.06.033
You can find all papers on arxiv here.
And this is my Google Scholar page.