相关论文: Random walks and orthogonal polynomials: some chal…

A functional approach for the study of the random walks in random sceneries (RWRS) is proposed. Under fairly general assumptions on the random walk and on the random scenery, functional limit theorems are proved. The method allows to study…

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…

I start by reviewing some basic properties of random graphs. I then consider the role of random walks in complex networks and show how they may be used to explain why so many long tailed distributions are found in real data sets. The key…

We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.

We give exact relations for a number of amplitude combinations that occur in the study of self-avoiding walks, polygons and lattice trails. In particular, we elucidate the lattice-dependent factors which occur in those combinations which…

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration…

We discuss recurrence and ergodicity properties of random walks and associated skew products for large classes of locally compact groups and homogeneous spaces. In particular we show that a closed subgroup of a product of finitely many…

Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…

We study the mean and variance of the number of self-intersections of the equilateral isotropic random walk in the plane, as well as the corresponding quantities for isotropic equilateral random polygons (random walks conditioned to return…

In this paper, we introduce a family of discrete rectangular uniform distributions on the natural numbers-referred to as orthogonal dice-characterized by the property that their means equal their variances. These distributions arise…

We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the…

A particle moves among the vertices of an $(m+1)$-gon which are labeled clockwise as $0,1,...,m$. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability $p$, or…

We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random…

We consider the use of random walks as an approach to obtain connection coefficients for higher-order Bernoulli and Euler polynomials. In particular, we consider the cases of a $1$-dimensional linear reflected Brownian motion and of a…

Inspired by the classical spectral analysis of birth-death chains using orthogonal polynomials, we study an analogous set of constructions in the context of open quantum dynamics and related walks. In such setting, block tridiagonal…

This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.

Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…

Edgeworth expansions for random walks on covering graphs with groups of polynomial volume growths are obtained under a few natural assumptions. The coefficients appearing in this expansion depends on not only geometric features of the…