中文
相关论文

相关论文: The weak Bruhat order for random walks on Coxeter …

200 篇论文

A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…

量子物理 · 物理学 2020-04-08 Suchetana Mukhopadhyay , Parongama Sen

We consider random walk on a finite group $G$ as follows. We can consider $G$ as a group of substitutions. Randomly (i.e. with probability $U(g)=|G|^{-1}$ ) we choose a substitution $g \in G$ and execute it twice in a row, i.e. execute a…

表示论 · 数学 2023-07-11 Olexandr Vyshnevetskiy , Alexander Bendikov

We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…

概率论 · 数学 2015-09-15 Peggy Cénac , Basile De Loynes , Arnaud Le Ny , Yoann Offret

We derive a lower bound for the probability that a random walk with i.i.d.\ increments and small negative drift $\mu$ exceeds the value $x>0$ by time $N$. When the moment generating functions are bounded in an interval around the origin,…

概率论 · 数学 2020-11-12 Ofer Busani , Timo Seppäläinen

What is the probability that a random walk in the free group ends in a proper power? Or in a primitive element? We present a formula that computes the exponential decay rate of the probability that a random walk on a regular tree ends in a…

概率论 · 数学 2024-12-30 Doron Puder

Associated to a random walk on $\mathbb{Z}$ and a positive integer $n$, there is a return probability of the random walk returning to the origin after $n$ steps. An interesting question is when the set of return probabilities uniquely…

概率论 · 数学 2015-12-15 Max Zhou

We consider a random walk on the mapping class group of a surface of finite type. We assume that the random walk is determined by a probability measure whose support is finite and generates a non-elementary subgroup $H$. We further assume…

几何拓扑 · 数学 2016-02-24 Hidetoshi Masai

Let $W$ be a finite Weyl group and ${\hat{W}}$ be the corresponding affine Weyl group. We show that a large element in ${\hat{W}}$, randomly generated by (reduced) multiplication by simple generators, almost surely has one of $|W|$-specific…

概率论 · 数学 2015-09-10 Thomas Lam

Let $G$ be a real Lie group, $\Lambda\subseteq G$ a lattice, and $X=G/\Lambda$. We fix a probability measure $\mu$ on $G$ and consider the left random walk induced on $X$. It is assumed that $\mu$ is aperiodic, has a finite first moment,…

概率论 · 数学 2021-12-14 Timothée Bénard

We formulate the problem of finding the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that…

离散数学 · 计算机科学 2008-05-15 Genta Ito

The probability that a randomly chosen element of a finite group is an $r$--th root (for any integer $r\geq2$) has been studied largely in case $r=2$. Certain techniques may be generalized for $r>2$ and here we find the exact value of this…

We construct a finitely generated group $G$ without the Liouville property such that the return probability of a random walk satisfies $p_{2n}(e,e) \gtrsim e^{-n^{1/2 + o(1)}}$. Recent results suggest that $1/2$ is indeed the smallest…

群论 · 数学 2018-01-12 Michał Kotowski , Bálint Virág

The commuting probability of a finite group is defined to be the probability that two randomly chosen group elements commute. Let P \subset (0,1] be the set of commuting probabilities of all finite groups. We prove that every point of P is…

群论 · 数学 2017-02-14 Sean Eberhard

The following random process on $\Z^4$ is studied. At first visit to a site, the two first coordinates perform a (2-dimensional) simple random walk step. At further visits, it is the last two coordinates which perform a simple random walk…

概率论 · 数学 2010-09-06 Itai Benjamini , Gady Kozma , Bruno Schapira

We consider the Grover walk on a finite graph composed of two arbitrary simple graphs connected by one edge, referred to as a bridge. The parameter $\epsilon>0$ assigned at the bridge represents the strength of connectivity: if…

量子物理 · 物理学 2026-05-05 Taisuke Hosaka , Etsuo Segawa

The entropy of the random walk on the discrete contable group could be used for comparison of the system of the generators. Fundamental inequality between growth, entropy and escape gives the possibility to define "the best" system of the…

概率论 · 数学 2014-11-18 Anatoly M. Vershik

Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…

动力系统 · 数学 2022-10-18 Timothée Bénard

Coalescing random walk on a unimodular random rooted graph for which the root has finite expected degree visits each site infinitely often almost surely. A corollary is that an opinion in the voter model on such graphs has infinite expected…

概率论 · 数学 2018-04-06 Eric Foxall , Tom Hutchcroft , Matthew Junge

We analyse a family of two-types Wright-Fisher models with selection in a random environment and skewed offspring distribution. We provide a calculable criterion to quantify the impact of different shapes of selection on the fate of the…

In this paper, we investigate various properties of strong and weak twisted Bruhat orders on a Coxeter group. In particular, we prove that any twisted strong Bruhat order on an affine Weyl group is locally finite, strengthening a result of…

表示论 · 数学 2020-02-11 Weijia Wang