On Random Intersection Graphs: The Subgraph Problem

On Random Intersection Graphs: The Subgraph Problem

A new model of random graphs – random intersection graphs – is introduced. In this model, vertices are assigned random subsets of a given set. Two vertices are adjacent provided their assigned sets intersect. We explore the evolution of random intersection graphs by studying thresholds for the appea...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Combinatorics, probability & computing probability & computing, 1999-01, Vol.8 (1-2), p.131-159
Hauptverfasser: KAROŃSKI, MICHAŁ, SCHEINERMAN, EDWARD R., SINGER-COHEN, KAREN B.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A new model of random graphs – random intersection graphs – is introduced. In this model, vertices are assigned random subsets of a given set. Two vertices are adjacent provided their assigned sets intersect. We explore the evolution of random intersection graphs by studying thresholds for the appearance and disappearance of small induced subgraphs. An application to gate matrix circuit design is presented.
ISSN:0963-5483
1469-2163
DOI:10.1017/S0963548398003459