Hostname: page-component-5c6d5d7d68-7tdvq Total loading time: 0 Render date: 2024-08-08T15:19:42.527Z Has data issue: false hasContentIssue false

Addendum to ‘A stochastic algorithm to compute optimal probabilities in the chaos game’: a new convergence criterion

Published online by Cambridge University Press:  01 July 2016

Laura M. Morato*
Affiliation:
Università di Verona
Paola Siri*
Affiliation:
Università di Verona
*
Postal address: Dipartimento di Informatica, Settore di Matematica, Facoltà di Scienze MM.FF.NN., Ca' Vignal 2, Strada le Grazie 15, 37134 Verona, Italy.
Postal address: Dipartimento di Informatica, Settore di Matematica, Facoltà di Scienze MM.FF.NN., Ca' Vignal 2, Strada le Grazie 15, 37134 Verona, Italy.

Abstract

We propose a new convergence criterion for the stochastic algorithm for the optimization of probabilities (SAOP) described in an earlier paper. The criterion is based on the dissection principle for irreducible finite Markov chains.

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 2004 

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

[1] Morato, L. M. and Siri, P. (2001). A stochastic algorithm to compute optimal probabilities in the chaos game. Adv. Appl. Prob. 33, 423436.CrossRefGoogle Scholar