We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
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.
This paper presents a new matrix-infinite-product-form (MIP-form) solution for the stationary distribution in upper block-Hessenberg Markov chains (UBH-MCs). The existing MIP-form solution (Masuyama, Queueing Systems92, 2019, pp. 173–200) requires a certain parameter set that satisfies both a Foster–Lyapunov drift condition and a convergence condition. In contrast, the new MIP-form solution requires no such parameter sets and no other conditions. The new MIP-form solution also has ‘quasi-algorithmic constructibility’, which is a newly introduced feature of being constructed by iterating infinitely many times a recursive procedure of finite complexity per iteration. This feature is not found in the other existing solutions for the stationary distribution in general UBH-MCs.
We prove polynomial ergodicity for the one-dimensional Zig-Zag process on heavy-tailed targets and identify the exact order of polynomial convergence of the process when targeting Student distributions.
We study an example of a hit-and-run random walk on the symmetric group
$\mathbf S_n$
. Our starting point is the well-understood top-to-random shuffle. In the hit-and-run version, at each single step, after picking the point of insertion j uniformly at random in
$\{1,\ldots,n\}$
, the top card is inserted in the jth position k times in a row, where k is uniform in
$\{0,1,\ldots,j-1\}$
. The question is, does this accelerate mixing significantly or not? We show that, in
$L^2$
and sup-norm, this accelerates mixing at most by a constant factor (independent of n). Analyzing this problem in total variation is an interesting open question. We show that, in general, hit-and-run random walks on finite groups have non-negative spectrum.
Simulated tempering is a popular method of allowing Markov chain Monte Carlo algorithms to move between modes of a multimodal target density
$\pi$
. Tawn, Moores and Roberts (2021) introduces the Annealed Leap-Point Sampler (ALPS) to allow for rapid movement between modes. In this paper we prove that, under appropriate assumptions, a suitably scaled version of the ALPS algorithm converges weakly to skew Brownian motion. Our results show that, under appropriate assumptions, the ALPS algorithm mixes in time
$O(d [\log d]^2)$
or O(d), depending on which version is used.
A system of mutually interacting superprocesses with migration is constructed as the limit of a sequence of branching particle systems arising from population models. The uniqueness in law of the superprocesses is established using the pathwise uniqueness of a system of stochastic partial differential equations, which is satisfied by the corresponding system of distribution function-valued processes.
We study supercritical branching processes under the influence of an independent and identically distributed (i.i.d.) emigration component. We provide conditions under which the lifetime of the process is finite or has a finite expectation. A theorem of Kesten–Stigum type is obtained, and the extinction probability for a large initial population size is related to the tail behaviour of the emigration.
A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is not allowed to revisit a node in one step. Second-order random walks can model physical diffusion phenomena in a more realistic way than traditional random walks and have been very successfully used in various network mining and machine learning settings. However, numerous questions are still open for this type of stochastic processes. In this work, we extend well-known results concerning mean hitting and return times of standard random walks to the second-order case. In particular, we provide simple formulas that allow us to compute these numbers by solving suitable systems of linear equations. Moreover, by introducing the ‘pullback’ first-order stochastic process of a second-order random walk, we provide second-order versions of the renowned Kac’s and Random Target Lemmas.
We study the so-called frog model on
${\mathbb{Z}}$
with two types of lazy frogs, with parameters
$p_1,p_2\in (0,1]$
respectively, and a finite expected number of dormant frogs per site. We show that for any such
$p_1$
and
$p_2$
there is positive probability that the two types coexist (i.e. that both types activate infinitely many frogs). This answers a question of Deijfen, Hirscher, and Lopes in dimension one.
We derive closed-form solutions to some discounted optimal stopping problems related to the perpetual American cancellable dividend-paying put and call option pricing problems in an extension of the Black–Merton–Scholes model. The cancellation times are assumed to occur when the underlying risky asset price process hits some unobservable random thresholds. The optimal stopping times are shown to be the first times at which the asset price reaches stochastic boundaries depending on the current values of its running maximum and minimum processes. The proof is based on the reduction of the original optimal stopping problems to the associated free-boundary problems and the solution of the latter problems by means of the smooth-fit and modified normal-reflection conditions. We show that the optimal stopping boundaries are characterised as the maximal and minimal solutions of certain first-order nonlinear ordinary differential equations.
In this article we consider a Monte-Carlo-based method to filter partially observed diffusions observed at regular and discrete times. Given access only to Euler discretizations of the diffusion process, we present a new procedure which can return online estimates of the filtering distribution with no time-discretization bias and finite variance. Our approach is based upon a novel double application of the randomization methods of Rhee and Glynn (Operat. Res.63, 2015) along with the multilevel particle filter (MLPF) approach of Jasra et al. (SIAM J. Numer. Anal.55, 2017). A numerical comparison of our new approach with the MLPF, on a single processor, shows that similar errors are possible for a mild increase in computational cost. However, the new method scales strongly to arbitrarily many processors.
We consider the spectral analysis of several examples of bilateral birth–death processes and compute explicitly the spectral matrix and the corresponding orthogonal polynomials. We also use the spectral representation to study some probabilistic properties of the processes, such as recurrence, the invariant distribution (if it exists), and the probability current.
We establish sufficient conditions for differentiability of the expected cost collected over a discrete-time Markov chain until it enters a given set. The parameter with respect to which differentiability is analysed may simultaneously affect the Markov chain and the set defining the stopping criterion. The general statements on differentiability lead to unbiased gradient estimators.
Bifurcating Markov chains (BMCs) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We provide a central limit theorem for additive functionals of BMCs under
$L^2$
-ergodic conditions with three different regimes. This completes the pointwise approach developed in a previous work. As an application, we study the elementary case of a symmetric bifurcating autoregressive process, which justifies the nontrivial hypothesis considered on the kernel transition of the BMCs. We illustrate in this example the phase transition observed in the fluctuations.
We apply general moment identities for Poisson stochastic integrals with random integrands to the computation of the moments of Markovian growth–collapse processes. This extends existing formulas for mean and variance available in the literature to closed-form moment expressions of all orders. In comparison with other methods based on differential equations, our approach yields explicit summations in terms of the time parameter. We also treat the case of the associated embedded chain, and provide recursive codes in Maple and Mathematica for the computation of moments and cumulants of any order with arbitrary cut-off moment sequences and jump size functions.
We prove that many, but not all, injective factors arise as crossed products by nonsingular Bernoulli actions of the group $\mathbb {Z}$. We obtain this result by proving a completely general result on the ergodicity, type and Krieger’s associated flow for Bernoulli shifts with arbitrary base spaces. We prove that the associated flow must satisfy a structural property of infinite divisibility. Conversely, we prove that all almost periodic flows, as well as many other ergodic flows, do arise as associated flow of a weakly mixing Bernoulli action of any infinite amenable group. As a byproduct, we prove that all injective factors with almost periodic flow of weights are infinite tensor products of $2 \times 2$ matrices. Finally, we construct Poisson suspension actions with prescribed associated flow for any locally compact second countable group that does not have property (T).
We consider two-dimensional Lévy processes reflected to stay in the positive quadrant. Our focus is on the non-standard regime when the mean of the free process is negative but the reflection vectors point away from the origin, so that the reflected process escapes to infinity along one of the axes. Under rather general conditions, it is shown that such behaviour is certain and each component can dominate the other with positive probability for any given starting position. Additionally, we establish the corresponding invariance principle providing justification for the use of the reflected Brownian motion as an approximate model. Focusing on the probability that the first component dominates, we derive a kernel equation for the respective Laplace transform in the starting position. This is done for the compound Poisson model with negative exponential jumps and, by means of approximation, for the Brownian model. Both equations are solved via boundary value problem analysis, which also yields the domination probability when starting at the origin. Finally, certain asymptotic analysis and numerical results are presented.
We study several parameters of a random Bienaymé–Galton–Watson tree
$T_n$
of size
$n$
defined in terms of an offspring distribution
$\xi$
with mean
$1$
and nonzero finite variance
$\sigma ^2$
. Let
$f(s)=\mathbb{E}\{s^\xi \}$
be the generating function of the random variable
$\xi$
. We show that the independence number is in probability asymptotic to
$qn$
, where
$q$
is the unique solution to
$q = f(1-q)$
. One of the many algorithms for finding the largest independent set of nodes uses a notion of repeated peeling away of all leaves and their parents. The number of rounds of peeling is shown to be in probability asymptotic to
$\log n/\log (1/f'(1-q))$
. Finally, we study a related parameter which we call the leaf-height. Also sometimes called the protection number, this is the maximal shortest path length between any node and a leaf in its subtree. If
$p_1 = \mathbb{P}\{\xi =1\}\gt 0$
, then we show that the maximum leaf-height over all nodes in
$T_n$
is in probability asymptotic to
$\log n/\log (1/p_1)$
. If
$p_1 = 0$
and
$\kappa$
is the first integer
$i\gt 1$
with
$\mathbb{P}\{\xi =i\}\gt 0$
, then the leaf-height is in probability asymptotic to
$\log _\kappa \log n$
.
We derive the asymptotic behavior of the total, active, and inactive branch lengths of the seed bank coalescent when the initial sample size grows to infinity. These random variables have important applications for populations evolving under some seed bank effects, such as plants and bacteria, and for some cases of structured populations like metapopulations. The proof relies on the analysis of the tree at a stopping time corresponding to the first time a deactivated lineage is reactivated. We also give conditional sampling formulas for the random partition, and we study the system at the time of the first reactivation of a lineage. All these results provide a good picture of the different regimes and behaviors of the block-counting process of the seed bank coalescent.
The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding problem are obtained in the process. To achieve our results, we need to employ various algebraic and geometric tools, including commutativity, permutation invariance, and convexity. Of particular relevance in several demarcation results are Markov matrices that are idempotents.
A continuous-state branching process with immigration having branching mechanism
$\Psi$
and immigration mechanism
$\Phi$
, a CBI
$(\Psi,\Phi)$
process for short, may have either of two different asymptotic regimes, depending on whether
$\int_{0}\frac{\Phi(u)}{|\Psi(u)|}\textrm{d} u<\infty$
or
$\int_{0}\frac{\Phi(u)}{|\Psi(u)|}\textrm{d} u=\infty$
. When
$\int_{0}\frac{\Phi(u)}{|\Psi(u)|}\textrm{d} u<\infty$
, the CBI process has either a limit distribution or a growth rate dictated by the branching dynamics. When
$\scriptstyle\int_{0}\tfrac{\Phi(u)}{|\Psi(u)|}\textrm{d} u=\infty$
, immigration overwhelms branching dynamics. Asymptotics in the latter case are studied via a nonlinear time-dependent renormalization in law. Three regimes of weak convergence are exhibited. Processes with critical branching mechanisms subject to a regular variation assumption are studied. This article proves and extends results stated by M. Pinsky in ‘Limit theorems for continuous state branching processes with immigration’ (Bull. Amer. Math. Soc.78, 1972).