SearcharxivSearch

arXiv · 1706.02617

Stochastic LU factorizations, Darboux transformations and urn models

Abstract

We consider UL (and LU) decompositions of the one-step transition probability matrix of a random walk with state space the nonnegative integers, with the condition that both upper and lower triangular matrices in the factorization are also stochastic matrices. We give conditions on the free parameter of the UL factorization in terms of certain continued fraction such that this stochastic factorization is possible. By inverting the order of multiplication (also known as a Darboux transformation) we get a new family of random walks where it is possible the identify the spectral measures in terms of a Geronimus transformation. The same can be done for the LU factorization but now without a free parameter. Finally, we apply our results in two examples, the random walk with constant transition probabilities and the random walk generated by the Jacobi orthogonal polynomials. In both situations we give urn models associated with all the random walks in question.

Explore related subjects

Keep this discovery

BibTeXRIS

F. Alberto Grünbaum, Manuel D. de la Iglesia. 2017-06-08. Stochastic LU factorizations, Darboux transformations and urn models. https://arxiv.org/abs/1706.02617

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