We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Let $\mathcal{C}$ denote the family of all coherent distributions on the unit square $[0,1]^2$, i.e. all those probability measures $\mu$ for which there exists a random vector $(X,Y)\sim \mu$, a pair $(\mathcal{G},\mathcal{H})$ of $\sigma$-fields, and an event E such that $X=\mathbb{P}(E\mid\mathcal{G})$, $Y=\mathbb{P}(E\mid\mathcal{H})$ almost surely. We examine the set $\mathrm{ext}(\mathcal{C})$ of extreme points of $\mathcal{C}$ and provide its general characterisation. Moreover, we establish several structural properties of finitely-supported elements of $\mathrm{ext}(\mathcal{C})$. We apply these results to obtain the asymptotic sharp bound $\lim_{\alpha \to \infty}\alpha\cdot(\sup_{(X,Y)\in \mathcal{C}}\mathbb{E}|X-Y|^{\alpha}) = {2}/{\mathrm{e}}$.
Chapter 7 covers PROBABILITY FUNDAMENTALS and includes the following specific topics, among others: the discrete case, additive rules of probability, complement rule of probability, multiplicative rule of probability,conditional probability, Bayes’ theorem, the Law of Large Numbers.
Chapter 7 covers probability fundamentals and includes the following specific topics, among others: the discrete case, additive rules of probability, complement rule of probability, multiplicative rule of probability, conditional probability, Bayes’ theorem, and the law of large numbers.
This chapter looks at Bayesian approaches to cognitive science. The first section reviews the basic elements of conditional probability and Bayes's rule. The second section explores how Bayesian inference might work in the case of perception, which continuously predicts the outside environment. Sensory inputs provide the evidence so that the perception system derives the conditional probability of different hypotheses, given the current evidence, through Bayes's rule, which allows the perception system to update its hypothesis about the environment. We will look at the case of binocular rivalry to see how this inference can work on ambiguous stimuli. In the next section, we address an extension of Bayesian principles to decision-making -- the theory of expected utility. Utility represents the strength of preference for available options. We introduce the calculation of expected utility and look at some experiments suggesting that the brain processes expected utility in a broadly Bayesian manner.
In this appendix, we collect together some basic material that readers should know before studying this book. The material includes sets, enumeration, and probability. In practice, we have found that students have often already been exposed to this material and only need a quick review, so we did not want to include another introductory chapter delaying the study of our main topics. We cover sets, subsets, universal sets, unions,intersections and complements, Cartesian products, power sets, and rules such as De Morgan's laws. For enumeration, we cover the addition and multiplications rules and special cases such as permutations and combinations. For probability, although our coverage is less detailed than other chapters, we actually cover more than we need for the rest of the book, including conditional probability and Bayes's theorem. Most readers will be comfortable just using this chapter as a reference or review.
We prove the sharp bound for the probability that two experts who have access to different information, represented by different $\sigma$-fields, will give radically different estimates of the probability of an event. This is relevant when one combines predictions from various experts in a common probability space to obtain an aggregated forecast. The optimizer for the bound is explicitly described. This paper was originally titled ‘Contradictory predictions’.
The notions of disintegration and Bayesian inversion are fundamental in conditional probability theory. They produce channels, as conditional probabilities, from a joint state, or from an already given channel (in opposite direction). These notions exist in the literature, in concrete situations, but are presented here in abstract graphical formulations. The resulting abstract descriptions are used for proving basic results in conditional probability theory. The existence of disintegration and Bayesian inversion is discussed for discrete probability, and also for measure-theoretic probability – via standard Borel spaces and via likelihoods. Finally, the usefulness of disintegration and Bayesian inversion is illustrated in several examples.
The growing movement of people and goods that started in the closing years of the twentieth century has increased the possibility of the accidental or intentional introduction of biohazards that can affect agricultural production in the United States. This study examines the ex ante decision between the deployment of monitoring devices (traps) versus the use of countermeasures to control Mediterranean fruit flies in Florida. To examine this tradeoff, this study outlines a mathematical model to study the effectiveness of traps and the cost of treatment. The empirical results presented in this study indicate that additional parameterization efforts are needed.
We propose an efficient semi-numerical approach to compute the steady-state probability distribution for the number of requests at arbitrary and at arrival time instants in PH/M/c-like systems with homogeneous servers in which the inter-arrival time distribution is represented by an acyclic set of memoryless phases. Our method is based on conditional probabilities and results in a simple computationally stable recurrence. It avoids the explicit manipulation of potentially large matrices and involves no iteration. Owing to the use of conditional probabilities, it delays the onset of numerical issues related to floating-point underflow as the number of servers and/or phases increases. For generalized Coxian distributions, the computational complexity of the proposed approach grows linearly with the number of phases in the distribution.
Blooms of toxic cyanobacteria became a common feature of temperate lakes and ponds owing to human induced eutrophication. Occurrence of cyanobacterial blooms in an urban context may pose serious health concerns. This necessitates the development of tools for assessment of the risk of noxious bloom occurrence. A five year study of 42 Brussels ponds showed that cyanobacteria have threshold rather than linear relationships with environmental variables controlling them. Hence, linear relationships have limited predictive capacity for cyanobacterial blooms. A probabilistic approach to prediction of bloom occurrence using environmental thresholds as conditions in conditional probability calculation proved to be more useful. It permitted the risk of cyanobacterial bloom occurrence to be quantified and thus the conditions and thence the ponds the most prone to cyanobacterial bloom development to be singled out. This approach can be applied for the assessment of the risk of cyanobacterial bloom occurrence in urban ponds and thus can facilitate monitoring planning, remediation efforts and setting restoration priorities.
A saddlepoint expansion is given for conditional probabilities of the form where is an average of n independent bivariate random vectors. A more general version, corresponding to the conditioning on a p – 1-dimensional linear function of a p-dimensional variable is also included. A separate formula is given for the lattice case. The expansion is a generalization of the Lugannani and Rice (1980) formula, which reappears if and are independent. As an example an approximation to the hypergeometric distribution is derived.
We consider a diffusion process on the reals subject to the conditional probability that the process is positive from t = 0 to the present. We establish comparison results between the conditioned diffusion and a second unconditioned Markov diffusion. One result allows the initial process to be non-Markov before conditioning. A stronger comparison theorem is shown to hold in the Markov case.
Karlin and Rinott (1980) introduced and investigated concepts of multivariate total positivity (TP2) and multivariate monotone likelihood ratio (MLR) for probability measures on Rn These TP and MLR concepts are intimately related to supermodularity as discussed in Topkis (1968), (1978) and the FKG inequality of Fortuin, Kasteleyn and Ginibre (1971). This note points out connections between these concepts and uniform conditional stochastic order (ucso) as defined in Whitt (1980). ucso holds for two probability distributions if there is ordinary stochastic order for the corresponding conditional probability distributions obtained by conditioning on subsets from a specified class. The appropriate subsets to condition on for ucso appear to be the sublattices of Rn. Then MLR implies ucso, with the two orderings being equivalent when at least one of the probability measures is TP2.
One probability measure is less than or equal to another in the sense of UCSO (uniform conditional stochastic order) if a standard form of stochastic order holds for each pair of conditional probability measures obtained by conditioning on appropriate subsets. UCSO can be applied to the comparison of lifetime distributions or the comparison of decisions under uncertainty when there may be reductions in the set of possible outcomes. When densities or probability mass functions exist on the real line, then the main version of UCSO is shown to be equivalent to the MLR (monotone likelihood ratio) property. UCSO is shown to be preserved by some standard probability operations and not by others.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.