s z e g e d y b _at_ gmail _dot_ com
MTA Alfréd Rényi Institute of Mathematics
Reáltanoda utca 13-15.
Budapest, Hungary, H-1053
My main research areas are combinatorics and group theory. At the moment,
I am working
in various topics related to limits of discrete structures. This field is connected to combinatorics, ergodic theory and
Limits of combinatorial structures: an analytic
approach that considers large structures as approximations of infinite analytic
objects and creates new connections between analysis, combinatorics, probability theory, group theory and ergodic theory.
Higher order Fourier analysis: a theory of higher order structures in compact abelian groups, which
proves general inverse theorems and regularity lemmas for Gowers uniformity norms.
- Limits of dense graph sequences, graphons as limits objects, graph homomorphisms, regularity lemma.
D. Kunszenti-Kovacs, L. Lovasz, B. Szegedy. Multigraph limits, unbounded kernels, and Banach space decorated graphs. [arXiv:1406.7846]
L. Lovasz, B. Szegedy. The automorphism group of a graphon. J. Algebra 421 (2015), 136-166. [arXiv:1406.4958]
H. Hatami, S. Janson, B. Szegedy, Graph properties, graph limits and entropy. [arxiv:1312.5626]
- Limits of sparse graph sequences, entropy methods, Sidorenko's conjecture.
A. Backhausz, B. Szegedy. On the almost eigenvectors of random regular graphs. [arXiv:1607.04785]
B. Szegedy. Sparse graph limits, entropy maximization and transitive graphs. [arXiv:1504.00858]
P. Candela, B. Szegedy. A continuous model for systems of complexity 2 on simple abelian groups, [arXiv:1509.04485]
B. Szegedy, Limits of functions on groups, [arXiv:1502.07861]
P. Candela, B. Szegedy, L. Vena, On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs. [arXiv:1408.6753]