Hostname: page-component-5db6c4db9b-cfm7h Total loading time: 0 Render date: 2023-03-25T09:29:25.868Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

On the Independence Number of Random Interval Graphs

Published online by Cambridge University Press:  10 December 2001

S. BOUCHERON
Affiliation:
LRI, UMR 8623 CNRS, Bât. 490, Université Paris-Sud, 91405 Orsay cedex, France; (e-mail: bouchero@lri.fr, lalo@lri.fr)
W. FERNANDEZ de la VEGA
Affiliation:
LRI, UMR 8623 CNRS, Bât. 490, Université Paris-Sud, 91405 Orsay cedex, France; (e-mail: bouchero@lri.fr, lalo@lri.fr)

Abstract

A random interval graph of order n is generated by picking 2n numbers X1,…,X2n independently from the uniform distribution on [0,1] and considering the collection of n intervals with endpoints X2i−1 and X2i for i ∈ {1,…,n}. The graph vertices correspond to intervals. Two vertices are connected if the corresponding intervals intersect. This paper characterizes the fluctuations of the independence number in random interval graphs. This characterization is obtained through the analysis of the greedy algorithm. We actually prove limit theorems (central limit theorem and large deviation principle) on the number of phases of this greedy algorithm. The proof relies on the analysis of first-passage times through a random level.

Type
Research Article
Copyright
2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)