Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T23:55:10.564Z Has data issue: false hasContentIssue false

Sur une caractérisation des vidanges fortes: corrections and extensions

Published online by Cambridge University Press:  14 July 2016

Jean-Guy Dion*
Affiliation:
Université de Sherbrooke

Abstract

A draining is a stochastic process defined by an urn scheme where the successive drawings are made without replacement and according to a drawing algorithm associated with a weighted graph. A draining is said to be a strong one if the number of balls which can be drawn from the urn (under the algorithm) converges in probability to the total number of balls in the urn at the beginning of the drawing when it goes to infinity. In particular, drainings associated with complete graphs having equal weights are found to be strong and for some others associated weighted graphs, strong drainings exist.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1978 

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

Article purchase

Temporarily unavailable