• Title/Summary/Keyword: random processes

Search Result 360, Processing Time 0.032 seconds

Random Central Limit Theorem of a Stationary Linear Lattice Process

  • Lee, Sang-Yeol
    • Journal of the Korean Statistical Society
    • /
    • v.23 no.2
    • /
    • pp.504-512
    • /
    • 1994
  • A simple proof for the random central limit theorem is given for a family of stationary linear lattice processes, which belogn to a class of 2 dimensional random fields, applying the Beveridge and Nelson decomposition in time series context. The result is an extension of Fakhre-Zakeri and Fershidi (1993) dealing with the linear process in time series to the case of the linear lattice process with 2 dimensional indices.

  • PDF

WEAK CONVERGENCE FOR STATIONARY BOOTSTRAP EMPIRICAL PROCESSES OF ASSOCIATED SEQUENCES

  • Hwang, Eunju
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.1
    • /
    • pp.237-264
    • /
    • 2021
  • In this work the stationary bootstrap of Politis and Romano [27] is applied to the empirical distribution function of stationary and associated random variables. A weak convergence theorem for the stationary bootstrap empirical processes of associated sequences is established with its limiting to a Gaussian process almost surely, conditionally on the stationary observations. The weak convergence result is proved by means of a random central limit theorem on geometrically distributed random block size of the stationary bootstrap procedure. As its statistical applications, stationary bootstrap quantiles and stationary bootstrap mean residual life process are discussed. Our results extend the existing ones of Peligrad [25] who dealt with the weak convergence of non-random blockwise empirical processes of associated sequences as well as of Shao and Yu [35] who obtained the weak convergence of the mean residual life process in reliability theory as an application of the association.

Optimal Design of Batch-Storage Network Including Uncertainty and Waste Treatment Processes (불확실한 공정과 불량품 처리체계를 포함하는 공정-저장조 망 최적설계)

  • Yi, Gyeongbeom;Lee, Euy-Soo
    • Korean Chemical Engineering Research
    • /
    • v.46 no.3
    • /
    • pp.585-597
    • /
    • 2008
  • The aim of this study was to find an analytic solution to the problem of determining the optimal capacity (lot-size) of a batch-storage network to meet demand for a finished product in a system undergoing random failures of operating time and/or batch material. The superstructure of the plant considered here consists of a network of serially and/or parallel interlinked batch processes and storage units. The production processes transform a set of feedstock materials into another set of products with constant conversion factors. The final product demand flow is susceptible to short-term random variations in the cycle time and batch size as well as long-term variations in the average trend. Some of the production processes have random variations in product quantity. The spoiled materials are treated through regeneration or waste disposal processes. All other processes have random variations only in the cycle time. The objective function of the optimization is minimizing the total cost, which is composed of setup and inventory holding costs as well as the capital costs of constructing processes and storage units. A novel production and inventory analysis, the PSW (Periodic Square Wave) model, provides a judicious graphical method to find the upper and lower bounds of random flows. The advantage of this model is that it provides a set of simple analytic solutions while also maintaining a realistic description of the random material flows between processes and storage units; as a consequence of these analytic solutions, the computation burden is significantly reduced.

Optimal Design of Process-Inventory Network under Cycle Time and Batch Quantity Uncertainties (이중 불확실성하의 공정-저장조 망구조 최적설계)

  • Suh, Kuen-Hack;Yi, Gyeong-Beom
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.3
    • /
    • pp.305-312
    • /
    • 2010
  • The aim of this study is to find an analytic solution to the problem of determining the optimal capacity of a batch-storage network to meet demand for finished products in a system undergoing joint random variations of operating time and batch material loss. The superstructure of the plant considered here consists of a network of serially and/or parallel interlinked batch processes and storage units. The production processes transform a set of feedstock materials into another set of products with constant conversion factors. The final product demand flow is susceptible to joint random variations in the cycle time and batch size. The production processes have also joint random variations in cycle time and product quantity. The spoiled materials are treated through regeneration or waste disposal processes. The objective function of the optimization is minimizing the total cost, which is composed of setup and inventory holding costs as well as the capital costs of constructing processes and storage units. A novel production and inventory analysis the PSW (Periodic Square Wave) model, provides a judicious graphical method to find the upper and lower bounds of random flows. The advantage of this model is that it provides a set of simple analytic solutions while also maintaining a realistic description of the random material flows between processes and storage units; as a consequence of these analytic solutions, the computation burden is significantly reduced. The proposed method has the potential to rapidly provide very useful data on which to base investment decisions during the early plant design stage. It should be of particular use when these decisions must be made in a highly uncertain business environment.

A Sharp Result of Random Upper Functions for Levy Processes

  • Kim, Gwan-Young;Joo, Sang-Yeol;Kim, Yun-Kyong
    • Journal of the Korean Statistical Society
    • /
    • v.24 no.1
    • /
    • pp.65-76
    • /
    • 1995
  • In this paper, we show that the result of random upper functions for Levy processes obtained by Joo(1993) can be sharpened under some additional assumption. This is the continuous analogue of result obtained by Griffin and Kuelbs (1989) for sums of i.i.d. random varialbles.

  • PDF

A Note on the Strong Mixing Property for a Random Coefficient Autoregressive Process

  • Lee, Sang-Yeol
    • Journal of the Korean Statistical Society
    • /
    • v.24 no.1
    • /
    • pp.243-248
    • /
    • 1995
  • In this article we show that a class of random coefficient autoregressive processes including the NEAR (New exponential autoregressive) process has the strong mixing property in the sense of Rosenblatt with mixing order decaying to zero. The result can be used to construct model free prediction interval for the future observation in the NEAR processes.

  • PDF

THE CENTRAL LIMIT THEOREMS FOR STATIONARY LINEAR PROCESSES GENERATED BY DEPENDENT SEQUENCES

  • Kim, Tae-Sung;Ko, Mi-Hwa;Ryu, Dae-Hee
    • Journal of applied mathematics & informatics
    • /
    • v.12 no.1_2
    • /
    • pp.299-305
    • /
    • 2003
  • The central limit theorems are obtained for stationary linear processes of the form Xt = (equation omitted), where {$\varepsilon$t} is a strictly stationary sequence of random variables which are either linearly positive quad-rant dependent or associated and {aj} is a sequence of .eat numbers with (equation omitted).

LARGE TIME ASYMPTOTICS OF LEVY PROCESSES AND RANDOM WALKS

  • Jain, Naresh C.
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.3
    • /
    • pp.583-611
    • /
    • 1998
  • We consider a general class of real-valued Levy processes {X(t), $t\geq0$}, and obtain suitable large deviation results for the empiricals L(t, A) defined by $t^{-1}{\int^t}_01_A$(X(s)ds for t > 0 and a Borel subset A of R. These results are used to obtain the asymptotic behavior of P{Z(t) < a}, where Z(t) = $sup_{u\leqt}\midx(u)\mid$ as $t\longrightarrow\infty$, in terms of the rate function in the large deviation principle. A subclass of these processes is the Feller class: there exist nonrandom functions b(t) and a(t) > 0 such that {(X(t) - b(t))/a(t) : t > 0} is stochastically compact, i.e., each sequence has a weakly convergent subsequence with a nondegenerate limit. The stable processes are in this class, but it is much larger. We consider processes in this class for which b(t) may be taken to be zero. For any t > 0, we consider the renormalized process ${X(u\psi(t))/a(\psi(t)),u\geq0}$, where $\psi$(t) = $t(log log t)^{-1}$, and obtain large deviation probability estimates for $L_{t}(A)$ := $(log log t)^{-1}$${\int_{0}}^{loglogt}1_A$$(X(u\psi(t))/a(\psi(t)))dv$. It turns out that the upper and lower bounds are sharp and depend on the entire compact set of limit laws of {X(t)/a(t)}. The results extend to random walks in the Feller class as well. Earlier results of this nature were obtained by Donsker and Varadhan for symmetric stable processes and by Jain for random walks in the domain of attraction of a stable law.

  • PDF

THE BEHAVIOUR OF PROBABILISTIC ERROR BOUNDS IN FLOATING POINT ALGEBRAIC PROCESSES

  • M.Mitrouli;C.Koukouvinos
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.1
    • /
    • pp.211-222
    • /
    • 1997
  • In this paper we present a probabilistic approach for the estimation of realistic error bounds appearing in the execution of basic algebraic floating point operations. Experimental results are carried out for the extended product the extended sum the inner product of random normalised numbers the product of random normalised ma-trices and the solution of lower triangular systems The ordinary and probabilistic bounds are calculated for all the above processes and gen-erally in all the executed examples the probabilistic bounds are much more realistic.