Researcher (2023.10-now) under the supervision of Gabor Lugosi at the Statistics Group in the Barcelona School of Economics, Universitat Pompeu Fabra, Barcelona, Spain.
(7). Cumulant expansion for counting Eulerian orientations [arXiv] with Mikhail Isaev, Brendan McKay. Submitted.
(6). Generalization bounds for learning under graph-dependence: A survey [arXiv] with Massih-Reza Amini. Submitted.
5. Extremal independence in discrete random systems [arXiv] with Mikhail Isaev, Igor Rodionov, Maksim Zhukovskii. To appear in Annales de l'Institut Henri Poincare B: Probability and Statistics.
4. Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence [arXiv] Advances in Applied Mathematics, 2022. DOI: 10.1016/j.aam.2022.102378.
3. When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence [arXiv] Statistics & Probability Letters, 2022. DOI: 10.1016/j.spl.2021.109272.
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
[arXiv]
[PDF]
[URL]
[BibTeX]
[Slides]
with Xingwu Liu,
Yuyi Wang,
Liwei Wang.
Advances in Neural Information Processing Systems 32 (NeurIPS 2019).
Spotlight: 164 out of 6,743 submissions (2.43%)
0. Thesis: the probability of non-existence of small substructures in moderately sparse random objects via clusters and cumulants. (Submitted, under examination).
Teaching assistant, Institute of Computing Technology, CAS: Advanced algorithms (2019 Spring), Probabilistic method and random graphs (2018 Autumn)