This paper focuses mainly on the Euler scheme of stochastic delay differential equations with locally Lipschitz coefficients. The convergence in probability of the Euler scheme and the corresponding weak limit process of the normalized error process are derived. Furthermore, this paper also considers a class of specific degenerate stochastic delay equations and obtains the associated weak limit process for the stronger error process. The error parameter of this stronger error process for such a degenerate system is n instead of $\sqrt{n}$ in the normalized error process. This causes substantial challenges in the analysis and proofs and the weak limit process also becomes more complicated and involves some additional terms. This result is new and interesting even for the non-delay case.

We study the asymptotic properties, in the weak sense, of regenerative processes and Markov renewal processes. For the latter, we derive both renewal-type results, also concerning the related counting process, and ergodic-type results, including the so-called $\varphi$-mixing property. This theoretical framework permits us to study the weak limit of the integral of a semi-Markov process, which can be interpreted as the position of a particle moving with finite velocities, taken for a random time according to the Markov renewal process underlying the semi-Markov one. Under mild conditions, we obtain the weak convergence to scaled Brownian motion. As a particular case, this result establishes the weak convergence of the classical generalized telegraph process.

In many insurance contexts, dependence between risks of a portfolio may arise from their frequencies. We investigate a dependent risk model in which we assume the vector of count variables to be a tree-structured Markov random field with Poisson marginals. The tree structure translates into a wide variety of dependence schemes. We study the global risk of the portfolio and the risk allocation to all its constituents. We provide asymptotic results for portfolios defined on infinitely growing trees. To illustrate its flexibility and computational scalability to higher dimensions, we calibrate the risk model on real-world extreme rainfall data and perform a risk analysis.

We investigate some investment problems related to maximizing the expected utility of the terminal wealth in a continuous-time Itô–Markov additive market. In this market, the prices of financial assets are described by Markov additive processes that combine Lévy processes with regime-switching models. We give explicit expressions for the solutions to the portfolio selection problem for the hyperbolic absolute risk aversion (HARA) utility, the exponential utility, and the extended logarithmic utility. In addition, we demonstrate that the solutions for the HARA utility are stable in terms of weak convergence when the parameters vary in a suitable way.

We show that $\alpha $-stable Lévy motions can be simulated by any ergodic and aperiodic probability-preserving transformation. Namely we show that: for $0<\alpha <1$ and every $\alpha $-stable Lévy motion ${\mathbb {W}}$, there exists a function f whose partial sum process converges in distribution to ${\mathbb {W}}$; for $1\leq \alpha <2$ and every symmetric $\alpha $-stable Lévy motion, there exists a function f whose partial sum process converges in distribution to ${\mathbb {W}}$; for $1< \alpha <2$ and every $-1\leq \beta \leq 1$ there exists a function f whose associated time series is in the classical domain of attraction of an $S_\alpha (\ln (2), \beta ,0)$ random variable.

We prove a large deviation principle for the slow-fast rough differential equations (RDEs) under the controlled rough path (RP) framework. The driver RPs are lifted from the mixed fractional Brownian motion (FBM) with Hurst parameter $H\in (1/3,1/2)$. Our approach is based on the continuity of the solution mapping and the variational framework for mixed FBM. By utilizing the variational representation, our problem is transformed into a qualitative property of the controlled system. In particular, the fast RDE coincides with Itô stochastic differential equation (SDE) almost surely, which possesses a unique invariant probability measure with frozen slow component. We then demonstrate the weak convergence of the controlled slow component by averaging with respect to the invariant measure of the fast equation and exploiting the continuity of the solution mapping.

This paper analyzes single-item continuous-review inventory models with random supplies in which the inventory dynamic between orders is described by a diffusion process, and a long-term average cost criterion is used to evaluate decisions. The models in this class have general drift and diffusion coefficients and boundary points that are consistent with the notion that demand should tend to reduce the inventory level. Random yield is described by a (probability) transition function which depends on the inventory on hand and the nominal amount ordered; it is assumed to be a distribution with support in the interval determined by the order-from and the nominal order-to locations of the stock level. Using weak convergence arguments involving average expected occupation and ordering measures, conditions are given for the optimality of an (s, S) ordering policy in the general class of policies with finite expected cost. The characterization of the cost of an (s, S) policy as a function of two variables naturally leads to a nonlinear optimization problem over the stock levels s and S, and the existence of an optimizing pair $(s^*,S^*)$ is established under weak conditions. Thus, optimal policies of inventory models with random supplies can (easily) be numerically computed. The range of applicability of the optimality result is illustrated on several inventory models with random yields.

Persistent Betti numbers are a major tool in persistent homology, a subfield of topological data analysis. Many tools in persistent homology rely on the properties of persistent Betti numbers considered as a two-dimensional stochastic process $ (r,s) \mapsto n^{-1/2} (\beta^{r,s}_q ( \mathcal{K}(n^{1/d} \mathcal{X}_n))-\mathbb{E}[\beta^{r,s}_q ( \mathcal{K}( n^{1/d} \mathcal{X}_n))])$. So far, pointwise limit theorems have been established in various settings. In particular, the pointwise asymptotic normality of (persistent) Betti numbers has been established for stationary Poisson processes and binomial processes with constant intensity function in the so-called critical (or thermodynamic) regime; see Yogeshwaran et al. (Prob. Theory Relat. Fields 167, 2017) and Hiraoka et al. (Ann. Appl. Prob. 28, 2018).

In this contribution, we derive a strong stabilization property (in the spirit of Penrose and Yukich, Ann. Appl. Prob. 11, 2001) of persistent Betti numbers, and we generalize the existing results on their asymptotic normality to the multivariate case and to a broader class of underlying Poisson and binomial processes. Most importantly, we show that multivariate asymptotic normality holds for all pairs (r, s), $0\le r\le s<\infty$, and that it is not affected by percolation effects in the underlying random geometric graph.

We prove that the set of elementary tensors is weakly closed in the projective tensor product of two Banach spaces. As a result, we answer a question of Rodríguez and Rueda Zoca [‘Weak precompactness in projective tensor products’, Indag. Math. (N.S.) 35(1) (2024), 60–75], proving that if $(x_n) \subset X$ and $(y_n) \subset Y$ are two weakly null sequences such that $(x_n \otimes y_n)$ converges weakly in $X \widehat {\otimes }_\pi Y$, then $(x_n \otimes y_n)$ is also weakly null.

This paper is concerned with stochastic Schrödinger delay lattice systems with both locally Lipschitz drift and diffusion terms. Based on the uniform estimates and the equicontinuity of the segment of the solution in probability, we show the tightness of a family of probability distributions of the solution and its segment process, and hence the existence of invariant measures on $l^2\times L^2((-\rho,\,0);l^2)$ with $\rho >0$. We also establish a large deviation principle for the solutions with small noise by the weak convergence method.

We consider infinitely wide multi-layer perceptrons (MLPs) which are limits of standard deep feed-forward neural networks. We assume that, for each layer, the weights of an MLP are initialized with independent and identically distributed (i.i.d.) samples from either a light-tailed (finite-variance) or a heavy-tailed distribution in the domain of attraction of a symmetric $\alpha$-stable distribution, where $\alpha\in(0,2]$ may depend on the layer. For the bias terms of the layer, we assume i.i.d. initializations with a symmetric $\alpha$-stable distribution having the same $\alpha$ parameter as that layer. Non-stable heavy-tailed weight distributions are important since they have been empirically seen to emerge in trained deep neural nets such as the ResNet and VGG series, and proven to naturally arise via stochastic gradient descent. The introduction of heavy-tailed weights broadens the class of priors in Bayesian neural networks. In this work we extend a recent result of Favaro, Fortini, and Peluchetti (2020) to show that the vector of pre-activation values at all nodes of a given hidden layer converges in the limit, under a suitable scaling, to a vector of i.i.d. random variables with symmetric $\alpha$-stable distributions, $\alpha\in(0,2]$.

We study homogenization for a class of non-symmetric pure jump Feller processes. The jump intensity involves periodic and aperiodic constituents, as well as oscillating and non-oscillating constituents. This means that the noise can come both from the underlying periodic medium and from external environments, and is allowed to have different scales. It turns out that the Feller process converges in distribution, as the scaling parameter goes to zero, to a Lévy process. As special cases of our result, some homogenization problems studied in previous works can be recovered. We also generalize the approach to the homogenization of symmetric stable-like processes with variable order. Moreover, we present some numerical experiments to demonstrate the usage of our homogenization results in the numerical approximation of first exit times.

The life distribution of a device subject to shocks governed by a homogeneous Poisson process is shown to have a bathtub failure rate average (BFRA) when the probabilities $\bar{P}_k$ of surviving k shocks possess the corresponding discrete property. We prove closure under the formation of weak limits for BFRA distributions and explore related moment convergence issues within the BFRA family. Similar results for increasing and decreasing failure rate average distributions are obtained either independently or as consequences of our results. We also establish some results outlining the positions of various non-monotonic ageing classes such as bathtub failure rate, increasing initially then decreasing mean residual life, new worse then better than used in expectation, and increasing initially then decreasing mean time to failure in the hierarchy. Finally, an open problem is posed and a partial solution provided.

The problem of optimally scaling the proposal distribution in a Markov chain Monte Carlo algorithm is critical to the quality of the generated samples. Much work has gone into obtaining such results for various Metropolis–Hastings (MH) algorithms. Recently, acceptance probabilities other than MH are being employed in problems with intractable target distributions. There are few resources available on tuning the Gaussian proposal distributions for this situation. We obtain optimal scaling results for a general class of acceptance functions, which includes Barker’s and lazy MH. In particular, optimal values for Barker’s algorithm are derived and found to be significantly different from that obtained for the MH algorithm. Our theoretical conclusions are supported by numerical simulations indicating that when the optimal proposal variance is unknown, tuning to the optimal acceptance probability remains an effective strategy.

We revisit the so-called cat-and-mouse Markov chain, studied earlier by Litvak and Robert (2012). This is a two-dimensional Markov chain on the lattice $\mathbb{Z}^2$, where the first component (the cat) is a simple random walk and the second component (the mouse) changes when the components meet. We obtain new results for two generalisations of the model. First, in the two-dimensional case we consider far more general jump distributions for the components and obtain a scaling limit for the second component. When we let the first component be a simple random walk again, we further generalise the jump distribution of the second component. Secondly, we consider chains of three and more dimensions, where we investigate structural properties of the model and find a limiting law for the last component.

The performance and effectiveness of an age replacement policy can be assessed by its mean time to failure (MTTF) function. We develop shock model theory in different scenarios for classes of life distributions based on the MTTF function where the probabilities $\bar{P}_k$ of surviving the first k shocks are assumed to have discrete DMTTF, IMTTF and IDMTTF properties. The cumulative damage model of A-Hameed and Proschan [1] is studied in this context and analogous results are established. Weak convergence and moment convergence issues within the IDMTTF class of life distributions are explored. The preservation of the IDMTTF property under some basic reliability operations is also investigated. Finally we show that the intersection of IDMRL and IDMTTF classes contains the BFR family and establish results outlining the positions of various non-monotonic ageing classes in the hierarchy.

A new approach to prove weak convergence of random polytopes on the space of compact convex sets is presented. This is used to show that the profile of the rescaled Schläfli random cone of a random conical tessellation, generated by n independent and uniformly distributed random linear hyperplanes in $\mathbb {R}^{d+1}$, weakly converges to the typical cell of a stationary and isotropic Poisson hyperplane tessellation in $\mathbb {R}^d$, as $n\to \infty $.