Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: random interval graphs

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

The sizes of components in random circle graphs

100%

Imany-Nabiyyi R.

Discussiones Mathematicae Graph Theory

2008

tom 28

nr 3

511-533

We study random circle graphs which are generated by throwing n points (vertices) on the circle of unit circumference at random and joining them by an edge if the length of shorter arc between them is less than or equal to a given parameter d. We derive here some exact and asymptotic results on sizes (the numbers of vertices) of "typical" connected components for different ways of sampling them. By studying the joint distribution of the sizes of two components, we "go into" the structure of random circle graphs more deeply. As a corollary of one of our results we get the exact, closed formula for the expected value of the total length of all components of the random circle graph. Although the asymptotic distribution for this random characteristic is well known (see e.g. T. Huillet [4]), this surprisingly simple formula seems to be a new one.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Imany-Nabiyyi R.

1 2008

Wyniki wyszukiwania

The sizes of components in random circle graphs