Home | Contents | Submissions, editors, etc. | Login | Search | EJP
 Electronic Communications in Probability > Vol. 12 (2007) > Paper 20 open journal systems 


On asymptotic properties of the rank of a special random adjacency matrix

Arup Bose, Indian Statistical Institute
Arnab Sen, University of California, Berkeley


Abstract
Consider the matrix Δn = ((  I(Xi + Xj > 0) ))i,j =1,2,...,n where Xi are i.i.d. and their distribution is  continuous and symmetric around 0. We  show that the rank rn of this matrix is equal in distribution to 2∑i=1n-1 I(ξi =1,ξi+1=0)+I(ξn=1) where ξi are i.i.d. Ber(1,1/2).
   As a consequence n-1/2(rn/n-1/2) is asymptotically normal with mean zero and variance 1/4. We also show that n-1rn converges to 1/2 almost surely.


Full text: PDF

Pages: 200-205

Published on: June 3, 2007


Bibliography
  1. Caldarelli, G., Capocci, A., Rios, P. De Los, and Munoz, M.A. (2002). Scale-free networks from varying vertex intrinsic fitness. Physical Review Letters , 89, 258702.
  2. Costello, Kevin P., Tao, Terence and Vu, Van. (2006)  Random symmetric matrices are almost surely non-singular. Duke Math J.  Volume 135,  Number 2, 395-413 MR2267289
  3. Costello, Kevin P. and Vu, Van. (2006). The rank of random graphs. arXiv:math:PR/0606414 v1.
  4. Brockwell, Peter J. and Davis, Richard A. (1991). Time series:  theory and methods, Second edition. Springer Series in Statistics. Springer Verlag, New York. MR1093459
  5. Masuda, Naoki, Miwa, Hiroyoshi, and  Konno, Norio (2005). Geographical threshold graphs with small-world and scale-free properties, Physical Review E, 71, 036108.
  6. S"{o}derberg, Bo (2002). General formalism for inhomogeneous random graphs, Physical Review E, 66 066121. MR1953933
















Research
Support Tool
Capture Cite
View Metadata
Printer Friendly
Context
Author Address
Action
Email Author
Email Others


Home | Contents | Submissions, editors, etc. | Login | Search | EJP

Electronic Communications in Probability. ISSN: 1083-589X