相关论文: Random walks and orthogonal polynomials: some chal…
We bound the rate of convergence to uniformity for certain random walks on the complete monomial groups G \wr S_n for any group G. These results provide rates of convergence for random walks on a number of groups of interest: the…
A natural extension of a right-continuous integer-valued random walk is one which can jump to the right by one or two units. First passage times above a given fixed level then admit a tractable Laplace transform (probability generating…
We show that the Circular Orthogonal Ensemble of random matrices arises naturally from a family of random polynomials. This sheds light on the appearance of random matrix statistics in the zeros of the Riemann zeta-function.
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
We study random walks on sub-Riemannian manifolds using the framework of retractions, i.e., approximations of normal geodesics. We show that such walks converge to the correct horizontal Brownian motion if normal geodesics are approximated…
We derive a closed-form expression for the orthogonal polynomials associated with the general lognormal density. The result can be utilized to construct easily computable approximations for probability density function of a product of…
This paper explores the joint behaviour of the summands of a random walk when their mean value goes to infinity as its length increases. It is proved that all the summands must share the same value, which extends previous results in the…
Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…
Many human social phenomena, such as cooperation, the growth of settlements, traffic dynamics and pedestrian movement, appear to be accessible to mathematical descriptions that invoke self-organization. Here we develop a model of pedestrian…
We study experimentally systems of orthogonal polynomials with respect to self-similar measures. When the support of the measure is a Cantor set, we observe some interesting properties of the polynomials, both on the Cantor set and in the…
Krawtchouk's polynomials occur classically as orthogonal polynomials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic…
We discuss asymptotic properties of a family of discrete probability measures which may be used to model particle configurations with a wall on a set of discrete nodes. The correlations are shown to be determinantal and are expressed in…
In this article, we will explore why Karlin-McGregor method of using orthogonal polynomials in the study of Markov processes was so successful for one dimensional nearest neighbor processes, but failed beyond nearest neighbor transitions.…
We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…
Let $G$ be a finitely generated group of polynomial volume growth equipped with a word-length $|\cdot|$. The goal of this paper is to develop techniques to study the behavior of random walks driven by symmetric measures $\mu$ such that, for…
A sufficient condition for the uniqueness of multinomial sequential unbiased estimators is provided generalizing a classical result for binomial samples. Unbiased estimators are applied to infer the parameters of multidimensional or…
It is well known that the zeros of orthogonal polynomials interlace. In this paper we study the case of multiple orthogonal polynomials. We recall known results and some recursion relations for multiple orthogonal polynomials. Our main…
Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding…
We study the set of directions asymptotically explored by a spatially homogeneous random walk in $d$-dimensional Euclidean space. We survey some pertinent results of Kesten and Erickson, make some further observations, and present some…
Polynomials known as Multiple Orthogonal Polynomials in a single variable are polynomials that satisfy orthogonality conditions concerning multiple measures and play a significant role in several applications such as Hermite-Pad\'e…