Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-26T04:14:57.110Z Has data issue: false hasContentIssue false

Sur une caractérisation des vidanges fortes

Published online by Cambridge University Press:  01 July 2016

Jean-Guy Dion*
Affiliation:
Université de Sherbrooke

Abstract

This paper is concerned with a discrete Markov process related to an underlying weighted graph. With this graph we associate an urn containing p types of balls which correspond to the p vertices of the graph, and such that the number of balls of each type is proportional to the weight of the related vertex. A drawing scheme from the urn is defined which leads to Markovian non-homogeneous transition probabilities. Many kinds of weighted graphs are found to have a strong convergence property; this is that the number of balls drawn from the urn at the end of any single draw converges in probability to the total number of balls in the urn, as this tends to infinity.

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1976 

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.)

References

Bibliographie

Berge, C. (1958) Théorie des graphes et ses applications. Dunod, Paris.Google Scholar
Dauber, E. (1969) dans Graph Theory, ed. Harary, F.. Addison-Wesley, U.S.A. Google Scholar
Pétry, F. (1971) Thèse de Doctorat 3e Cycle, Faculté des Sciences de Paris. (non-publié.) Google Scholar
Raynaud, H. (1968) Thèse de Doctorat d'Etat: Sur les graphes aléatoires. Ann. Inst. H. Poincaré N.S.B. 4, 255329.Google Scholar