Search arXivSearch

arXiv · 1906.09830

A story of balls, randomness and PDEs

Abstract

Several differential equations usually appearing in mathematical physics are solved through a power series expansion, which reduces in solving difference equations. In this paper a probability problem is presented whose solution follows a completely reversed but systematic approach. Hence, this work is about illustrating how complex probability problems could be tackled with the more powerful techniques of a better studied and well understood field, that of differential equations. The problem is defined as follows: Inside a box containing r red and w white balls random removals occur. The balls are removed successively according to the three following rules. Rule I: If a white ball is chosen it is immediately discarded. If a red ball is chosen, it is placed back into the box and a new ball is randomly chosen. The second ball is then removed irrespective of the color. Rule II: Once one ball is removed, the game continues from Rule I. Rule III: The game ends once all the red balls are removed. The question posed is the determination of the probability that k white balls remain where k = 0, 1, 2, ..., w. Ending the game once all the white balls are removed, a second question is the determination of the probability that k red balls remain where k = 0, 1, 2, ..., r. While inductive solutions are possible, the current approach demonstrates a different and algorithmic route. In particular, the law of total probability yields a recursion that is transformed into a linear inhomogeneous 2D PDE, with suitable boundary conditions. The PDE solutions, which are found analytically, provide the generating functionals of the required probabilities as a function of r, w and k. Using the functionals, the probability formulas for any r, w and k are finally obtained in a closed form. Reproducing existing results of the literature this method is quite generic and adaptable to a large class of problems.

Explore related subjects

Keep this discovery

BibTeXRIS

Anastasios Taliotis. 2019-06-24. A story of balls, randomness and PDEs. https://arxiv.org/abs/1906.09830

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