Abstract not found

1. Introduction. How many times must a deck of cards be shuffled until it is close to random? There is an elementary technique which often yields sharp estimates in such problems. The method is best understood through a simple example. EXAMPLE1. Top in at random shuffle. Consider the following method of mixing a deck of cards: the top card is removed and inserted into the deck at a random position. This procedure is

This paper analyzes the Gibbs sampler applied to a standard variance component model, and considers the question of how many iterations are required for convergence. It is proved that for K location parameters, with J observations each, the number of iterations required for convergence (for large K and J) is a constant times

this paper, we examine this rate of convergence more carefully. We restrict our attention to the case where

For a class of stationary Markov-dependent sequences (ξn,ρn) ∈ R 2, we consider the random linear recursion Sn = ξn + ρnSn−1, n ∈ Z, and show that the distribution tail of its stationary solution has a power law decay. An application to random walks in random environments is discussed. MSC2000: primary 60K15; secondary 60K20, 60K37.

Motivated by multivariate random recurrence equations we prove a new analogue of the Key Renewal Theorem for functionals of a Markov chain with compact state space in the spirit of Kesten [Ann. Probab. 2 (1974) 355–386]. Compactness of the state space and a certain continuity condition allows us to simplify Kesten’s proof considerably.

To my colleague and friend Allan Gut on the occasion of his retirement Abstract. We give a survey of a number of simple applications of renewal theory to problems on random strings and tries: insertion depth, size, insertion mode and imbalance of tries; variations for b-tries and Patricia tries; Khodak and Tunstall codes. 1.

After applying a certain space and time transformation, a (semimartingale) reflecting Brownian motion without drift in a cone, whose reflection directions are radially homogeneous, becomes a Markov additive process. This observation is a simple manifestation of the invariance of such processes under a scaling. Markov additive processes are familiar in queueing theory, especially in Matrix Analytic Methods. The answers to some important questions about reflecting Brownian motion may be guessed by analogy with well-known results in Matrix Analytic Methods.

Use the template preface.tex together with the Springer document class SVMono (monograph-type books) or SVMult (edited books) to style your preface in the Springer layout. A preface is a book’s preliminary statement, usually written by the author or editor of a work, which states its origin, scope, purpose, plan, and intended audience, and which sometimes includes afterthoughts and acknowledgments of assistance. When written by a person other than the author, it is called a foreword. The preface or foreword is distinct from the introduction, which deals with the subject of the work. Customarily acknowledgments are included as last part of the preface. Place(s), month year

We consider a time-homogeneous Markov chain Xn, n ≥ 0, valued in R. Suppose that this chain is transient, that is, Xn generates a σ-finite renewal measure. We prove the key renewal theorem under condition that this chain has asymptotically homogeneous at infinity jumps and asymptotically positive drift.