• 제목/요약/키워드: random elements

검색결과 256건 처리시간 0.028초

Complete convergence for weighted sums of arrays of random elements

  • Sung, Soo-Hak
    • 대한수학회지
    • /
    • 제32권4호
    • /
    • pp.679-688
    • /
    • 1995
  • Let $(B, \left\$\mid$ \right\$\mid$)$ be a real separable Banach space. Let $(\Omega, F, P)$ denote a probability space. A random elements in B is a function from $\Omega$ into B which is $F$-measurable with respect to the Borel $\sigma$-field $B$(B) in B.

  • PDF

Random Elements in $L^1(R)$ and Kernel Density Estimators

  • Lee, Sung-Ho;Lee, Robert -Taylor
    • Journal of the Korean Statistical Society
    • /
    • 제22권1호
    • /
    • pp.83-91
    • /
    • 1993
  • Random elements in $L^1(R)$ and some properties of $L^1(R)$ space are investigated with application to kernel density estimators. A weak law of large numbers for compact uniformly integrable random elements is introduced for further application.

  • PDF

ON COMPLETE CONVERGENCE FOR ARRAYS OF ROWWISE INDEPENDENT RANDOM ELEMENTS

  • Sung Soo-Hak;Cabrera Manuel Ordonez;Hu Tien-Chung
    • 대한수학회지
    • /
    • 제44권2호
    • /
    • pp.467-476
    • /
    • 2007
  • A complete convergence theorem for arrays of rowwise independent random variables was proved by Sung, Volodin, and Hu [14]. In this paper, we extend this theorem to the Banach space without any geometric assumptions on the underlying Banach space. Our theorem also improves some known results from the literature.

Sub-gaussian Techniques in Obtaining Laws of Large Numbers in $L^1$(R)

  • Lee, Sung-Ho;Lee, Robert -Taylor
    • Journal of the Korean Statistical Society
    • /
    • 제23권1호
    • /
    • pp.39-51
    • /
    • 1994
  • Some exponential moment inequalities for sub-gaussian random variables are studied in this paper. These inequalities are used to obtain laws of large numbers for random variable and random elements in $L^1(R)$.

  • PDF

An Empirical Central Limit Theorem for the Kaplan-Meier Integral Process on [0,$\infty$)

  • Bae, Jong-Sig
    • Journal of the Korean Statistical Society
    • /
    • 제26권2호
    • /
    • pp.231-243
    • /
    • 1997
  • In this paper we investigate weak convergence of the intergral processes whose index set is the non-compact infinite time interval. Our first goal is to develop the empirical central limit theorem as random elements of [0, .infty.) for an integral process which is constructed from iid variables. In developing the weak convergence as random elements of D[0, .infty.), we will use a result of Ossiander(4) whose proof heavily depends on the total boundedness of the index set. Our next goal is to establish the empirical central limit theorem for the Kaplan-Meier integral process as random elements of D[0, .infty.). In achieving the the goal, we will use the above iid result, a representation of State(6) on the Kaplan-Meier integral, and a lemma on the uniform order of convergence. The first result, in some sense, generalizes the result of empirical central limit therem of Pollard(5) where the process is regarded as random elements of D[-.infty., .infty.] and the sample paths of limiting Gaussian process may jump. The second result generalizes the first result to random censorship model. The later also generalizes one dimensional central limit theorem of Stute(6) to a process version. These results may be used in the nonparametric statistical inference.

  • PDF

Banach 공간에서 독립인 확률요소들의 Tail 합에 대한 대수의 법칙에 대하여 (On the Tail Series Laws of Large Numbers for Independent Random Elements in Banach Spaces)

  • 남은우
    • 한국콘텐츠학회논문지
    • /
    • 제6권5호
    • /
    • pp.29-34
    • /
    • 2006
  • 본 연구에서는, Banach 공간의 값을 갖는 확률요소들의 합 $S_n=\sum_{i=1}^nV-i$ 수렴하는 경우에, Tail 합 $T_n=S-S_{n-1}=\sum_{i=n}^{\infty}V-i$에 대한 대수의 법칙을 고찰하여 $S_n$이 하나의 확률변수 S로 수렴하는 속도를 연구한다. 좀 더 구체적으로 말하자면, 확률변수들의 Tail 합과 확률요소들의 Tail 합에 대한 극한 성질의 유사성을 연구하여, Banach 공간에서 독립인 확률요소들의 Tail 합에 대한 약 대수의 법칙과 하나의 수렴법칙이 동등함을 기술하는 기존의 정리를 다른 대체적인 방법으로 증명한다.

  • PDF

CONVERGENCE OF DOUBLE SERIES OF RANDOM ELEMENTS IN BANACH SPACES

  • Tien, Nguyen Duy;Dung, Le Van
    • 대한수학회지
    • /
    • 제49권5호
    • /
    • pp.1053-1064
    • /
    • 2012
  • For a double array of random elements $\{X_{mn};m{\geq}1,n{\geq}1\}$ in a $p$-uniformly smooth Banach space, $\{b_{mn};m{\geq}1,n{\geq}1\}$ is an array of positive numbers, convergence of double random series ${\sum}^{\infty}_{m=1}{\sum}^{\infty}_{n=1}X_{mn}$, ${\sum}^{\infty}_{m=1}{\sum}^{\infty}_{n=1}b^{-1}_{mn}X_{mn}$ and strong law of large numbers $$b^{-1}_{mn}\sum^m_{i=1}\sum^n_{j=1}X_{ij}{\rightarrow}0$$ as $$m{\wedge}n{\rightarrow}{\infty}$$ are established.

계층적 속성 랜덤 그래프의 정의 및 이를 이용한 여러 응용들의 소개 (Definition of hierarchical attributed random graph and proposal of its applications)

  • 성동수
    • 전자공학회논문지C
    • /
    • 제34C권8호
    • /
    • pp.79-87
    • /
    • 1997
  • For the representation of a complex object, the object is decomposed into several parts, and it is described by these decomposed parts and their relations. In genral, the parts can be the primitive elements that can not be decomposed further, or can be decomposed into their subparts. Therefore, the hierarchical description method is very natural and it si represented by a hierarchical attributed graph whose vertieces represent either primitive elements or graphs. This graphs also have verties which contain primitive elements or graphs. When some uncertainty exists in the hierarchical description of a complex object either due to noise or minor deformation, a probabilistic description of the object ensemble is necessary. For this purpose, in this paper, we formally define the hierarchical attributed random graph which is extention of the hierarchical random graph, and erive the equations for the entropy calculation of the hierarchical attributed random graph, and derive the equations for the entropy calculation of the hierarchical attributed random graph. Finally, we propose the application areas to use these concepts.

  • PDF

POISSON APPROXIMATION OF INDUCED SUBGRAPH COUNTS IN AN INHOMOGENEOUS RANDOM INTERSECTION GRAPH MODEL

  • Shang, Yilun
    • 대한수학회보
    • /
    • 제56권5호
    • /
    • pp.1199-1210
    • /
    • 2019
  • In this paper, we consider a class of inhomogeneous random intersection graphs by assigning random weight to each vertex and two vertices are adjacent if they choose some common elements. In the inhomogeneous random intersection graph model, vertices with larger weights are more likely to acquire many elements. We show the Poisson convergence of the number of induced copies of a fixed subgraph as the number of vertices n and the number of elements m, scaling as $m={\lfloor}{\beta}n^{\alpha}{\rfloor}$ (${\alpha},{\beta}>0$), tend to infinity.