Related papers: Walking into an absolute sum

In this paper, we provide some novel binomial convolution related to symmetric functions, as well as convolution sums without the binomial symbol. Moreover we give some new convolution sums of Bernoulli, Euler, and Genocchi numbers and…

Consider a symmetric aperiodic random walk in $Z^d$, $d\geq 3$. There are points (called heavy points) where the number of visits by the random walk is close to its maximum. We investigate the local times around these heavy points and show…

We continue the research of Lata{\l}a on improving estimates of $p$-th moments of sums of independent random variables. We generalize some of his results in the case when $2 \leq p \leq 4$ and present a combinatorial approach for even…

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…

Below is a method for relating a mixed volume computation for polytopes sharing many facet directions to a symmetric random walk. The example of permutahedra and particularly hypersimplices is expanded upon.

A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard $n$-dimensional…

The explicit double sum for the associated Laguerre polynomials is derived combinatorially. The moments are described using certain statistics on permutations and permutation tableaux. Another derivation of the double sum is provided using…

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…

The harmonic measure $\nu$ on the boundary of the group $Sol$ associated to a discrete random walk of law $\mu$ was described by Kaimanovich. We investigate when it is absolutely continuous or singular with respect to Lebesgue measure. By…

We study coupled random walks in the plane such that, at each step, the walks change direction by a uniform random angle plus an extra deterministic angle \theta. We compute the Hausdorff dimension of the \theta for which the walk has an…

The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…

We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results.…

We consider the $1$-dimensional reflected Brownian motion and $3$-dimensional Bessel process and the general models. By decomposing the hitting times of consecutive sites into loops, we obtain identities, called loop identities, for the…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…

We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…

We study randomly stopped sums via their asymptotic scales. First, finiteness of moments is considered. To generalise this study, asymptotic scales applicable to the class of all heavy-tailed random variables are used. The stopping is…

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial $Y = 1 + \xi_1 + \xi_1 \xi_2 + \xi_1 \xi_2 \xi_3 + ...$ of independent and identically distributed non-negative random variables. It…

We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N),…

Trace monoids and heaps of pieces appear in various contexts in combinatorics. They also constitute a model used in computer science to describe the executions of asynchronous systems. The design of a natural probabilistic layer on top of…