Postdoc (2023.10-now) under the supervision of Gabor Lugosi at the Statistics Group in the Barcelona School of Economics, Universitat Pompeu Fabra, Barcelona, Spain.
Authors of mathematical writings are alphabetically ordered (the rest are as the 1st author).
(7) Cumulant expansion for counting Eulerian orientations, with Mikhail Isaev, Brendan McKay. Submitted. [arXiv] [Slides by Mikhail Isaev]
6. Extremal independence in discrete random systems, with Mikhail Isaev, Igor Rodionov, Maksim Zhukovskii. Accepted in Annales de l'Institut Henri Poincare B: Probability and Statistics. [arXiv]
5. Generalization bounds for learning under graph-dependence: A survey, with Massih-Reza Amini. Machine Learning, 2024. DOI: 10.1007/s10994-024-06536-9 [arXiv]
4. Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence. Advances in Applied Mathematics, 2022. DOI: 10.1016/j.aam.2022.102378. [arXiv]
3. When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence. Statistics & Probability Letters, 2022. DOI: 10.1016/j.spl.2021.109272. [arXiv]
2.
Extreme value theory for triangular arrays of dependent random variables,
with Mikhail Isaev,
Igor Rodionov,
Maksim Zhukovskii.
[Slides
by Igor Rodionov]
Russian Mathematical Surveys, 2020.
DOI: 10.1070/rm9964.
Uspekhi Matematicheskikh Nauk, 2020.
DOI: 10.4213/rm9964.
1.
McDiarmid-type inequalities for graph-dependent variables and stability bounds,
with Xingwu Liu,
Yuyi Wang,
Liwei Wang.
Advances in Neural Information Processing Systems 32, 2019
(NeurIPS Spotlight,
164 out of 6,743 submissions: 2.43%)
[arXiv]
[PDF]
[URL]
[BibTeX]
[Slides].
0. Thesis: The probability of non-existence of small substructures via clusters and cumulants. [URL] DOI: 10.26180/24786498 [Examiners: Wojciech Samotij and Will Perkins].
Teaching assistant, Institute of Computing Technology, CAS: Advanced algorithms (2019 Spring), Probabilistic method and random graphs (2018 Autumn)