相关论文: Scenery Reconstruction on Finite Abelian Groups

We study both the positively and negatively step-reinforced random walks with parameter $p$. For a step distribution $\mu$ with finite second moment, the positively step-reinforced random walk with $p\in [1/2,1)$ and the negatively…

We investigate the directed random walk on hierarchic trees. Two cases are investigated: random variables on deterministic trees with a continuous branching, and random variables on the trees constructed trough the random branching process.…

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…

Given a family of systems, identifying stabilizing switching signals in terms of infinite walks constructed by concatenating cycles on the underlying directed graph of a switched system that satisfy certain conditions, is a well-known…

In a recent letter [PRL 80 (1998) 3539] Fisher, Le Doussal and Monthus report new predictions for the persistence properties of Sinai's model, which they obtain by using an approximate real space renormalization group scheme. In this…

We study the condensation regime of the finite reversible inclusion process, i.e., the inclusion process on a finite graph $S$ with an underlying random walk that admits a reversible measure. We assume that the random walk kernel is…

We consider the simplest model of a passive biped walking down a slope given by the equations of switched coupled pendula (McGeer, 1990). Following the fundamental work by Garcia et al (1998), we view the slope of the ground as a small…

We study the circumstances under which one can reconstruct a stack from its associated functor of isomorphism classes. This is possible surprisingly often: we show that many of the standard examples of moduli stacks are determined by their…

We classify abelian subgroups of Out(F_n) up to finite index in an algorithmic and computationally friendly way. A process called disintegration is used to canonically decompose a single rotationless element \phi into a composition of…

We prove a Law of Iterated Logarithm for random walks on a family of diagonal products constructed by Brieussel and Zheng (2021). This provides a wide variety of new examples of Law of Iterated Logarithm behaviours for random walks on…

A cycle is algebraically trivial if it can be exhibited as the difference of two fibers in a family of cycles parameterized by a smooth scheme. Over an algebraically closed field, it is a result of Weil that it suffices to consider families…

Given a scheme over a complete discrete valuation ring of mixed characteristic with perfect residue field, the Greenberg transform produces a new scheme over the residue field thicker than the special fiber. In this paper, we will…

We study the probability that certain laws are satisfied on infinite groups, focusing on elements sampled by random walks. For several group laws, including the metabelian one, we construct examples of infinite groups for which the law…

We introduce a generalisation of Sch\"{u}tz and Trimper's elephant random walk to finitely generated groups. We focus on the simplest non-abelian setting, i.e. groups whose Cayley graphs are homogeneous trees of degree $d \ge 3$. We show…

In this short paper, we consider the Once-reinforced random walk with reinforcement parameter $a$ on trees with bounded degree which are transient for the simple random walk. On each of these trees, we prove that there exists an explicit…

Given an initial distribution of sand in an Abelian sandpile, what final state does it relax to after all possible avalanches have taken place? In d >= 3, we show that this problem is P-complete, so that explicit simulation of the system is…

We prove that the edge-reinforced random walk on the ladder ${\mathbb{Z}\times\{1,2\}}$ with initial weights $a>3/4$ is recurrent. The proof uses a known representation of the edge-reinforced random walk on a finite piece of the ladder as a…

We introduce the discrete affine group of a regular tree as a finitely generated subgroup of the affine group. We describe the Poisson boundary of random walks on it as a space of configurations. We compute isoperimetric profile and Hilbert…

In the study of walks with small steps confined to multidimensional orthants, a certain group of transformations plays a central role. In particular, several techniques to potentially compute the generating function, including the orbit sum…

Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…