Related papers: Enumeration of simple random walks and tridiagonal…
We study arithmetic properties of short uniform random walks in arbitrary dimensions, with a focus on explicit (hypergeometric) evaluations of the moment functions and probability densities in the case of up to five steps. Somewhat to our…
It is shown that the combinatorics of commutation relations is well suited for analyzing the convergence rate of certain Markov chains. Examples studied include random walk on irreducible representations, a local random walk on partitions…
A new approach to stochastic integration is described, which is based on an a.s. pathwise approximation of the integrator by simple, symmetric random walks. Hopefully, this method is didactically more advantageous, more transparent, and…
We answer some questions on the asymptotics of ballot walks raised in [Personal Journal Shalosh B Ekhad and Doron Zeilberger, Apr 5, 2021; see also arXiv:2104.01731] and prove that these models are not D-finite. This short note demonstrates…
We employ a simple and accurate dimensional interpolation formula for the shapes of random walks at $D=3$ and $D=2$ based on the analytically known solutions at both limits $D=\infty$ and $D=1$. The results obtained for the radii of…
A prototypical problem on which techniques for exact enumeration are tested and compared is the enumeration of self-avoiding walks. Here, we show an advance in the methodology of enumeration, making the process thousands or millions of…
We define a new stochastic process on general simplicial complexes which allows to study their spectral and homological properties. Some results for random walks on graphs are shown to hold in this general setting. As an application, the…
A particle subject to successive, random displacements is said to execute a random walk (in position or some other coordinate). The mathematical properties of random walks have been very thoroughly investigated, and the model is used in…
We revisit the problem of estimates of moments of random n-dimensional matrices of Wigner ensemble by using the approach elaborated by Ya. Sinai and A. Soshnikov and further developed by A. Ruzmaikina. Our main subject is given by the…
We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.
In this paper we study a one-dimensional quantum random walk with the Hadamard transformation which is often called the Hadamard walk. We construct the Hadamard walk using a transition matrix on probability amplitude and give some results…
We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective…
We prove the trichotomy between transience to the right, transience to the left and recurrence of one-dimensional nearest-neighbour random walks in dynamic random environments under fairly general assumptions, namely: stationarity under…
Although the theoretical behavior of one-dimensional random walks in random environments is well understood, the numerical evaluation of various characteristics of such processes has received relatively little attention. This paper develops…
We establish three identities involving Dyck paths and alternating Motzkin paths, whose proofs are based on variants of the same bijection. We interpret these identities in terms of closed random walks on the halfline. We explain how these…
This thesis examines edge-reinforced random walks with some modifications to the standard definition. An overview of known results relating to the standard model is given and the proof of recurrence for the standard linearly edge-reinforced…
We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via…
In this paper we announce a conjecture concerning enumeration of n-times persymmetric matrices over F_2 by rank. To justify our statement we remark that the formulas obtained are valid for n equal to one, two and three.
The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…
We extend the notion of nonbacktracking walks from unweighted graphs to graphs whose edges have a nonnegative weight. Here the weight associated with a walk is taken to be the product over the weights along the individual edges. We give two…