Journal of Applied Probability
Latest Publications


TOTAL DOCUMENTS

11088
(FIVE YEARS 223)

H-INDEX

89
(FIVE YEARS 4)

Published By Cambridge University Press

1475-6072, 0021-9002

2022 ◽  
pp. 1-22
Author(s):  
François Baccelli ◽  
Michel Davydov ◽  
Thibaud Taillefumier

Abstract Network dynamics with point-process-based interactions are of paramount modeling interest. Unfortunately, most relevant dynamics involve complex graphs of interactions for which an exact computational treatment is impossible. To circumvent this difficulty, the replica-mean-field approach focuses on randomly interacting replicas of the networks of interest. In the limit of an infinite number of replicas, these networks become analytically tractable under the so-called ‘Poisson hypothesis’. However, in most applications this hypothesis is only conjectured. In this paper we establish the Poisson hypothesis for a general class of discrete-time, point-process-based dynamics that we propose to call fragmentation-interaction-aggregation processes, and which are introduced here. These processes feature a network of nodes, each endowed with a state governing their random activation. Each activation triggers the fragmentation of the activated node state and the transmission of interaction signals to downstream nodes. In turn, the signals received by nodes are aggregated to their state. Our main contribution is a proof of the Poisson hypothesis for the replica-mean-field version of any network in this class. The proof is obtained by establishing the propagation of asymptotic independence for state variables in the limit of an infinite number of replicas. Discrete-time Galves–Löcherbach neural networks are used as a basic instance and illustration of our analysis.


2021 ◽  
Vol 58 (4) ◽  
pp. 868-879
Author(s):  
Boris Buchmann ◽  
Kevin W. Lu

AbstractConsider the strong subordination of a multivariate Lévy process with a multivariate subordinator. If the subordinate is a stack of independent Lévy processes and the components of the subordinator are indistinguishable within each stack, then strong subordination produces a Lévy process; otherwise it may not. Weak subordination was introduced to extend strong subordination, always producing a Lévy process even when strong subordination does not. Here we prove that strong and weak subordination are equal in law under the aforementioned condition. In addition, we prove that if strong subordination is a Lévy process then it is necessarily equal in law to weak subordination in two cases: firstly when the subordinator is deterministic, and secondly when it is pure-jump with finite activity.


2021 ◽  
Vol 58 (4) ◽  
pp. 1131-1151
Author(s):  
Florin Avram ◽  
Bin Li ◽  
Shu Li

AbstractDrawdown/regret times feature prominently in optimal stopping problems, in statistics (CUSUM procedure), and in mathematical finance (Russian options). Recently it was discovered that a first passage theory with more general drawdown times, which generalize classic ruin times, may be explicitly developed for spectrally negative Lévy processes [9, 20]. In this paper we further examine the general drawdown-related quantities in the (upward skip-free) time-homogeneous Markov process, and then in its (general) tax process by noticing the pathwise connection between general drawdown and the tax process.


2021 ◽  
Vol 58 (4) ◽  
pp. 1152-1169
Author(s):  
Rongfang Yan ◽  
Jiandong Zhang ◽  
Yiying Zhang

AbstractIn this paper we study the allocation problem of relevations in coherent systems. The optimal allocation strategies are obtained by implementing stochastic comparisons of different policies according to the usual stochastic order and the hazard rate order. As special cases of relevations, the load-sharing and minimal repair policies are further investigated. Sufficient (and necessary) conditions are established for various stochastic orderings. Numerical examples are also presented as illustrations.


2021 ◽  
Vol 58 (4) ◽  
pp. 1007-1042
Author(s):  
Landy Rabehasaina ◽  
Jae-Kyung Woo

AbstractIn a multitype branching process, it is assumed that immigrants arrive according to a non-homogeneous Poisson or a contagious Poisson process (both processes are formulated as a non-homogeneous birth process with an appropriate choice of transition intensities). We show that the normalized numbers of objects of the various types alive at time t for supercritical, critical, and subcritical cases jointly converge in distribution under those two different arrival processes. Furthermore, we provide some transient expectation results when there are only two types of particles.


2021 ◽  
Vol 58 (4) ◽  
pp. 1064-1085
Author(s):  
Yiying Zhang

AbstractThis paper investigates the ordering properties of largest claim amounts in heterogeneous insurance portfolios in the sense of some transform orders, including the convex transform order and the star order. It is shown that the largest claim amount from a set of independent and heterogeneous exponential claims is more skewed than that from a set of independent and homogeneous exponential claims in the sense of the convex transform order. As a result, a lower bound for the coefficient of variation of the largest claim amount is established without any restrictions on the parameters of the distributions of claim severities. Furthermore, sufficient conditions are presented to compare the skewness of the largest claim amounts from two sets of independent multiple-outlier scaled claims according to the star order. Some comparison results are also developed for the multiple-outlier proportional hazard rates claims. Numerical examples are presented to illustrate these theoretical results.


2021 ◽  
Vol 58 (4) ◽  
pp. 851-867
Author(s):  
Xiao Fang ◽  
Han L. Gan ◽  
Susan Holmes ◽  
Haiyan Huang ◽  
Erol Peköz ◽  
...  

AbstractA classical result for the simple symmetric random walk with 2n steps is that the number of steps above the origin, the time of the last visit to the origin, and the time of the maximum height all have exactly the same distribution and converge when scaled to the arcsine law. Motivated by applications in genomics, we study the distributions of these statistics for the non-Markovian random walk generated from the ascents and descents of a uniform random permutation and a Mallows(q) permutation and show that they have the same asymptotic distributions as for the simple random walk. We also give an unexpected conjecture, along with numerical evidence and a partial proof in special cases, for the result that the number of steps above the origin by step 2n for the uniform permutation generated walk has exactly the same discrete arcsine distribution as for the simple random walk, even though the other statistics for these walks have very different laws. We also give explicit error bounds to the limit theorems using Stein’s method for the arcsine distribution, as well as functional central limit theorems and a strong embedding of the Mallows(q) permutation which is of independent interest.


2021 ◽  
Vol 58 (4) ◽  
pp. 1086-1113
Author(s):  
Larbi Alili ◽  
David Woodford

AbstractConsider a Lamperti–Kiu Markov additive process $(J, \xi)$ on $\{+, -\}\times\mathbb R\cup \{-\infty\}$, where J is the modulating Markov chain component. First we study the finiteness of the exponential functional and then consider its moments and tail asymptotics under Cramér’s condition. In the strong subexponential case we determine the subexponential tails of the exponential functional under some further assumptions.


2021 ◽  
Vol 58 (4) ◽  
pp. 966-977
Author(s):  
Judith Schilling ◽  
Norbert Henze

AbstractIn the collector’s problem with group drawings, s out of n different types of coupon are sampled with replacement. In the uniform case, each s-subset of the types has the same probability of being sampled. For this case, we derive a Poisson limit theorem for the number of types that are sampled at most $c-1$ times, where $c \ge 1$ is fixed. In a specified approximate nonuniform setting, we prove a Poisson limit theorem for the special case $c=1$ . As corollaries, we obtain limit distributions for the waiting time for c complete series of types in the uniform case and a single complete series in the approximate nonuniform case.


Sign in / Sign up

Export Citation Format

Share Document