The Subdominant Eigenvalue of a Large Stochastic Matrix
Using intuition and computer experimentation, Brady conjectured that the ratio of the subdominant eigenvalue to the dominant eigenvalue of a positive random matrix (with identically and independently distributed entries) converges to zero when the number of the sectors tends to infinity. In this paper, we discuss the deterministic case and, among other things, prove the following version of this conjecture: if each entry of the matrix deviates from 1/n by at most θ/n1+е, then the modulus of the subdominant root is at most θ/nе where θ and ε are arbitrary positive real parameters.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 10 (1998)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.tandfonline.com/CESR20|
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/CESR20|
When requesting a correction, please mention this item's handle: RePEc:taf:ecsysr:v:10:y:1998:i:1:p:79-82. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Michael McNulty)
If references are entirely missing, you can add them using this form.