Tingzhou Yu

activity

20212026

collaborators

Showing 2026Show all

5 papers · 1 filter

math.PR2026

An upper bound on the smallest singular value of dense signed random combinatorial matrices

Yuxiao Shi, Zeyan Song, Kexin Yu +1

Let $M_{n}$ be an $n \times n$ random matrix with entries in ${- 1, 0, 1}$ , where each row is independently and uniformly sampled from the set of all vectors in ${- 1, 0, 1}^{n}$ cont…

math.PR2026

Large corank of dense random regular digraphs

Huaijin Liang, Kexin Yu, Tingzhou Yu

Let $1 \leq k \leq n$ and let $A$ be the adjacency matrix of a uniformly random $d$ -regular directed graph on $n$ vertices. Suppose that $λn \leq d \leq (1 - λ) n$ for a fixed $0 < λ \leq 1/2$ .…

math.PR2026

Rank and Invertibility of Dense Signed Random Regular Matrices

Huaijin Liang, Yuxiao Shi, Kexin Yu +1

Let $A$ be the (non-symmetric) adjacency matrix of a uniformly random $d$ -regular directed graph on $n$ vertices, and let $Ξ$ be independent of $A$ with i.i.d. Rademacher entries.…

math.NA2026

Stochastic Rounding Increases Small Singular Values

Linkai Ma, Tingzhou Yu, Petros Drineas

Over the past half-dozen years, stochastic rounding (SR) has regained significant attention as a quantization scheme for low-precision floating-point arithmetic, with applications…

math.PR2026

An upper bound on the smallest singular value of dense random combinatorial matrices

Dongbin Li, Alexander E. Litvak, Tingzhou Yu

Let $M$ be an $n \times n$ random matrix with entries in ${0, 1}$ , where each row is independently and uniformly sampled from the set of all vectors in ${0, 1}^{n}$ containing exa…