Time Sensitive Analysis of Independent and Stationary Increment Processes
Jewgeni H. Dshalalow, Ryan T. White

TL;DR
This paper develops a new method to estimate the real-time behavior of jump processes with stationary increments from delayed observations, enabling better modeling of network crashes under cyber attacks.
Contribution
It introduces a novel technique to reconstruct the paths of jump processes from delayed, discrete observations using joint Laplace-Stieltjes transforms and probability generating functions.
Findings
Derived explicit joint distributions for process states and observation times.
Applied the method to model and predict network crashes during cyber attacks.
Enhanced understanding of process behavior from incomplete, delayed data.
Abstract
We study the behavior of independent and stationary increments jump processes as they approach fixed thresholds. The exact crossing time is unavailable because the real-time information about successive jumps is unknown. Instead, the underlying process is observed only upon a third-party independent point process . The observed time series presents crude, delayed data. The crossing is first observed upon one of the observations, denoted . We develop and further explore a new technique to revive the real-time paths of for all belonging to an interval before the pre-crossing observation, , or between the observations just before and just after the crossing, , as a joint Laplace-Stieltjes transform and probability generating function of , , , and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Time Sensitive Analysis of Independent and Stationary Increment Processes
Jewgeni H. Dshalalow
Ryan T. White
Abstract
We study the behavior of independent and stationary increments jump processes as they approach fixed thresholds. The exact crossing time is unavailable because the real-time information about successive jumps is unknown. Instead, the underlying process is observed only upon a third-party independent point process . The observed time series presents crude, delayed data. The crossing is first observed upon one of the observations, denoted . We develop and further explore a new technique to revive the real-time paths of for all belonging to an interval before the pre-crossing observation, , or between the observations just before and just after the crossing, , as a joint Laplace-Stieltjes transform and probability generating function of , , , and . Joint probability distributions are obtained from the transforms in a tractable form and they are applied to modeling of stochastic networks under cyber attacks by accurately predicting their crash.
Keywords: Independent and stationary increments processes, stochastic networks, fluctuation theory, marked point processes, ruin time, exit time, first passage time, random walks, communication networks
AMS Subject Classification: 60G50, 60G51, 60G52, 60G55, 60G57, 60K05, 60K35, 60K40, 60G25, 90B18, 90B15, 90B25
Department of Mathematical Sciences
College of Science
Florida Institute of Technology
Melbourne, Florida 32901, USA
1 Introduction
Among various problems related to fluctuations of independent and stationary increments (ISI) processes, there are many where an underlying process attempts to escape from a fixed set, and cannot be observed precisely at the moment of crossing, but with some delay. The first time upon which an observer can ascertain the crossing will be referred to as a first observed crossing (or passage) time. Such a delay is inevitable due to the limited observational capabilities allowed by a third-party point process, thus obscuring information about the first passage time and the location of the process upon the first passage time.
In recent research by the authors [7, 8], efforts were made to derive probabilistic information about the location of such processes and times upon the observation immediately before and after the crossing, as well as locations of the process and times at various other observation epochs. The authors derived joint Laplace-Stieltjes transforms (LST) and probability generating functions (PGF) of these positions and times, which led to marginal distributions and moments for each of these random variables (r.v.’s).
In the present paper we use an entirely different and seemingly more efficient approach to refine predicted data that offers potential for stochastic control. To be more specific, suppose we collect the location of a process at times and let be a random index when the crossing is first observed: that is, is the first observed passage time. One of the intervals of interest is a random vicinity of time before and after the first passage time, in which we can glean some information on and obtain the joint distribution of the process at any given time and at (along with other notable characteristics), which proved elusive under the previous strategy.
This paper further focuses on a Poisson point process with associated position-independent marking taking the role of , which is observed upon a delayed renewal process forming a sequence , which is an embedded marked ISI process. With (where is a fixed positive integer), is the first observed crossing time and is the position of upon this time.
We study the following two joint LST’s and PGF’s of the position of the process at times , , and as well as the latter two times themselves. The two functionals are restricted to time intervals before the pre-crossing time, , and between observations before and after the crossing, ,
[TABLE]
To address this problem in a more general fashion we start with a generic ISI process and two independent random variables and , which are also independent of . The latter condition is necessary to derive explicit functionals, but and (assuming the roles of and ) are neither mutually independent nor independent of . For that reason, we “expand” the above functionals in stochastic series over ’s so that each term of the series satisfies the required independence assumptions. The series converge to useful expressions for (1.1) and (1.2). Herewith we arrive at closed form expressions in terms of the Laplace transforms of and . The total tractability of these expressions is illustrated via special cases.
Applications of ISI processes under delayed observation are widespread. The authors previously investigated strategic networks under random attacks in which random quantities of nodes (along with associated weights) get disabled, modeled as an ISI process in 2D. The well-being of the network is monitored by delayed observations that offer a more realistic scenario than real-time information. If a certain number of nodes or weights become paralyzed, the entire network is disabled. In order to prevent such an event, we predicted the time at which a cumulative damage process exits from a rectangle and its excess value. With the new, time-sensitive, techniques, we largely improve our earlier (“time-insensitive”) models [7, 8]. The present work establishes a more general and systematic approach of stochastic interpolation that can naturally lead to further embellishments, e.g. with being multivariate and/or crossing multiple thresholds.
We note that our work falls into the class of the theory of fluctuations of stochastic processes that historically stem from the random walk behavior of a particle moving throughout a discrete deterministic grid and attempting to escape from a fixed set as in [3]. Later on, the notion of fluctuations was utilized to other stochastic processes like renewal, recurrent, and semi-Markov that were to cross a fixed threshold. (See Takács’ seminal paper [12].) This terminology, as well as the utility of a process leaving a fixed set, was found in various work ranging from insurance, risk, and reliability [4] to finance [5] to astronomy, biology, physics, and quantum physics [9, 11], and to networks [7, 8]. Topically, papers on fluctuations of marked Poisson and Cox processes [1], renewal and recurrent processes [12], and ISI processes [10] are more pertinent to our present work.
The time-sensitive tools can be utilized in other time-insensitive models, in particular in stochastic games, queueing, and finance [5, 6]. In some earlier forms, time-sensitive analysis was known in queueing [2] (under the name of semi-regenerative techniques) and in other stochastic processes such as Cox [1] to interpolate stationary probabilities of embedded processes.
The layout of the article is as follows. In Section 2, we state and prove some auxiliary results for general ISI processes, which are of separate interest. Namely, we consider an ISI process , observed at random times and where and are independent r.v.’s, which are also independent of . We derive expressions for functionals similar to (1.1) and (1.2), but based on times and rather than and . As already mentioned, the results of Section 2 do not directly apply if and are and because the latter are dependent in general. To overcome this obstacle, in Section 3 we reduce the functionals of Section 2 to the case when is a marked Poisson process observed by a renewal process and use a series expansion technique to arrive at Laplace transforms of functionals of the type (1.1) and (1.2), which we then illustrate explicitly in Section 4 by examples.
2 Some Important Results for General ISI Processes
Suppose is an independent and stationary increment (ISI) stochastic process valued in defined on a filtered probability space . Suppose and are nonnegative, independent r.v.’s, which are independent of the filtration . We will seek functionals
[TABLE]
where and
[TABLE]
Note (2.1)-(2.2) are somewhat similar to (1.1)-(1.2) with and replacing and . The key dissimilarity between the two is that and are not independent of the filtration .
For an -function or functional , denote its Laplace transform by .
Theorem 2.1**.**
\thlabel
FirstTheorem The functional of the ISI process on the trace -algebra where and are independent of each other and of the filtration satisfies
[TABLE]
where
[TABLE]
is the PGF of the process at time , and
[TABLE]
is the convolution of with valued at .
Proof.
First, rewrite
[TABLE]
Then, using (2.6)-(2.7), the assumed independence of from the -algebra (induced by and ), and the ISI property of , we have
[TABLE]
[TABLE]
Next, we seek
[TABLE]
Rewriting in the integral form and using (2), we have
[TABLE]
By the independence of and and Fubini’s Theorem,
[TABLE]
∎
Theorem 2.2**.**
\thlabel
SecondTheorem The functional of the ISI process on the trace -algebra
* where and are independent of each other and of the process satisfies*
[TABLE]
where and are defined in (2.4)-(2.5).
Proof.
First, notice
[TABLE]
for . Then, using (2.10)-(2.11), the ISI property of , and that the r.v.’s and are -measurable, we have
[TABLE]
where .
Next, we seek
[TABLE]
Writing in the integral form and using (2.12), we have
[TABLE]
By the independence of and and Fubini’s Theorem,
[TABLE]
Using the ISI property and the change of variables ,
[TABLE]
∎
Example 2.3**.**
We demonstrate the applicability of \threfFirstTheorem,SecondTheorem by considering the special case of as a marked (compound) Poisson process, with position-independent marking, i.e.
[TABLE]
where is the Dirac point mass centered at and are independent and identically distributed (IID) r.v.’s with common PGF , , and are independent of . Furthermore, the underlying Poisson counting measure is of intensity , so
[TABLE]
Note that the marked Poisson process is a real-time process evolving over a sequence of epochs . In Section 3, we will consider a “third-party” renewal process (mentioned in the introduction) over which will be observed, forming the time series .
Let denote the LST of a random variable .
Lemma 2.4**.**
\thlabel
ThirdTheorem Let be a marked Poisson process of intensity and let and be r.v.’s independent of each other and of the filtration , then
[TABLE]
where is the common PGF of the marks of ’s, the r.v. marks of the Poisson process.
Proof.
Since is a marked Poisson process, (2.14) implies
[TABLE]
and
[TABLE]
The Poissonian assumption leads to expressions (2.17)-(2.18), which simplify the result of \threfFirstTheorem to
[TABLE]
Similarly, by \threfSecondTheorem,
[TABLE]
∎
3 Delayed Passage Time Model
As noted in Section 2, is a marked Poisson process where the marks of the process, , are IID r.v.’s with common PGF , .
Next, we define a delayed renewal process over which will be observed. We assume that , , are independent of the filtration . As mentioned in the introduction, real-time information about the process may not be available to the observer. Denote the inter-observation times as for and .
We assume the initial observation time has a Laplace-Stieltjes transform (LST) and all subsequent inter-observation times have a common LST of , .
Denote the observed value of the process up to time (the th observation) by
[TABLE]
and the th increment between the successive observations, as
[TABLE]
where .
Since the very first observation epoch of time need not be stochastically equivalent to for , we will use a separate notation for the joint transform of the increment up to and the time itself,
[TABLE]
and the notation for the th increment and inter-observation time for all other ,
[TABLE]
with and .
We will be interested in the distribution of the first observation upon which the process exceeds a fixed threshold , so we define the exit index as a random integer corresponding to the first observation after a threshold crossing,
[TABLE]
while will be called the first observed crossing time. The goal of this section will be, under the condition that is a marked Poisson process, to derive the joint functionals,
[TABLE]
of the values of upon the observations immediately before and after the real-time crossing ( and ), the real-time value of the process , and the times of the observations immediately before and after the crossing ( and ). Notice that each functional deals with placed within a particular random time interval, either before or between and . These are the Laplace transforms of functionals (1.1) and (1.2), which are the primary goal of the study. Notice that in contrast to the assumptions of \threfFirstTheorem,SecondTheorem, and (that seem to resemble r.v.’s and ) are no longer independent of the filtration . To make use of these theorems, we will use a special stochastic decomposition of the exit index .
Thus, consider the family of exit indices
[TABLE]
corresponding to the first observed crossing of a threshold . For a bounded function , we will further use the operator
[TABLE]
where is the open unit ball centered at zero in the complex plane. [Note that the subscript is being used in the event an underlying function has other parameters or variables.]
The operator is applied to a complex-valued function , analytic at 0,
[TABLE]
Obviously is the inverse of Dp. That is, ,
In the following theorem, we will apply the transform Dp to a sequence of functionals including a factor of the form inside the expectation, i.e. a restriction of the functional to the set where time is before the observation just prior to the first observed crossing of a threshold . In Section 4, we will demonstrate how to apply the inverse operator to restore the functional where .
Denote
[TABLE]
Note that these functionals are similar to (3.6)-(3.7), except they specify a fixed index indicating the r.v.’s in the functionals are associated specifically with the th observation epoch. The utility of these functionals will be seen in the proofs of \threfFourthTheorem,FifthTheorem, as (3.6) and (3.7) will be expanded into series over this index of functionals of types (3.13) and (3.14) with the additional factor fixing within the expectations.
Theorem 3.1**.**
\thlabel
FourthTheorem The joint functional of the process on the interval satisfies
[TABLE]
where
[TABLE]
Proof.
Denote
[TABLE]
and notice
[TABLE]
Then
[TABLE]
Notice
[TABLE]
Then, by Fubini’s Theorem and since for ,
[TABLE]
Because the observation process is independent of , \threfThirdTheorem implies that, for ,
[TABLE]
Notice that the norm of the joint transform (3.4) of the increment of the process upon the th () inter-observation time is strictly less than 1 in each underlying instance. This is due to the argument in Appendix B (i.e. and ). Therefore, summing up (3.19) for yields a geometric series,
[TABLE]
where , , and are defined in (3.16). ∎
Theorem 3.2**.**
\thlabel
FifthTheorem The joint functional of the process on the interval satisfies
[TABLE]
where
[TABLE]
and is defined in (3.16).
Proof.
Denote
[TABLE]
Notice
[TABLE]
Then, by Fubini’s Theorem,
[TABLE]
Since the observation process is independent of , \threfThirdTheorem implies
[TABLE]
and, for ,
[TABLE]
Summing (3.23) via (3.24)-(3.26) over yields a geometric series,
[TABLE]
(See a pertinent argument in the paragraph below (3.19).) ∎
Corollary 3.3**.**
\thlabel
Corollary The joint functional of the process on the interval satisfies
[TABLE]
4 Results for a Special Case
Note that the results of the prior sections consider the marks and inter-observation times to be simply IID, with no further assumptions on the distributions. The purpose of this section is to demonstrate that the results of the prior sections can readily lead to expressions suitable for numerical and analytical manipulation. As such, we will now derive some results for the one-dimensional marked Poisson process discussed in the previous section under the following assumptions:
The marks are geometrically distributed with parameter , so their common PGF is for (where ) 2. 2.
The inter-observation times are exponentially distributed with parameter , so their common LST is for 3. 3.
We set the initial observation and the initial value of the process . Thus, we have .
While it is not significantly more complex to find and in full generality, in the interest of brevity, we will restrict our attention to the following demonstration of the utility of the results above by deriving the joint probability distribution , i.e. the distribution of the position of the process upon the first observed crossing, and the time of the observation just prior to the real-time crossing.
The first step is to use assumptions 1-3 to simplify the result of \threfFourthTheorem, which allows us to apply the inverse operator explicitly to find .
Proposition 4.1**.**
\thlabel
SixthTheorem Under assumptions 1-3, the Laplace transform of the probability generating function of the process upon the first observed passage time, , restricted to , is
[TABLE]
where .
Proof.
By \threfFourthTheorem and the linearity of the inverse (since the limit and derivative shown in (3.12) are linear),
[TABLE]
Using the result of Appendix A and assumptions 1-3, we first manipulate some terms into more convenient forms,
[TABLE]
The term from the last line of (4.2) simplifies as follows,
[TABLE]
The term from the last line of (4.2) simplifies as follows,
[TABLE]
The two terms and are special cases of (4.3) and (4.4), respectively, and follow trivially with . Plugging expressions (4.3)-(4.4) and those that follow for the other two terms into (4.2) yields (4.1), as required. ∎
The next step is to invert the Laplace transform to find , which appears similar to the PGF of except for the inclusion an of indicator function restricting it to the set as a factor within the expectation.
Proposition 4.2**.**
\thlabel
SeventhTheorem Under assumptions 1-3, the expectation satisfies
[TABLE]
where
[TABLE]
and is the lower regularized gamma function.
Proof.
The required result can be found by applying the inverse Laplace transform with respect to to the result of \threfSixthTheorem, i.e. . By linearity, it can be seen that all non-trivial Laplace inverses are taken of terms of the following two forms,
[TABLE]
The inverse Laplace transform of (4.8) is
[TABLE]
The inverse Laplace transform of (4.9) is
[TABLE]
Therefore, applying the inverse Laplace transform to (4.1) reduces it to a linear combination of results of the forms (4.10) and (4.11), yielding the result of the proposition, (4.5). ∎
From this result, one further step will yield the explicit joint distribution of and .
Proposition 4.3**.**
\thlabel
EighthTheorem The joint distribution of the pre-first observed passage time, , and the crossing level of the process, , is
[TABLE]
where
[TABLE]
Proof.
Since the result of \threfSeventhTheorem is a PGF of (restricted to ), we can find the joint distribution as
[TABLE]
We have
[TABLE]
As such, by the linearity of derivatives and limits, all -dependent terms fall into the form or , so we find (noting )
[TABLE]
and
[TABLE]
Therefore, taking the appropriate limit and derivatives of the PGF (4.5) of \threfSeventhTheorem yields a linear combination of terms of the forms (4.17) and (4.18), yielding (4.12) as required. ∎
The process of deriving the joint distribution consisted of (a) simplifying \threfFourthTheorem to the marginal transform under assumptions 1-3 above (\threfSixthTheorem), (b) taking the inverse Laplace transform to find (\threfSeventhTheorem), and (c) finding the joint probability distribution (\threfEighthTheorem). Any such joint distribution of , , or with or (via \threfCorollary) can be derived through a procedure with the same three general steps.
Acknowledgement
The authors are very grateful to the anonymous referee whose numerous remarks and suggestions greatly improved the mathematical contents of the paper, as well as its overall readability.
Appendix A Simplification of for a Marked Poisson Process
Proof.
If the underlying process is a marked Poisson process, the joint PGF and LST of an observed increment and the inter-observation time will simply as follows by the known property of the conditional expectation,
[TABLE]
where is the number of Poisson arrivals occurring within a time interval of length . Since the Poisson process has rate , is a Poisson random variable with parameter , then we have
[TABLE]
∎
Appendix B Proof that
Herein, we will show the norm of the joint PGF and LST of an observed increment and the inter-observation time , (as shown in Appendix A) is strictly bounded by 1 so that the geometric series will converge in the proofs above under a minor condition imposed on the parameters.
Recall that by definition, , (it could be zero if we seek the marginal PGF of ), and (it could be 1 if we seek the marginal LST of ). The convergence will occur if or (i.e. if either inequality is strict), as we show below.
Proof.
Let , then
[TABLE]
Notice that if and only if , which is true if and only if .
Assume that and . We will show that exactly one of these inequalities must be strict in order to ensure (and, thus, ).
Case 1: ,
[TABLE]
Therefore, if (and of course the real part of the PGF is nonnegative since for each , ), we have as required. Since is analytic and on the closed unit ball in the complex plane and , the Schwarz Lemma implies in the closed unit ball, so we have
[TABLE]
Thus, the result of (B.2) in (B.1) implies that . Since by the assumption, .
Case 2: ,
[TABLE]
In this case, we again have , but in this case we also have , so . Therefore, . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Agarwal, J. H. Dshalalow, and D. O’Regan. Time sensitive functionals of marked cox processes. Journal of Mathematical Analysis and Applications , 293:14–27, 2004.
- 2[2] N. Al-Matar and J. H. Dshalalow. Time sensitive functionals in classes of queues with sequential maintenance. Stochastic Models , 27:687–704, 2011.
- 3[3] N. H. Bingham. Random walk and fluctuation theory. In D. N. Shanbhag and C. R. Rao, editors, Handbook of Statistics , volume 19, pages 171–213. Elsevier Science, 2001.
- 4[4] K. A. Borovkov and D. C. M. Dickson. On the ruin time distribution for a sparre andersen process with exponential claim sizes. Insurance: Mathematics and Economics , 42(3):1104–1108, 2008.
- 5[5] J. H. Dshalalow. On exit times of a multivariate random walk with some applications to finance. Nonlinear Analysis , 63:569–577, 2005.
- 6[6] J. H. Dshalalow and H.-J. Ke. Multilayers in a modulated stochastic game. Journal of Mathematical Analysis and Applications , 353:553–565, 2009.
- 7[7] J. H. Dshalalow and R. T. White. On reliability of stochastic networks. Neural, Parallel, and Scientific Computations , 21:141–160, 2013.
- 8[8] J. H. Dshalalow and R. T. White. On strategic defense in stochastic networks. Stochastic Analysis and Applications , 32:365–396, 2014.
