中文
相关论文

相关论文: On the joint behaviour of speed and entropy of ran…

200 篇论文

For every 3/4 <= beta < 1 we construct a finitely generated group so that the expected distance of the simple random walk from its starting point is within a constant factor of n^beta. In fact, the speed can be set precisely to equal any…

概率论 · 数学 2021-03-23 Gideon Amir , Balint Virag

A variety of behaviors of entropy functions of random walks on finitely generated groups is presented, showing that for any $\frac{1}{2}\leq \alpha\leq\beta\leq1$, there is a group $\Gamma$ with measure $\mu$ equidistributed on a finite…

群论 · 数学 2013-12-17 Jérémie Brieussel

We construct, for each real number $0\leq \alpha \leq 1$, a random walk on a finitely generated semigroup whose speed exponent is $\alpha$. We further show that the speed function of a random walk on a finitely generated semigroup can be…

群论 · 数学 2025-04-15 Guy Blachar , Be'eri Greenfeld

We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…

统计力学 · 物理学 2009-11-11 Alain Comtet , Satya N. Majumdar

We show that for each $\lambda \in [\frac{1}{2}, 1]$, there exists a solvable group and a finitely supported measure such that the associated random walk has upper speed exponent $\lambda$.

群论 · 数学 2015-05-14 Jérémie Brieussel

A graph is said to be walk-regular if, for each $\ell \geq 1$, every vertex is contained in the same number of closed walks of length $\ell$. We construct a $24$-vertex graph $H_4$ that is not walk-regular yet has maximized walk entropy,…

组合数学 · 数学 2018-02-08 Kyle Kloster , Daniel Král' , Blair D. Sullivan

We consider nondegenerate, finitely supported random walks on a finitely generated Gromov hyperbolic group. We show that the entropy and the escape rate are Lipschitz functions of the probability if the support remains constant.

概率论 · 数学 2013-10-22 François Ledrappier

We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Gamma. We consider all walks of length N on G, starting from v_i and ending at v_j To each such walk $w$…

数论 · 数学 2007-05-23 Igor Rivin

We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…

概率论 · 数学 2015-03-11 Lorenz A. Gilch

An excited random walk is a non-Markovian extension of the simple random walk, in which the walk's behavior at time $n$ is impacted by the path it has taken up to time $n$. The properties of an excited random walk are more difficult to…

概率论 · 数学 2017-09-05 Mike Cinkoske , Joe Jackson , Claire Plunkett

Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph…

We consider a variant of random walks on finite groups. At each step, we choose an element from a set of generators ("directions") uniformly, and an integer from a power law ("speed") distribution associated with the chosen direction. We…

概率论 · 数学 2022-03-14 Laurent Saloff-Coste , Yuwen Wang

We address the question of distance record-setting by a random walker in the presence of measurement error, $\delta$, and additive noise, $\gamma$ and show that the mean number of (upper) records up to $n$ steps still grows universally as…

数据分析、统计与概率 · 物理学 2013-05-08 Yaniv Edery , Alexander B. Kostinski , Satya N. Majumdar , Brian Berkowitz

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

We study asymptotic properties of the Green metric associated with transient random walks on countable groups. We prove that the rate of escape of the random walk computed in the Green metric equals its asymptotic entropy. The proof relies…

概率论 · 数学 2009-09-29 Sébastien Blachère , Peter Haïssinsky , Pierre Mathieu

We give a solution to the inverse problem (given a function, find a corresponding group) for large classes of speed, entropy, isoperimetric profile, return probability and $L_p$-compression functions of finitely generated groups of…

群论 · 数学 2016-07-08 Jérémie Brieussel , Tianyi Zheng

Let $\Gamma$ be a countable group acting on a geodesic hyperbolic metric space $X$ and $\mu$ a probability measure on $\Gamma$ which generates a non elementary semi-group. Under the necessary assumption that $\mu$ has a finite exponential…

概率论 · 数学 2020-08-20 Adrien Boulanger , Pierre Mathieu

For \Gamma a countable amenable group consider those actions of \Gamma as measure-preserving transformations of a standard probability space, written as {T_\gamma}_{\gamma \in \Gamma} acting on (X,{\cal F}, \mu). We say…

动力系统 · 数学 2016-09-07 Daniel J. Rudolph , Benjamin Weiss

We show that the asymptotic entropy of a random walk on a nonelementary hyperbolic group, with symmetric and bounded increments, is differentiable and we identify its derivative as a correlation. We also prove similar results for the rate…

概率论 · 数学 2015-01-12 P. Mathieu

The notion of walk entropy $S^V(G,\beta)$ for a graph $G$ at the inverse temperature $\beta$ was put forward recently by Estrada et al. (2014) \cite{6}. It was further proved by Benzi \cite{1} that a graph is walk-regular if and only if its…

数学物理 · 物理学 2019-02-05 Ernesto Estrada , Jose A. de la Pena
‹ 上一页 1 2 3 10 下一页 ›