Tatiana I Brailovskaya

Journal article Annals of Probability · January 1, 2026 We prove nonasymptotic matrix concentration inequalities for the spectral norm of (sub)Gaussian random matrices with centered independent entries that capture fluctuations at the Tracy–Widom scale. This considerably improves previous bounds in this setting ... Full text Cite

Universality and Sharp Matrix Concentration Inequalities

Journal article Geometric and Functional Analysis · December 1, 2024 We show that, under mild assumptions, the spectrum of a sum of independent random matrices is close to that of the Gaussian random matrix whose entries have the same mean and covariance. This nonasymptotic universality principle yields sharp matrix concent ... Full text Cite

Tree trace reconstruction using subtraces

Journal article Journal of Applied Probability · January 1, 2023 Tree trace reconstruction aims to learn the binary node labels of a tree, given independent samples of the tree passed through an appropriately defined deletion channel. In recent work, Davies, Rácz, and Rashtchian [10] used combinatorial methods to show t ... Full text Cite

Reversible Computation Using Swap Reactions on a Surface

Conference Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2019 Chemical reaction networks (CRNs) and DNA strand displacement systems have shown potential for implementing logically and physically reversible computation. It has been shown that CRNs on a surface allow highly scalable and parallelizable computation. In t ... Full text Cite