6 papers
Large corank of dense random regular digraphs
Huaijin Liang, Kexin Yu, Tingzhou Yu
Let and let be the adjacency matrix of a uniformly random -regular directed graph on vertices. Suppose that for a fixed .…
Rank and Invertibility of Dense Signed Random Regular Matrices
Huaijin Liang, Yuxiao Shi, Kexin Yu +1
Let be the (non-symmetric) adjacency matrix of a uniformly random -regular directed graph on vertices, and let be independent of with i.i.d. Rademacher entries.…
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…
An upper bound on the smallest singular value of dense random combinatorial matrices
Dongbin Li, Alexander E. Litvak, Tingzhou Yu
Let be an random matrix with entries in , where each row is independently and uniformly sampled from the set of all vectors in containing exa…
Asymptotic behaviors for distribution dependent SDEs driven by fractional Brownian motions
Xiliang Fan, Ting Yu, Chenggui Yuan
In this paper, we study small-time asymptotic behaviors for a class of distribution dependent stochastic differential equations driven by fractional Brownian motions with Hurst par…
Quantitative Russo-Seymour-Welsh for random walk on random graphs and decorrelation of UST
Gourab Ray, Tingzhou Yu
We prove a quantitative Russo-Seymour-Welsh (RSW) type result for random walks on two natural examples of random planar graphs: the supercritical percolation cluster in the square…