The Annals of Applied Probability

Stochastic billiards on general tables

Steven N. Evans

Full-text: Open access


We consider stochastic analogs of classical billiard systems. A particle moves at unit speed with constant direction in the interior of a bounded, d-dimensional region with continuously differentiable boundary. The boundary need not be connected; that is, the “table” may have inte- rior “obstacles.” When the particle strikes the boundary, a new direction is chosen uniformly at random from the directions that point back into the interior of the region and the motion continues. Such chains are closely related to those that appear in shake-and-bake simulation algorithms. For the discrete time Markov chain that records the locations of successive hits on the boundary, we show that, uniformly in the starting point, there is exponentially fast total variation convergence to an invariant distribution. By analyzing an associated nonlinear, first-order PDE, we investigate which regions are such that this chain is reversible with respect to surface measure on the boundary. We also establish a result on uniform total variation Césaro convergence to equilibrium for the continuous time Markov process that tracks the position and direction of the particle. A key ingredient in our proof is a result on the geometry of $C^1$ regions that can be described loosely as follows:associated with any bounded $C^1$ region is an integer N such that it is always possible to pass a message between any two locations in the region using a relay of exactly N locations with the property that every location in the relay is directly visible from its predecessor. Moreover, the locations of the intermediaries can be chosen from a fixed, finite subset of positions on the boundary of the region. We also consider corresponding results for polygonal regions in the plane.

Article information

Ann. Appl. Probab. Volume 11, Number 2 (2001), 419-437.

First available: 5 March 2002

Permanent link to this document

Mathematical Reviews number (MathSciNet)

Digital Object Identifier

Zentralblatt MATH identifier

Primary: 60J05: Discrete-time Markov processes on general state spaces 60J25: Continuous-time Markov processes on general state spaces
Secondary: 34C35 58F11

Billiards Markov chain Markov process ergodic irreducible coupling shift-coupling total variation reversibility shake-and-bake


Evans, Steven N. Stochastic billiards on general tables. The Annals of Applied Probability 11 (2001), no. 2, 419--437. doi:10.1214/aoap/1015345298.

Export citation


  • [1] Boender, C. G. E., Caron, R. J., McDonald, J. F., Rinnooy Kan, A. H. G., Romeijn,
  • H. E., Smith, R. L., Telgen, J. and Vorst, A. C. F. (1991). Shake-and-bake algorithms for generating uniform points on the boundary of bounded polyhedra. Oper. Res. 39 945-954.
  • [2] Cornfeld, I. P., Fomin, S. V. and Sinai, Ya. G. (1981). Ergodic Theory. Springer, New York.
  • [3] Davis, M. H. A. (1984). Piecewise-deterministic Markov processes: a general class of nondiffusion stochastic models. J. Roy. Statist. Soc. Ser. B 46 353-388.
  • [4] Evans, L. C. (1998). Partial Differential Equations. Amer. Math. Soc., Providence, RI.
  • [5] Iyanaga, S. and Kawada, Y. (eds.). (1977). Encyclopedic Dictionary of Mathematics. MIT Press.
  • [6] Jacod, J. and Skorokhod, A. V. (1996). Jumping Markov processes. Ann. Inst. H. Poincar´e Probab. Statist. 32 11-67.
  • [7] Katok, A. and Hasselblatt, B. (1995). Introduction to the Modern Theory of Dynamical Systems. Cambridge Univ. Press.
  • [8] Kozlov, V. V. and Treschev, D. V. (1991). Billiards: a genetic introduction to the dynamics of systems with impacts. Amer. Math. Soc., Providence, RI.
  • [9] Meyn, S. P. and Tweedie, R. L. (1993). Markov Chains and Stochastic Stability. Springer, London.
  • [10] Patel, N. R. and Smith, R. L. (1983). The asymptotic extreme value distribution of the sample minimum of a concave function under linear constraints. Oper. Res. 31 789-794.
  • [11] Roberts, G. O. and Rosenthal, J. S. (1996). Quantitative bounds for convergence rates of continuous time Markov processes. Electron. J. Probab. 1.
  • [12] Romeijn, H. E. (1991). Shake-and-bake algorithms for the identification of nonredundant linear inequalities. Statist. Neerlandica 45 31-50.
  • [13] Romeijn, H. E. (1992). Global Optimization by Random Walk Sampling Methods. Thesis Publishers, Amsterdam.
  • [14] Romeijn, H. E. (1998). A general framework for approximate sampling with an application to generating points on the boundary of bounded convex regions. Statist. Neerlandica 52 42-59.
  • [15] Simmons, G. F. (1963). Introduction to Topology and Modern Analysis. McGraw-Hill, New York.
  • [16] Sinai, Ya. G. (1991). Hyperbolic billiards. In Proceedings of the International Congress of Mathematicians 249-260. Math. Soc. Japan, Tokyo.
  • [17] Smith, R. L. and Telgen, J. (1981). Random methods for identifying nonredundant constraints. Technical report 81-4, Dept. Industrial and Operations Engineering, Univ. Michigan, Ann Arbor.
  • [18] Thorisson, H. (1994). Shift-coupling in continuous time. Probab. Theory Related Fields 99 477-483.