Open AccessBook
An Introduction to Probability Theory and Its Applications, Volume II
Frank E. Grubbs,William Feller +1 more
- 01 Jan 1971
1.4K
About: The article was published on 01 Jan 1971. and is currently open access. The article focuses on the topics: Law of the unconscious statistician & Convolution of probability distributions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Non-termination and secure information flow
Geoffrey Smith,Rafael Alpízar +1 more
TL;DR: This paper proposes a ‘stripping’ operation on programs, which eliminates all ‘high computation’, and proves the fundamental property that stripping cannot decrease the probability of any low outcome, and introduces a new notion of fast probabilistic simulation on Markov chains.
Weak laws of large numbers for cooperative gamblers
Sándor Csörgő,Gordon Simons +1 more
TL;DR: Based on a stochastic extension of Karamata’s theory of slowly varying functions, necessary and sufficient conditions are established for weak laws of large numbers for arbitrary linear combinations of independent and identically distributed nonnegative random variables.
4
•Posted Content
Banach spaces characterization of random vectors with exponential decreasing tails of distribution
E. Ostrovsky,L. Sirota +1 more
TL;DR: In this paper, the authors present the Banach space representation for the set of random finite-dimensional vectors with exponential decreasing tails of distributions, and show that there are at last three types of these multidimensional Banach spaces, i.e., exponential Orlicz spaces, Young spaces and Grand Lebesgue spaces.
3
Probabilistic Data Propagation in Wireless Sensor Networks
Sotiris Nikoletseas,Paul G. Spirakis +1 more
- 01 Jan 2011
TL;DR: Two characteristic methods for data propagation are presented: the first performs a local, greedy optimization to minimize the number of data transmissions needed, while the second creates probabilistically optimized redundant data transmissions to trade off energy efficiency with fault tolerance.
3
•Posted Content
Approximate Top-k Retrieval from Hidden Relations
TL;DR: This work proposes an algorithm that uses regression models at query time to assess whether a row of the matrix can enter the top-k set given that only a subset of its values are known and considers prior information about the values in the hidden matrix.
3
Related Papers (5)
William Feller
- 01 Jan 1950
Patrick Billingsley
- 01 Jan 1968
Patrick Billingsley
- 01 Jan 1979
[...]
J. L. Doob,Joseph L. Doob +1 more
- 01 Jan 1953
Amir Dembo,Ofer Zeitouni +1 more
- 27 Mar 1998