On the Largest Eigenvalue of a Random Subgraph of the Hypercube

Abstract

Let G be a random subgraph of the n-cube where each edge appears randomly and independently with probability p. We prove that the largest eigenvalue of the adjacency matrix of G is almost surely \lambda_1= ) max,np), where \Delta is the maximum degree of G and o term tends to zero as max, np) tends to infinity.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,503

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Relative Randomness and Cardinality.George Barmpalias - 2010 - Notre Dame Journal of Formal Logic 51 (2):195-205.
The Kolmogorov complexity of random reals.Liang Yu, Decheng Ding & Rodney Downey - 2004 - Annals of Pure and Applied Logic 129 (1-3):163-180.
Random generations of the countable random graph.Su Gao & A. Vershik - 2006 - Annals of Pure and Applied Logic 143 (1-3):79-86.
Borel separability of the coanalytic Ramsey sets.Alan D. Taylor - 2006 - Annals of Pure and Applied Logic 144 (1-3):130-132.
The eigenvalue problem for the 1-biharmonic operator.Enea Parini, Bernhard Ruf & Cristina Tarsi - 2014 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 13 (2):307-332.

Analytics

Added to PP
2017-06-17

Downloads
4 (#1,615,905)

6 months
1 (#1,479,630)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references