Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • Sur une caractérisation des vidanges fortes

  • Jean-Guy Dion
  • Journal:
    Advances in Applied Probability / Volume 8 / Issue 1 / March 1976
    Published online by Cambridge University Press:
    01 July 2016, pp. 105-126
    Print publication:
    March 1976

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