We consider interacting urns on a finite directed network, where both sampling and reinforcement processes depend on the nodes of the network. This extends previous research by incorporating node-dependent sampling and reinforcement. We classify the sampling and reinforcement schemes, as well as the networks on which the proportion of balls of either colour in each urn converges almost surely to a deterministic limit. We also investigate conditions for achieving synchronisation of the colour proportions across the urns and analyse fluctuations under specific conditions on the reinforcement scheme and network structure.

We consider time-inhomogeneous ordinary differential equations (ODEs) whose parameters are governed by an underlying ergodic Markov process. When this underlying process is accelerated by a factor $\varepsilon^{-1}$, an averaging phenomenon occurs and the solution of the ODE converges to a deterministic ODE as $\varepsilon$ vanishes. We are interested in cases where this averaged flow is globally attracted to a point. In that case, the equilibrium distribution of the solution of the ODE converges to a Dirac mass at this point. We prove an asymptotic expansion in terms of $\varepsilon$ for this convergence, with a somewhat explicit formula for the first-order term. The results are applied in three contexts: linear Markov-modulated ODEs, randomized splitting schemes, and Lotka–Volterra models in a random environment. In particular, as a corollary, we prove the existence of two matrices whose convex combinations are all stable but are such that, for a suitable jump rate, the top Lyapunov exponent of a Markov-modulated linear ODE switching between these two matrices is positive.

We study the last exit time that a spectrally negative Lévy process is below zero until it reaches a positive level b, denoted by $g_{\tau_b^+}$. We generalize the results of the infinite-horizon last exit time explored by Chiu and Yin (2005) by incorporating a random horizon $\tau_b^+$, which represents the first passage time above b. We derive an explicit expression for the joint Laplace transform of $g_{\tau_b^+}$ and $\tau_b^+$ by utilizing a hybrid observation scheme approach proposed by Li, Willmot, and Wong (2018). We further study the optimal prediction of $g_{\tau_b^+}$ in the $L_1$ sense, and find that the optimal stopping time is the first passage time above a level $y_b^{\ast}$, with an explicit characterization of the stopping boundary $y_b^{\ast}$. As examples, Brownian motion with drift and the Cramér–Lundberg model with exponential jumps are considered.

Gut and Stadmüller (2021, 2022) initiated the study of the elephant random walk with limited memory. Aguech and El Machkouri (2024) published a paper in which they discuss an extension of the results by Gut and Stadtmüller (2022) for an ‘increasing memory’ version of the elephant random walk without stops. Here we present a formal definition of the process that was hinted at by Gut and Stadtmüller. This definition is based on the triangular array setting. We give a positive answer to the open problem in Gut and Stadtmüller (2022) for the elephant random walk, possibly with stops. We also obtain the central limit theorem for the supercritical case of this model.

We study a version of the stochastic control problem of minimizing the sum of running and controlling costs, where control opportunities are restricted to independent Poisson arrival times. Under a general setting driven by a general Lévy process, we show the optimality of a periodic barrier strategy, which moves the process upward to the barrier whenever it is observed to be below it. The convergence of the optimal solutions to those in the continuous-observation case is also shown.

The problem of reservation in a large distributed system is analyzed via a new mathematical model. The target application is car-sharing systems. This model is motivated by the large station-based car-sharing system in France called Autolib’. This system can be described as a closed stochastic network where the nodes are the stations and the customers are the cars. The user can reserve a car and a parking space. We study the evolution of the system when the reservation of parking spaces and cars is effective for all users. The asymptotic behavior of the underlying stochastic network is given when the number N of stations and the fleet size M increase at the same rate. The analysis involves a Markov process on a state space with dimension of order $N^2$. It is quite remarkable that the state process describing the evolution of the stations, whose dimension is of order N, converges in distribution, although not Markov, to a non-homogeneous Markov process. We prove this mean-field convergence. We also prove, using combinatorial arguments, that the mean-field limit has a unique equilibrium measure when the time between reserving and picking up the car is sufficiently small. This result extends the case where only the parking space can be reserved.

The basic question in perturbation analysis of Markov chains is: how do small changes in the transition kernels of Markov chains translate to chains in their stationary distributions? Many papers on the subject have shown, roughly, that the change in stationary distribution is small as long as the change in the kernel is much less than some measure of the convergence rate. This result is essentially sharp for generic Markov chains. We show that much larger errors, up to size roughly the square root of the convergence rate, are permissible for many target distributions associated with graphical models. The main motivation for this work comes from computational statistics, where there is often a tradeoff between the per-step error and per-step cost of approximate MCMC algorithms. Our results show that larger perturbations (and thus less-expensive chains) still give results with small error.

Early investigation of Pólya urns considered drawing balls one at a time. In the last two decades, several authors have considered multiple drawing in each step, but mostly for schemes involving two colors. In this manuscript, we consider multiple drawing from urns of balls of multiple colors, formulating asymptotic theory for specific urn classes and addressing more applications. The class we consider is affine and tenable, built around a ‘core’ square matrix. We examine cases where the urn is irreducible and demonstrate its relationship to matrix irreducibility for its core matrix, with examples provided. An index for the drawing schema is derived from the eigenvalues of the core. We identify three regimes: small, critical, and large index. In the small-index regime, we find an asymptotic Gaussian law. In the critical-index regime, we also find an asymptotic Gaussian law, albeit with a difference in the scale factor, which involves logarithmic terms. In both of these regimes, we have explicit forms for the structure of the mean and the covariance matrix of the composition vector (both exact and asymptotic). In all three regimes we have strong laws.

We propose a novel and unified sampling scheme, called the accelerated group sequential sampling scheme, which incorporates four different types of sampling scheme: (i) the classic Anscombe–Chow–Robbins purely sequential sampling scheme; (ii) the accelerated sequential sampling scheme; (iii) the relatively new k-at-a-time group sequential sampling scheme; and (iv) the new k-at-a-time accelerated group sequential sampling scheme. The first-order and second-order properties of this unified sequential sampling scheme are fully investigated with two illustrations on minimum risk point estimation for the mean of a normal distribution and on bounded variance point estimation for the location parameter of a negative exponential distribution. We also provide extensive Monte Carlo simulation studies and real data analyses for each illustration.

The embedding problem of Markov chains examines whether a stochastic matrix$\mathbf{P} $ can arise as the transition matrix from time 0 to time 1 of a continuous-time Markov chain. When the chain is homogeneous, it checks if $ \mathbf{P}=\exp{\mathbf{Q}}$ for a rate matrix $ \mathbf{Q}$ with zero row sums and non-negative off-diagonal elements, called a Markov generator. It is known that a Markov generator may not always exist or be unique. This paper addresses finding $ \mathbf{Q}$, assuming that the process has at most one jump per unit time interval, and focuses on the problem of aligning the conditional one-jump transition matrix from time 0 to time 1 with $ \mathbf{P}$. We derive a formula for this matrix in terms of $ \mathbf{Q}$ and establish that for any $ \mathbf{P}$ with non-zero diagonal entries, a unique $ \mathbf{Q}$, called the ${\unicode{x1D7D9}}$-generator, exists. We compare the ${\unicode{x1D7D9}}$-generator with the one-jump rate matrix from Jarrow, Lando, and Turnbull (1997), showing which is a better approximate Markov generator of $ \mathbf{P}$ in some practical cases.

The distribution theory for discrete-time renewal–reward processes with dependent rewards is developed through the derivation of double transforms. By dependent, we mean the more realistic setting in which the reward for an interarrival period is dependent on the duration of the associated interarrival time. The double transforms are the generating functions in time of the time-dependent reward probability-generating functions. Residue and saddlepoint approximations are used to invert such double transforms so that the reward distribution at arbitrary time n can be accurately approximated. In addition, double transforms are developed for the first-passage time distribution that the cumulative reward exceeds a fixed threshold amount. These distributions are accurately approximated by inverting the double transforms using residue and saddlepoint approximation methods. The residue methods also provide asymptotic expansions for moments and allow for the proof of central limit theorems related to these first passage times and reward amounts.

We consider the constrained-degree percolation model in a random environment (CDPRE) on the square lattice. In this model, each vertex v has an independent random constraint $\kappa_v$ which takes the value $j\in \{0,1,2,3\}$ with probability $\rho_j$. The dynamics is as follows: at time $t=0$ all edges are closed; each edge e attempts to open at a random time $U(e)\sim \mathrm{U}(0,1]$, independently of all the other edges. It succeeds if at time U(e) both its end vertices have degrees strictly smaller than their respective constraints. We obtain exponential decay of the radius of the open cluster of the origin at all times when its expected size is finite. Since CDPRE is dominated by Bernoulli percolation, this result is meaningful only if the supremum of all values of t for which the expected size of the open cluster of the origin is finite is larger than $\frac12$. We prove this last fact by showing a sharp phase transition for an intermediate model.

This paper studies a novel Brownian functional defined as the supremum of a weighted average of the running Brownian range and its running reversal from extrema on the unit interval. We derive the Laplace transform for the squared reciprocal of this functional, which leads to explicit moment expressions that are new to the literature. We show that the proposed Brownian functional can be used to estimate the spot volatility of financial returns based on high-frequency price observations.

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.

We answer the following question: if the occupied (or vacant) set of a planar Poisson Boolean percolation model contains a crossing of an $n\times n$ square, how wide is this crossing? The answer depends on whether we consider the critical, sub-, or super-critical regime, and is different for the occupied and vacant sets.

We introduce gradient flow aggregation, a random growth model. Given existing particles $\{x_1,\ldots,x_n\} \subset \mathbb{R}^2$, a new particle arrives from a random direction at $\infty$ and flows in direction of the vector field $\nabla E$ where $ E(x) = \sum_{i=1}^{n}{1}/{\|x-x_i\|^{\alpha}}$, $0 < \alpha < \infty$. The case $\alpha = 0$ refers to the logarithmic energy ${-}\sum\log\|x-x_i\|$. Particles stop once they are at distance 1 from one of the existing particles, at which point they are added to the set and remain fixed for all time. We prove, under a non-degeneracy assumption, a Beurling-type estimate which, via Kesten’s method, can be used to deduce sub-ballistic growth for $0 \leq \alpha < 1$, $\text{diam}(\{x_1,\ldots,x_n\}) \leq c_{\alpha} \cdot n^{({3 \alpha +1})/({2\alpha + 2})}$. This is optimal when $\alpha = 0$. The case $\alpha = 0$ leads to a ‘round’ full-dimensional tree. The larger the value of $\alpha$, the sparser the tree. Some instances of the higher-dimensional setting are also discussed.

We derive large-sample and other limiting distributions of components of the allele frequency spectrum vector, $\mathbf{M}_n$, joint with the number of alleles, $K_n$, from a sample of n genes. Models analysed include those constructed from gamma and $\alpha$-stable subordinators by Kingman (thus including the Ewens model), the two-parameter extension by Pitman and Yor, and a two-parameter version constructed by omitting large jumps from an $\alpha$-stable subordinator. In each case the limiting distribution of a finite number of components of $\mathbf{M}_n$ is derived, joint with $K_n$. New results include that in the Poisson–Dirichlet case, $\mathbf{M}_n$ and $K_n$ are asymptotically independent after centering and norming for $K_n$, and it is notable, especially for statistical applications, that in other cases the limiting distribution of a finite number of components of $\mathbf{M}_n$, after centering and an unusual $n^{\alpha/2}$ norming, conditional on that of $K_n$, is normal.

We consider linear-fractional branching processes (one-type and two-type) with immigration in varying environments. For $n\ge0$, let $Z_n$ count the number of individuals of the nth generation, which excludes the immigrant who enters the system at time n. We call n a regeneration time if $Z_n=0$. For both the one-type and two-type cases, we give criteria for the finiteness or infiniteness of the number of regeneration times. We then construct some concrete examples to exhibit the strange phenomena caused by the so-called varying environments. For example, it may happen that the process is extinct, but there are only finitely many regeneration times. We also study the asymptotics of the number of regeneration times of the model in the example.

We study a signaling game between an employer and a potential employee, where the employee has private information regarding their production capacity. At the initial stage, the employee communicates a salary claim, after which the true production capacity is gradually revealed to the employer as the unknown drift of a Brownian motion representing the revenues generated by the employee. Subsequently, the employer has the possibility to choose a time to fire the employee in case the estimated production capacity falls short of the salary. In this setup, we use filtering and optimal stopping theory to derive an equilibrium in which the employee provides a randomized salary claim and the employer uses a threshold strategy in terms of the conditional probability for the high production capacity. The analysis is robust in the sense that various extensions of the basic model can be solved using the same methodology, including cases with positive firing costs, incomplete information about an individual’s own type, as well as an additional interview phase.