To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
In this article, we contribute to the study of the dynamics by conjugation on the space of subgroups of Baumslag–Solitar groups $\mathrm {BS}(m,n)$ via the mixing properties of elements asymptotically produced by suitable random walks on the group. In an acylindrically hyperbolic context, Hull, Minasyan and Osin [Subgroup mixing and random walks in groups acting on hyperbolic spaces. Ergod. Th. & Dynam. Sys.46(10) (2026), 2505–2541] demonstrated strong mixing situations, namely topological $\mu $-mixing, a strengthening of high topological transitivity. Regarding non-metabelian $\mathrm {BS}(m,n)$ with $|m|\neq |n|$, we exhibit here a radically different situation on each of the pieces except one of the partition introduced by Carderi, Gaboriau, Le Maître and Stalder [On the space of subgroups of Baumslag–Solitar groups I: perfect kernel and phenotype. Rev. Mat. Iberoam.41(5) (2025), 1711–1758] (although it is highly topologically transitive on each piece). However, when $|m|= |n|$, we demonstrate the topological $\mu $-mixing character of the action on each of the pieces.
Let $\{U(n)\}_{n \geq 0}$ be a sequence of independent random variables such that U(n) is distributed uniformly on $\{0, 1, 2, \dots, n\}$. The Ulam–Kac adder is the history-dependent random sequence defined by $X_{n + 1} = X_{n} + X_{U(n)}$ with the initial condition $X_0 = 1$. We show that for each $m \geq 1$, $\log \mathbb{E}[X_n^m]/\sqrt{n}$ approaches a constant $c_m$ as $n \to \infty$. For a given m, a method is provided which allows the high-accuracy numerical computation of $c_m$. For arbitrary m, loose bounds are provided.
The return probability in the simple symmetric random walk on the four-dimensional lattice $\mathbb {Z}^4$ is evaluated in closed form in terms of the generalised hypergeometric function.
We study a class of unbalanced step-reinforced random walks that unifies the elephant random walk, the positively step-reinforced random walk, and the negatively step-reinforced random walk. By establishing a connection with bond percolation on random recursive trees, these processes can be represented as randomly weighted sums of independent and identically distributed random variables. We derive Gaussian and non-Gaussian stable limit theorems for such randomly weighted sums, and then apply these results to obtain corresponding stable limit theorems for unbalanced step-reinforced random walks.
The tail behavior of aggregates of heavy-tailed random vectors is known to be determined by the so-called principle of ‘one large jump’, be it for finite sums, random sums, or Lévy processes. We establish that, in fact, a more general principle is at play. Assuming that the random vectors are multivariate regularly varying on various subcones of the positive orthant $[0,\infty)^d$, first we show that their aggregates are also multivariate regularly varying on these subcones. This allows us to approximate certain tail probabilities rendered asymptotically negligible under classical regular variation. Second, we discover that depending on the structure of a particular tail event, the tail behavior of the aggregates may be characterized by more than a single large jump. Finally, we illustrate a similar phenomenon for regularly varying multivariate Lévy processes, establishing as well a relationship between regular variation of a multivariate Lévy process and multivariate regular variation of its Lévy measure on different subcones. The applicability of these results in financial and insurance risk management is discussed.
Consider a random walk in a time-inhomogeneous random environment. When the environment is stationary and ergodic, we identify a quenched harmonic function for almost every realization of the environment. This function allows us to define a random walk in a random environment conditioned to stay positive, using Doob’s h-transform.
Distributed ledgers, including blockchain and other decentralized databases, are designed to store information online where all trusted network members can update the data with transparency. The dynamics of a ledger’s development can be mathematically represented by a directed acyclic graph (DAG). In this paper, we study a DAG model that considers batch arrivals and random delay of attachment. We analyze the asymptotic behavior of this model by letting the arrival rate go to infinity and the inter-arrival time go to zero. We establish that the number of leaves in the DAG, as well as various random variables characterizing the vertices in the DAG, can be approximated by its fluid limit, represented as the solution to a set of delayed partial differential equations. Furthermore, we establish the stable state of this fluid limit and validate our findings through simulations.
Balister, the second author, Groenland, Johnston, and Scott recently showed that there are asymptotically $C4^n/n^{3/4}$ many unordered sequences that occur as degree sequences of graphs with $n$ vertices. Combining limit theory for infinitely divisible distributions with a new connection between a class of random walk trajectories and a subset counting formula from additive number theory, we describe $C$ in terms of Walkup’s number of rooted plane trees. The bijection is related to an instance of the Lévy–Khintchine formula. Our main result complements a result of Stanley, that ordered graphical sequences are related to quasi-forests.
In this article, we focus on the systemic expected shortfall and marginal expected shortfall in a multivariate continuous-time risk model with a general càdlàg process. Additionally, we conduct our study under a mild moment condition that is easily satisfied when the general càdlàg process is determined by some important investment return processes. In the presence of heavy tails, we derive asymptotic formulas for the systemic expected shortfall and marginal expected shortfall under the framework that includes wide dependence structures among losses, covering pairwise strong quasi-asymptotic independence and multivariate regular variation. Our results quantify how the general càdlàg process, heavy-tailed property of losses, and dependence structures influence the systemic expected shortfall and marginal expected shortfall. To discuss the interplay of dependence structures and heavy-tailedness, we apply an explicit order 3.0 weak scheme to estimate the expectations related to the general càdlàg process. This enables us to validate the moment condition from a numerical perspective and perform numerical studies. Our numerical studies reveal that the asymptotic dependence structure has a significant impact on the systemic expected shortfall and marginal expected shortfall, but heavy-tailedness has a more pronounced effect than the asymptotic dependence structure.
We study random walks on metric spaces with contracting isometries. In this first article of the series, we establish sharp deviation inequalities by adapting Gouëzel’s pivotal time construction. As an application, we establish the exponential bounds for deviation from below, central limit theorem, law of the iterated logarithms, and the geodesic tracking of random walks on mapping class groups and CAT(0) spaces.
The payoff in the Chow–Robbins coin-tossing game is the proportion of heads when you stop. Stopping to maximize expectation was addressed by Chow and Robbins (1965), who proved there exist integers ${k_n}$ such that it is optimal to stop at n tosses when heads minus tails is ${k_n}$. Finding ${k_n}$ was unsolved except for finitely many cases by computer. We prove an $o(n^{-1/4})$ estimate of the stopping boundary of Dvoretsky (1967), which then proves ${k_n} = \left\lceil {\alpha \sqrt n \,\, - 1/2\,\, + \,\,\frac{{\left( { - 2\zeta (\! -1/2)} \right)\sqrt \alpha }}{{\sqrt \pi }}{n^{ - 1/4}}} \right\rceil $ except for n in a set of density asymptotic to 0, at a power law rate. Here, $\alpha$ is the Shepp–Walker constant from the Brownian motion analog, and $\zeta$ is Riemann’s zeta function. An $n^{ - 1/4}$ dependence was conjectured by Christensen and Fischer (2022). Our proof uses moments involving Catalan and Shapiro Catalan triangle numbers which appear in a tree resulting from backward induction, and a generalized backward induction principle. It was motivated by an idea of Häggström and Wästlund (2013) to use backward induction of upper and lower Value bounds from a horizon, which they used numerically to settle a few cases. Christensen and Fischer, with much better bounds, settled many more cases. We use Skorohod’s embedding to get simple upper and lower bounds from the Brownian analog; our upper bound is the one found by Christensen and Fischer in another way. We use them first for yet many more examples and a conjecture, then algebraically in the tree, with feedback to get much sharper Value bounds near the border, and analytic results. Also, we give a formula that gives the exact optimal stop rule for all n up to about a third of a billion; it uses the analytic result plus terms arrived at empirically.
We introduce and study a game-theoretic model to understand the spread of an epidemic in a homogeneous population. A discrete-time stochastic process is considered where, in each epoch, first, a randomly chosen agent updates their action trying to maximize a proposed utility function, and then agents who have viral exposures beyond their immunity get infected. Our main results discuss asymptotic limiting distributions of both the cardinality of the subset of infected agents and the action profile, considered under various values of two parameters (initial action and immunity profile). We also show that the theoretical distributions are almost always achieved in the first few epochs.
Let $\{\omega _n\}_{n\geq 1}$ be a sequence of independent and identically distributed random variables on a probability space $(\Omega , \mathcal {F}, \mathbb {P})$, each uniformly distributed on the unit circle $\mathbb {T}$, and let $\ell _n=cn^{-\tau }$ for some $c>0$ and $0<\tau <1$. Let $I_{n}=(\omega _n,\omega _n+\ell _n)$ be the random interval with left endpoint $\omega _n$ and length $\ell _n$. We study the asymptotic property of the covering time $N_n(x)=\sharp \{1\leq k\leq n: x\in I_k\}$ for each $x\in \mathbb {T}$. We prove the quenched central limit theorem for the covering time, that is, $\mathbb {P}$-almost surely,
Let $G$ be a group. The notion of linear sofic approximations of $G$ over an arbitrary field $F$ was introduced and systematically studied by Arzhantseva and Păunescu [3]. Inspired by one of the results of [3], we introduce and study the invariant $\kappa _F(G)$ that captures the quality of linear sofic approximations of $G$ over $F$. In this work, we show that when $F$ has characteristic zero and $G$ is linear sofic over $F$, then $\kappa _F(G)$ takes values in the interval $[1/2,1]$ and $1/2$ cannot be replaced by any larger value. Further, we show that under the same conditions, $\kappa _F(G)=1$ when $G$ is torsion-free. These results answer a question posed by Arzhantseva and Păunescu [3] for fields of characteristic zero. One of the new ingredients of our proofs is an effective non-concentration estimates for random walks on finitely generated abelian groups, which may be of independent interest.
We investigate the tail behavior of the first-passage time for Sinai’s random walk in a random environment. Our method relies on the connection between Sinai’s walk and branching processes with immigration in a random environment, and the analysis on some important quantities of these branching processes such as extinction time, maximum population, and total population.
In this paper, we study random walks on groups that contain superlinear-divergent geodesics, in the line of thoughts of Goldsborough and Sisto. The existence of a superlinear-divergent geodesic is a quasi-isometry invariant which allows us to execute Gouëzel’s pivoting technique. We develop the theory of superlinear divergence and establish a central limit theorem for random walks on these groups.
We consider two continuous-time generalizations of conservative random walks introduced in Englander and Volkov (2022), an orthogonal and a spherically symmetrical one; the latter model is also known as random flights. For both models, we show the transience of the walks when $d\ge 2$ and that the rate of direction changing follows a power law $t^{-\alpha}$, $0<\alpha\le 1$, or the law $(\!\ln t)^{-\beta}$ where $\beta>2$.
We present a detailed analysis of random motions moving in higher spaces with a natural number of velocities. In the case of the so-called minimal random dynamics, under some broad assumptions, we give the joint distribution of the position of the motion (for both the inner part and the boundary of the support) and the number of displacements performed with each velocity. Explicit results for cyclic and complete motions are derived. We establish useful relationships between motions moving in different spaces, and we derive the form of the distribution of the movements in arbitrary dimension. Finally, we investigate further properties for stochastic motions governed by non-homogeneous Poisson processes.
We prove that the local time of random walks conditioned to stay positive converges to the corresponding local time of three-dimensional Bessel processes by proper scaling. Our proof is based on Tanaka’s pathwise construction for conditioned random walks and the derivation of asymptotics for mixed moments of the local time.
We investigate the translation lengths of group elements that arise in random walks on the isometry groups of Gromov hyperbolic spaces. In particular, without any moment condition, we prove that non-elementary random walks exhibit at least linear growth of translation lengths. As a corollary, almost every random walk on mapping class groups eventually becomes pseudo-Anosov, and almost every random walk on $\mathrm {Out}(F_n)$ eventually becomes fully irreducible. If the underlying measure further has finite first moment, then the growth rate of translation lengths is equal to the drift, the escape rate of the random walk.
We then apply our technique to investigate the random walks induced by the action of mapping class groups on Teichmüller spaces. In particular, we prove the spectral theorem under finite first moment condition, generalizing a result of Dahmani and Horbez.