A basic course in probability theory

By Rabi N. Bhattacharya, E. Waymire. 2007

144 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Central Limit Theorem (2021, background): “Similarly, we may find a subsequence of this subsequence, denoted F n (2) k , such that n (2) 1 > n (1) 1 and Fn(2) k converges.”
Stratification Trees for Adaptive Randomization in Randomized Controlled Trials (2018, methodology): “Because of this, the most common approaches to fit decision trees in statistics and machine learning are greedy: they begin by searching for a single partitioning of the data which minimizes the objective, and once this is found, the processes is repeated recursively on each of the new partitions (B”
Conditioning-based metrics on the space of multivariate copulas and their interrelation with uniform and levelwise convergence and Iterated Function Systems (2015, background): “For more details and properties of conditional 95 expectation and regular conditional distributions see [19], [20] and [2], [3].”
A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization (2018, methodology): “cableinthissituation. Wealsowanttopointout that the integrabilityconditions in Assumption 4.2 are only required for the well-deﬁnedness of the conditionalexpectations and for the associated calculus, [88, 12]. 4.2. Second Order Properties and Bounded Invertibility. In this subsection, we derive a ge”