In this paper we consider the asymptotics of logarithmic tails of a perpetuity R=D∑j=1∞Qj∏k=1j-1Mk, where (Mn,Qn)n=1∞ are independent and identically distributed copies of (M,Q), for the case when ℙ(M∈[0,1))=1 and Q has all exponential moments. If M and Q are independent, under regular variation assumptions, we find the precise asymptotics of -logℙ(R>x) as x→∞. Moreover, we deal with the case of dependent M and Q, and give asymptotic bounds for -logℙ(R>x). It turns out that the dependence structure between M and Q has a significant impact on the asymptotic rate of logarithmic tails of R. Such a phenomenon is not observed in the case of heavy-tailed perpetuities.

Consider the process which starts with N ≥ 3 distinct points on ℝd, and fix a positive integer K < N. Of the total N points keep those N - K which minimize the energy amongst all the possible subsets of size N - K, and then replace the removed points by K independent and identically distributed points sampled according to some fixed distribution ζ. Repeat this process ad infinitum. We obtain various quite nonrestrictive conditions under which the set of points converges to a certain limit. This is a very substantial generalization of the `Keynesian beauty contest process' introduced in Grinfeld et al. (2015), where K = 1 and the distribution ζ was uniform on the unit cube.

Let (Mn,Sn)n≥0 be a Markov random walk with positive recurrent driving chain (Mn)n≥0 on the countable state space 𝒮 with stationary distribution π. Suppose also that lim supn→∞Sn=∞ almost surely, so that the walk has almost-sure finite strictly ascending ladder epochs σn>. Recurrence properties of the ladder chain (Mσn>)n≥0 and a closely related excursion chain are studied. We give a necessary and sufficient condition for the recurrence of (Mσn>)n≥0 and further show that this chain is positive recurrent with stationary distribution π> and 𝔼π>σ1><∞ if and only if an associated Markov random walk (𝑀̂n,𝑆̂n)n≥0, obtained by time reversal and called the dual of (Mn,Sn)n≥0, is positive divergent, i.e. 𝑆̂n→∞ almost surely. Simple expressions for π> are also provided. Our arguments make use of coupling, Palm duality theory, and Wiener‒Hopf factorization for Markov random walks with discrete driving chain.

We use the Stein‒Chen method to obtain compound Poisson approximations for the distribution of the number of subgraphs in a generalised stochastic block model which are isomorphic to some fixed graph. This model generalises the classical stochastic block model to allow for the possibility of multiple edges between vertices. We treat the case that the fixed graph is a simple graph and that it has multiple edges. The former results apply when the fixed graph is a member of the class of strictly balanced graphs and the latter results apply to a suitable generalisation of this class to graphs with multiple edges. We also consider a further generalisation of the model to pseudo-graphs, which may include self-loops as well as multiple edges, and establish a parameter regime in the multiple edge stochastic block model in which Poisson approximations are valid. The results are applied to obtain Poisson and compound Poisson approximations (in different regimes) for subgraph counts in the Poisson stochastic block model and degree corrected stochastic block model of Karrer and Newman (2011).

In this paper we investigate gradient estimation for a class of contracting stochastic systems on a continuous state space. We find conditions on the one-step transitions, namely differentiability and contraction in a Wasserstein distance, that guarantee differentiability of stationary costs. Then we show how to estimate the derivatives, deriving an estimator that can be seen as a generalization of the forward sensitivity analysis method used in deterministic systems. We apply the results to examples, including a neural network model.

Brown‒Resnick processes are max-stable processes that are associated to Gaussian processes. Their simulation is often based on the corresponding spectral representation which is not unique. We study to what extent simulation accuracy and efficiency can be improved by minimizing the maximal variance of the underlying Gaussian process. Such a minimization is a difficult mathematical problem that also depends on the geometry of the simulation domain. We extend Matheron's (1974) seminal contribution in two directions: (i) making his description of a minimal maximal variance explicit for convex variograms on symmetric domains, and (ii) proving that the same strategy also reduces the maximal variance for a huge class of nonconvex variograms representable through a Bernstein function. A simulation study confirms that our noncostly modification can lead to substantial improvements among Gaussian representations. We also compare it with three other established algorithms.

We consider a finite-time optimal consumption problem where an investor wants to maximize the expected hyperbolic absolute risk aversion utility of consumption and terminal wealth. We treat a stochastic factor model in which the mean returns of risky assets depend linearly on underlying economic factors formulated as the solutions of linear stochastic differential equations. We discuss the partial information case in which the investor cannot observe the factor process and uses only past information of risky assets. Then our problem is formulated as a stochastic control problem with partial information. We derive the Hamilton–Jacobi–Bellman equation. We solve this equation to obtain an explicit form of the value function and the optimal strategy for this problem. Moreover, we also introduce the results obtained by the martingale method.

In this paper we investigate risk-sensitive semi-Markov decision processes with a Borel state space, unbounded cost rates, and general utility functions. The performance criteria are several expected utilities of the total cost in a finite horizon. Our analysis is based on a type of finite-horizon occupation measure. We express the distribution of the finite-horizon cost in terms of the occupation measure for each policy, wherein the discount is not needed. For unconstrained and constrained problems, we establish the existence and computation of optimal policies. In particular, we develop a linear program and its dual program for the constrained problem and, moreover, establish the strong duality between the two programs. Finally, we provide two special cases of our results, one of which concerns the discrete-time model, and the other the chance-constrained problem.

Tail asymptotics of the solution R to a fixed-point problem of the type R=DQ+∑1NRm are derived under heavy-tailed conditions allowing both dependence between Q and N and the tails to be of the same order of magnitude. Similar results are derived for a K-class version with applications to multi-type branching processes and busy periods in multi-class queues.

In this paper we present results on the concentration properties of the smoothing and filtering distributions of some partially observed chaotic dynamical systems. We show that, rather surprisingly, for the geometric model of the Lorenz equations, as well as some other chaotic dynamical systems, the smoothing and filtering distributions do not concentrate around the true position of the signal, as the number of observations tends to ∞. Instead, under various assumptions on the observation noise, we show that the expected value of the diameter of the support of the smoothing and filtering distributions remains lower bounded by a constant multiplied by the standard deviation of the noise, independently of the number of observations. Conversely, under rather general conditions, the diameter of the support of the smoothing and filtering distributions are upper bounded by a constant multiplied by the standard deviation of the noise. To some extent, applications to the three-dimensional Lorenz 63 model and to the Lorenz 96 model of arbitrarily large dimension are considered.

We consider the stationary solution Z of the Markov chain {Zn}n∈ℕ defined by Zn+1=ψn+1(Zn), where {ψn}n∈ℕ is a sequence of independent and identically distributed random Lipschitz functions. We estimate the probability of the event {Z>x} when x is large, and develop a state-dependent importance sampling estimator under a set of assumptions on ψn such that, for large x, the event {Z>x} is governed by a single large jump. Under natural conditions, we show that our estimator is strongly efficient. Special attention is paid to a class of perpetuities with heavy tails.

In this paper we derive nonasymptotic upper bounds for the size of reachable sets in random graphs. These bounds are subject to a phase transition phenomenon triggered by the spectral radius of the hazard matrix, a reweighted version of the adjacency matrix. Such bounds are valid for a large class of random graphs, called local positive correlation (LPC) random graphs, displaying local positive correlation. In particular, in our main result we state that the size of reachable sets in the subcritical regime for LPC random graphs is at most of order O(√n), where n is the size of the network, and of order O(n2/3) in the critical regime, where the epidemic thresholds are driven by the size of the spectral radius of the hazard matrix with respect to 1. As a corollary, we also show that such bounds hold for the size of the giant component in inhomogeneous percolation, the SIR model in epidemiology, as well as for the long-term influence of a node in the independent cascade model.

A prevalent problem in general state-space models is the approximation of the smoothing distribution of a state conditional on the observations from the past, the present, and the future. The aim of this paper is to provide a rigorous analysis of such approximations of smoothed distributions provided by the two-filter algorithms. We extend the results available for the approximation of smoothing distributions to these two-filter approaches which combine a forward filter approximating the filtering distributions with a backward information filter approximating a quantity proportional to the posterior distribution of the state, given future observations.

In this paper we consider a new type of urn scheme, where the selection probabilities are proportional to a weight function, which is linear but decreasing in the proportion of existing colours. We refer to it as the de-preferential urn scheme. We establish the almost-sure limit of the random configuration for any balanced replacement matrix R. In particular, we show that the limiting configuration is uniform on the set of colours if and only if R is a doubly stochastic matrix. We further establish the almost-sure limit of the vector of colour counts and prove central limit theorems for the random configuration as well as for the colour counts.

Let {Xi}i≥1 be independent, identically distributed random vectors in ℤd,d≥1. Let LLn(x)≡ℙ(Sn=x),n≥1,x∈ℤd, be the likelihood function for Sn=∑i=1nXi. For integers j≥2 and n≥1, let an(j)≡∑x∈ℤd(Ln(x))j. We show that if X1-X2 has a nondegenerate aperiodic distribution in ℤd and 𝔼(∥X1∥2)>∞, then limn→∞n(j-1)d∕2an(j)≡a(j,d) exists and 0<a(j,d)<∞. Some extensions and open problems are also outlined.

In this paper we develop renewal theorems for point processes with interarrival times ξ(Xn+1Xn…), where (Xn)n∈ℤ is a stochastic process with finite state space Σ and ξ:ΣA→ℝ is a Hölder continuous function on a subset ΣA⊂Σℕ. The theorems developed here unify and generalise the key renewal theorem for discrete measures and Lalley's renewal theorem for counting measures in symbolic dynamics. Moreover, they capture aspects of Markov renewal theory. The new renewal theorems allow for direct applications to problems in fractal and hyperbolic geometry, for instance to the problem of Minkowski measurability of self-conformal sets.

In this paper we study the quasi-stationary behavior of absorbed one-dimensional diffusions. We obtain necessary and sufficient conditions for the exponential convergence to a unique quasi-stationary distribution in total variation, uniformly with respect to the initial distribution. An important tool is provided by one-dimensional strict local martingale diffusions coming down from infinity. We prove, under mild assumptions, that their expectation at any positive time is uniformly bounded with respect to the initial position. We provide several examples and extensions, including the sticky Brownian motion and some one-dimensional processes with jumps.

Suppose that a mobile sensor describes a Markovian trajectory in the ambient space and at each time the sensor measures an attribute of interest, e.g. the temperature. Using only the location history of the sensor and the associated measurements, we estimate the average value of the attribute over the space. In contrast to classical probabilistic integration methods, e.g. Monte Carlo, the proposed approach does not require any knowledge of the distribution of the sensor trajectory. We establish probabilistic bounds on the convergence rates of the estimator. These rates are better than the traditional `root n'-rate, where n is the sample size, attached to other probabilistic integration methods. For finite sample sizes, we demonstrate the favorable behavior of the procedure through simulations and consider an application to the evaluation of the average temperature of oceans.

The effect of small noise in a smooth dynamical system is negligible on any finite time interval; in this paper we study situations where the effect persists on intervals increasing to ∞. Such an asymptotic regime occurs when the system starts from an initial condition that is sufficiently close to an unstable fixed point. In this case, under appropriate scaling, the trajectory converges to a solution of the unperturbed system started from a certain random initial condition. In this paper we consider the case of one-dimensional diffusions on the positive half-line; this case often arises as a scaling limit in population dynamics.

The basis of this paper is the elementary observation that the n-step descendant distribution of any Galton–Watson process satisfies a discrete Smoluchowski coagulation equation with multiple coalescence. Using this we obtain simple necessary and sufficient criteria for the convergence of scaling limits of critical Galton–Watson processes in terms of scaled family-size distributions and a natural notion of convergence of Lévy triples. Our results provide a clear and natural interpretation, and an alternate proof, of the fact that the Lévy jump measure of certain continuous-state branching processes (CSBPs) satisfies a generalized Smoluchowski equation. (This result was previously proved by Bertoin and Le Gall (2006).) Our analysis shows that the nonlinear scaling dynamics of CSBPs become linear and purely dilatational when expressed in terms of the Lévy triple associated with the branching mechanism. We prove a continuity theorem for CSBPs in terms of the associated Lévy triples, and use our scaling analysis to prove the existence of universal critical Galton–Watson processes and CSBPs analogous to Doeblin's `universal laws'. Namely, these universal processes generate all possible critical and subcritical CSBPs as subsequential scaling limits. Our convergence results rely on a natural topology for Lévy triples and a continuity theorem for Bernstein transforms (Laplace exponents) which we develop in a self-contained appendix.