SearcharxivSearch

arXiv · math/0508089

Position play in carom billiards as a Markov process

Abstract

Position play is a key feature of carom billiards: on easy shots players can manage to score while ensuring that the next position will be favorable. The difficulty of a shot therefore depends on the previous shot, e.g. an easy shot generally follows an easy shot. We introduce a Markov process which accounts for such correlations. This model can explain the long series of easy shots and the high scores which ensue. It also enables us to identify differences in the scoring patterns of players at different skill levels. Players can use this model via http://billiards.mathieu.bouville.name/biMar/. ----- Le replacement est la pierre angulaire des jeux de series au billard carambole (billard francais) : sur un coup facile le joueur peut marquer tout en s'assurant que le coup suivant sera favorable. Un coup facile est ainsi generalement suivi d'un autre coup facile. La difficulte d'un coup depend donc du coup precedent. On presente un processus de Markov qui tient compte de ces correlations. Ce modele permet d'expliquer les longues series de coups faciles et les scores eleves qui en resultent. Il permet aussi d'identifier des differences entre joueurs de niveau different. Les joueurs peuvent utiliser ce modele via la page http://billiards.mathieu.bouville.name/biMar/.

Explore related subjects

Keep this discovery

BibTeXRIS

Mathieu Bouville. 2005-08-04. Position play in carom billiards as a Markov process. https://arxiv.org/abs/math/0508089

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR