- Spectral Distributions of Adjacency and Laplacian Matrices of Random Graphs
- Assignment 4 of Stat8112, Spring 2006 Problem 1. Let X n ; n # 1 be a sequence of random variables defined
- Low Eigenvalues of Laplacian Matrices of Large Random Graphs Tiefeng Jiang1
- Assignment 2 of Stat8112, Spring 2006 Problem 1. let X1, X2 be i.i.d. uniform (, + 1). For testing H0 : = 0 vs Ha : > 0,
- The Spacings of Record Values Tiefeng Jiang 1 and Danning Li 2
- Maxima of Partial Sums Indexed By Geometrical Structures
- Maxima of Partial Sums Indexed by Geometrical Structures
- The Entries of Circular Orthogonal Ensembles Tiefeng Jiang 1
- The Limiting Distributions of Eigenvalues of Sample Correlation Matrices
- Assignment 3 of Stat8112, Spring 2006 Problem 1. Let {X, X n ; n = 1, 2, } be a sequence of random variables. Show that
- Approximation of Haar Distributed Matrices and Limiting Distributions of Eigenvalues of Jacobi Ensembles
- Limit Theorems for BetaJacobi Ensembles Tiefeng Jiang 1
- Maxima of Entries of Haar Distributed Matrices Tiefeng Jiang 1
- The metric of large deviation convergence Tiefeng Jiang 1 and George L. O'Brien 2
- Limiting Laws of Coherence of Random Matrices with Applications to Testing Covariance Structure and
- The Annals of Applied Probability 2010, Vol. 20, No. 6, 20862117
- Moments of Traces for Circular Betaensembles Tiefeng Jiang 1 and Sho Matsumoto 2
- SPECTRAL MEASURE OF LARGE RANDOM HANKEL, MARKOV AND TOEPLITZ MATRICES
- A Comparison of Scores of Two Protein Structures With Foldings
- The Asymptotic Distributions of the Largest Entries of Sample Correlation Matrices
- Assignment 3 of Stat8112, Spring 2006 Problem 1. Let {X, X n ; n = 1, 2, } be a sequence of random variables. Show that
- The Entries of Haarinvariant Matrices from the Classical Compact Tiefeng Jiang 1
- How Many Entries of A Typical Orthogonal Matrix Can Be Approximated By Independent Normals?
- Assignment 4 of Stat8112, Spring 2006 Problem 1. Let Xn; n 1 be a sequence of random variables defined on (, F, P). Prove
- Assignment 2 of Stat8112, Spring 2006 Problem 1. let X 1 , X 2 be i.i.d. uniform (#, # + 1). For testing H 0 : # = 0 vs H a : # > 0,
- How Many Entries of A Typical Orthogonal Matrix Can Be Approximated By Independent Normals?
- Assignment 2 of Stat8112, Spring 2007 Problem 1. Let {X, X n ; n = 1, 2, } be a sequence of random variables. Show that
- Limiting Laws of Coherence of Random Matrices with Applications to Testing Covariance Structure and
- The Entries of Haar-invariant Matrices from the Classical Compact Tiefeng Jiang 1
- The Entries of Circular Orthogonal Ensembles Tiefeng Jiang 1
- Approximation of Haar Distributed Matrices and Limiting Distributions of Eigenvalues of Jacobi Ensembles
- Moments of Traces for Circular Beta-ensembles Tiefeng Jiang 1
- Limit Theorems for Beta-Jacobi Ensembles Tiefeng Jiang 1
- The Spacings of Record Values Tiefeng Jiang1
- Assignment 3 of Stat8112, Spring 2006 Problem 1. Let {X, Xn; n = 1, 2, } be a sequence of random variables. Show that
- A Variance Formula Related to a Quantum Conductance Problem Tiefeng Jiang 1
- A Variance Formula Related to a Quantum Conductance Problem Tiefeng Jiang 1
- !#"%$&#'!()#021!#435768!@9BAC(ED4F5GH3I()#F576 P AQ2RSUT7(E(EVR#AW!#43YX AW()#"`F
- Circular Law and Arc Law for Truncation of Random Unitary Zhishan Dong1
- Circular Law and Arc Law for Truncation of Random Unitary Zhishan Dong 1 , Tiefeng Jiang 2 and Danning Li 3
- Likelihood Ratio Tests for Covariance Matrices of High-Dimensional Normal Distributions
- Distributions of Angles in Random Packing on Spheres , Jianqing Fan2
- Phase Transition in Limiting Distributions of Coherence of High-Dimensional Random Matrices
