Sciweavers

Share
CAI
2007
Springer

The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs

10 years 4 months ago
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric random intersection graphs. We examine symmetric random intersection graphs when the probability that a vertex selects a label is close to the connectivity threshold τc. In particular, we examine the size of the second eigenvalue of the transition matrix corresponding to the Markov Chain that describes a random walk on an instance of the symmetric random intersection graph Gn,n,p. We show that with high probability the second eigenvalue is upper bounded by
Sotiris E. Nikoletseas, Christoforos Raptopoulos,
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where CAI
Authors Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis
Comments (0)
books