Results 271 to 280 of about 6,294,373 (325)
Some of the next articles are maybe not open access.
Communications in Statistics - Theory and Methods, 2019
In this article, complete convergence theorems are obtained for arrays of widely negative dependent random variables under sublinear expectations. We improve the corresponding results in probability space, and provide a new method to prove them.
Yiwei Lin, Xinwei Feng
semanticscholar +1 more source
In this article, complete convergence theorems are obtained for arrays of widely negative dependent random variables under sublinear expectations. We improve the corresponding results in probability space, and provide a new method to prove them.
Yiwei Lin, Xinwei Feng
semanticscholar +1 more source
Complete Convergence of Martingale Arrays
Journal of Theoretical Probability, 1998A sequence \(\{U_n, n\geq 1\}\) of random variables is said to converge completely to the constant \(c\) if \(\sum^\infty_{n= 1} P(| U_n- c|> \varepsilon)< \infty\) for all \(\varepsilon> 0\). The definition was introduced by \textit{P. L. Hsu} and \textit{H. Robbins} [Proc. Natl. Acad. Sci.
Ghosal, Subhashis, Chandra, Tapas K.
openaire +1 more source
Completion of Semiuniform Convergence Spaces
Applied Categorical Structures, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Complete Convergence of the Directed TSP
Mathematics of Operations Research, 1991Consider the random directed graph Gn whose vertices X1, …, Xn are independent uniformly distributed over [0, 1]2. For 1 ≤ i < j ≤ n, the orientation of the edge XiXj is selected at random, independently for each edge and independently of the Xi's. Denote by Un the length of the shortest path through Gn.
openaire +2 more sources
Statistics (Berlin), 2019
Consider the linear process , where is a sequence of identically distributed, negatively associated random variables with , and is a sequence of real numbers with .
X. Deng, Xuejun Wang, Shuhe Hu, M. Hu
semanticscholar +1 more source
Consider the linear process , where is a sequence of identically distributed, negatively associated random variables with , and is a sequence of real numbers with .
X. Deng, Xuejun Wang, Shuhe Hu, M. Hu
semanticscholar +1 more source
Communications in Statistics - Theory and Methods, 2019
In this paper, the complete convergence and the complete moment convergence for maximal randomly weighted sums of widely orthant-dependent (WOD, in short) random variables are investigated.
Dawei Lu, Jialu Wang
semanticscholar +1 more source
In this paper, the complete convergence and the complete moment convergence for maximal randomly weighted sums of widely orthant-dependent (WOD, in short) random variables are investigated.
Dawei Lu, Jialu Wang
semanticscholar +1 more source
Complete convergence for arrays of row-wise ND random variables under sub-linear expectations
Communications in Statistics - Theory and Methods, 2019In this paper, complete convergence for arrays of row-wise ND random variables under sub-linear expectations is studied. As applications, the complete convergence theorems of weighted sums for negatively dependent random variables have been generalized ...
Wenjuan Wang, Qunying Wu
semanticscholar +1 more source
Completing the convergence puzzle: a survey and a roadmap
IEEE Wireless Communications, 2009Convergence has more than ever been a central issue for fixed and mobile operators throughout the world and is considered to be the next big step in the evolution of telecommunication networks. Convergence opens new market opportunities and competition among network operators and above all offers enhanced user experience.
Meddour D.-E. +4 more
openaire +1 more source
Complete convergence for weighted sums of WNOD random variables and its applications
Stochastics, 2019In this paper, we mainly studied the complete convergence for weighted sums of widely negative orthant dependent (WNOD, in short) random variables. Some sufficient conditions to prove the complete convergence are provided. As an application, the complete
Mingming Ning, Caoqing Wu, A. Shen
semanticscholar +1 more source
The Complete Convergence of Best Fit Decreasing
SIAM Journal on Computing, 1989Summary: Consider a probability measure \(\mu\) on [0,1] and an independent sequence of random variables \(X_ 1,...,X_ n,..\). distributed according to \(\mu\). No regularity assumptions are made on \(\mu\). Denote by \(B(X_ 1,...,X_ n)\) the number of unit-size bins that are used by Best Fit Decreasing to pack items of size \(X_ 1,...,X_ n\).
Wansoo T. Rhee, Michel Talagrand
openaire +1 more source