research unit 1
 

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit Aigaion.nl.SourceForge.hetLogo

Publication

Type of publication:Inproceedings
Entered by:chita
TitleThe Second Eigenvalue of Random Walks on Symmetric Random Intersection Graphs
Bibtex cite IDRACTI-RU1-2007-77
Booktitle 2nd International Conference on Algebraic Informatics (CAI 2007), Lecture Notes in Computer Science (LNCS)
Year published 2007
Pages 236-246
Publisher Springer Verlag
Note to appear
DOI 10.1007/978-3-540-75414-5_15
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 some constant < 1.
Authors
Nikoletseas, Sotiris
Raptopoulos, Christoforos
Spirakis, Paul
Topics
BibTeXBibTeX
RISRIS
Attachments
SMT.pdf (main file)
presentationCAI07.pdf
 
Publication ID167