相关论文: Random walks driven by low moment measures

For any (Hausdorff) compact group $G$ with the normalized Haar measure ${\mathbf m}_G$, denote by ${\rm cp}(G)$ the probability ${\mathbf m}_{G\times G}(\{(x,y)\in G\times G \;|\; xy=yx\})$ of commuting a randomly chosen pair of elements of…

For a finite group $G$, we denote by ${\sf d}(G)$ and by ${\sf E}(G)$, respectively, the small Davenport constant and the Gao constant of $G$. Let $C_n$ be the cyclic group of order $n$ and let $G_{m,n,s} = C_n \rtimes_s C_m$ be a…

We study periodic points and finitely supported invariant measures for continuous semigroup actions. Introducing suitable notions of periodicity in both topological and measure-theoretical contexts, we analyze the space of invariant Borel…

The probability that a symmetric random walk in a hyperbolic group reaches a proper power has the same exponential rate of decay as the probability of return to the identity.

We consider the statistical deconvolution problem where one observes $n$ replications from the model $Y=X+\epsilon$, where $X$ is the unobserved random signal of interest and $\epsilon$ is an independent random error with distribution…

The study of random walks has increasingly been popular across diverse disciplines such as statistics, mathematics, quantum physics, where they are used to model paths consisting of successive random steps in a mathematical space. A…

We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the…

Suppose we are given finitely generated groups $\Gamma_1,...,\Gamma_m$ equipped with irreducible random walks. Thereby we assume that the expansions of the corresponding Green functions at their radii of convergence contain only logarithmic…

Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…

We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

It is known that every infinite index quasi-convex subgroup $H$ of a non-elementary hyperbolic group $G$ is a free factor in a larger quasi-convex subgroup of $G$. We give a probabilistic generalization of this result. That is, we show that…

We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The…

Given two subsets $X,Y$ of a finite group $G$, we write $\Pr(X,Y)$ for the probability that random elements $x \in X$ and $y \in Y$ commute. If $X,Y$ are subgroups, we denote by $\Pr^*(X,Y)$ the maximum real number $\epsilon$ with the…

We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We suppose that the distributions of…

Given a $1$-cocycle $b$ with coefficients in an orthogonal representation, we show that any finite dimensional summand of $b$ is cohomologically trivial if and only if $\| b(X_n) \|^2/n$ tends to a constant in probability, where $X_n$ is…

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…

Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \in V$, and a walk length $t\in \mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\pm…