• C++ Programming for Financial Engineering
    Highly recommended by thousands of MFE students. Covers essential C++ topics with applications to financial engineering. Learn more Join!
    Python for Finance with Intro to Data Science
    Gain practical understanding of Python to read, understand, and write professional Python code for your first day on the job. Learn more Join!
    An Intuition-Based Options Primer for FE
    Ideal for entry level positions interviews and graduate studies, specializing in options trading arbitrage and options valuation models. Learn more Join!

Random matrix

radosr

Baruch MFE Faculty
Joined
7/18/07
Messages
660
Points
73
Let A be a random n x n matrix of i.i.d. random signs, i.e. each entry is -1 (with prob. 1/2) or +1 (with prob. 1/2). Compute the variance of det(A).
 
Hmm, if you write out the determinant using the Leibniz formula then the terms of the sum are actually independent so the variance of the sum will be sum of the variances, each of which is 1. So the total variance will just be n!.
 
Are you sure the terms are independent? In the (3\times 3) case, for instance, you have the terms (a_{1,1}a_{2,2}a_{3,3}) and (-a_{1,1}a_{2,3}a_{3,2}) which are not independent...
 
Oh man, that's embarrassing. I meant to say "uncorrelated" which of course is not the same thing as independent.
 
A product of Bernoulli (mean zero) random variables still has mean zero. Hence E(det(A)]=0.

E[det(A)^2] = sum of entries with squares + sum of entries without squares. The 2nd half is zero, the first half is a sum of 1s, hence var[det(A)^2] = n!

Actually ThisGuy's argument still holds, if you replace independent with uncorrelated.
 
Back
Top