Chapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses

Save this PDF as:

Size: px
Start display at page:

Download "Chapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses"

Transcription

1 Chapter ML:IV IV. Statistical Learning Probability Basics Bayes Classification Maximum a-posteriori Hypotheses ML:IV-1 Statistical Learning STEIN

2 Area Overview Mathematics Statistics Stochastics Probability theory Mathematical statistics Inferential statistics Descriptive statistics Exploratory data analysis Data mining From the area of probability theory: Kolmogorov axioms From the area of mathematical statistics: Naive Bayes ML:IV-2 Statistical Learning STEIN

3 Definition 1 (Random Experiment, Random Observation) An random experiment or random trial is a procedure that, at least theoretically, can be repeated infinite times. It is characterized as follows: 1. Configuration. A precisely specified system that can be reconstructed. 2. Procedure. An instruction of how to execute the experiment based on the configuration. 3. Unpredictability of outcome. Random experiments whose configuration and procedure are not designed artificially are called natural random experiments or natural random observations. ML:IV-3 Statistical Learning STEIN

4 Remarks: A procedure can be repeated several times using the same system, but also with equivalent different systems. Random experiments are causal in the sense of cause and effect. The randomness of an experiment (the unpredictability of its outcome) is a consequence of the missing information about the causal chain. As a consequence, a random experiment may turn to a deterministic process if new insights become known. ML:IV-4 Statistical Learning STEIN

5 Definition 2 (Sample Space, Event Space) A set Ω = {ω 1, ω 2,..., ω n } is called sample space of a random experiment, if each experiment outcome is associated with at most one element ω Ω. The elements in Ω are called outcomes. Let Ω be a finite sample space. Each subset A Ω is called an event; an event A occurs iff the experiment outcome ω is a member of A. The set of all events, P(Ω), is called the event space. ML:IV-5 Statistical Learning STEIN

6 Definition 2 (Sample Space, Event Space) A set Ω = {ω 1, ω 2,..., ω n } is called sample space of a random experiment, if each experiment outcome is associated with at most one element ω Ω. The elements in Ω are called outcomes. Let Ω be a finite sample space. Each subset A Ω is called an event; an event A occurs iff the experiment outcome ω is a member of A. The set of all events, P(Ω), is called the event space. Definition 3 (Important Event Types) Let Ω be a finite sample space, and let A Ω and B Ω be two events. Then we agree on the following notation: 1. impossible event 2. Ω certain event 3. A := Ω \ A complementary event (opposite event) of A 4. A = 1 elementary event 5. A B A is a sub-event of B or A entails B, A B 6. A = B A B and B A 7. A B = A and B are incompatible (compatible otherwise) ML:IV-6 Statistical Learning STEIN

7 Classical Concept Formation Empirical law of large numbers: For particular events the average of the outcomes obtained from a large number of trials is close to the expected value, and it will become closer as more trials are performed. ML:IV-7 Statistical Learning STEIN

8 Classical Concept Formation Empirical law of large numbers: For particular events the average of the outcomes obtained from a large number of trials is close to the expected value, and it will become closer as more trials are performed. Definition 4 (Classical / Laplace Probability) If each elementary event in Ω gets assigned the same probability, then the probability P (A) of an event A is defined as follows: P (A) = A Ω = number of cases favorable for A number of total outcomes possible ML:IV-8 Statistical Learning STEIN

9 Remarks: A random experiment whose configuration and procedure imply an equiprobable sample space, be it by definition or by construction, is called Laplace experiment. The probabilities of the outcomes are called Laplace probabilities. Since they are defined by the experiment configuration along with the experiment procedure, they need not to be estimated. The assumption that a given experiment is a Laplace experiment is called Laplace assumption. If the Laplace assumption cannot be presumed, the probabilities can only be obtained from a possibly large number of trials. Strictly speaking, the Laplace probability as introduced above is not a definition but a circular definition: the probability concept is defined by means of the concept of equalprobability, i.e., another kind of probability. Inspired by the empirical law of large numbers, one has tried to develop a frequentist probability concept that is based on the (fictitious) limit of the relative frequencies [von Mises, 1951]. The attempt failed since such a limit formation is only in mathematical settings possible (infinitesimal calculus), where accurate repetitions unto infinity may be made. ML:IV-9 Statistical Learning STEIN

10 Axiomatic Concept Formation The principle steps of axiomatic concept formation: 1. Postulate a function that assigns a probability to each element of the event space. 2. Specify the basic, required properties of this function in the form of axioms. ML:IV-10 Statistical Learning STEIN

11 Axiomatic Concept Formation The principle steps of axiomatic concept formation: 1. Postulate a function that assigns a probability to each element of the event space. 2. Specify the basic, required properties of this function in the form of axioms. Definition 5 (Probability Measure [Kolmogorov 1933]) Let Ω be a set, called sample space, and let P(Ω) be the set of all events, called event space. Then a function P : P(Ω) R that maps each event A P(Ω) onto a real number P (A) is called probability measure, if it has the following properties: 1. P (A) 0 (Axiom I) 2. P (Ω) = 1 (Axiom II) 3. A B = implies P (A B) = P (A) + P (B) (Axiom III) ML:IV-11 Statistical Learning STEIN

12 Axiomatic Concept Formation (continued) Definition 6 (Probability Space) Let Ω be a sample space, let P(Ω) be an event space, and let P : P(Ω) R be a probability measure. Then the tuple (Ω, P ), as well as the triple (Ω, P(Ω), P ), is called probability space. ML:IV-12 Statistical Learning STEIN

13 Axiomatic Concept Formation (continued) Definition 6 (Probability Space) Let Ω be a sample space, let P(Ω) be an event space, and let P : P(Ω) R be a probability measure. Then the tuple (Ω, P ), as well as the triple (Ω, P(Ω), P ), is called probability space. Theorem 7 (Implications of Kolmogorov Axioms) 1. P (A) + P (A) = 1 (from Axioms II, III) 2. P ( ) = 0 (from 1. with A = Ω) 3. Monotonicity law of the probability measure: A B P (A) P (B) (from Axioms I, II) 4. P (A B) = P (A) + P (B) P (A B) (from Axiom III) 5. Let A 1, A 2..., A k be mutually exclusive (incompatible), then holds: P (A 1 A 2... A k ) = P (A 1 ) + P (A 2 ) P (A k ) ML:IV-13 Statistical Learning STEIN

14 Remarks: The three axioms are also called the axiom system of Kolmogorov. P (A) is denoted as the probability of the occurrence of A Nothing is said about the distribution of the probabilities P. Generally, a function that is equipped with the three properties of a probability measure is called a non-negative, normalized, and additive measure. ML:IV-14 Statistical Learning STEIN

15 Conditional Probability Definition 8 (Conditional Probability) Let (Ω, P(Ω), P ) be a probability space and let A, B P(Ω) two events. Then the probability of the occurrence of event A given that event B is known to have occurred is defined as follows: P (A B) P (A B) =, if P (B) > 0 P (B) P (A B) is called probability of A under condition B. ML:IV-15 Statistical Learning STEIN

16 Conditional Probability (continued) Theorem 9 (Total Probability) Let (Ω, P(Ω), P ) be a probability space, and let A 1,..., A k be mutually exclusive events with Ω = A 1... A k, P (A i ) > 0, i = 1,..., k. Then for an B P(Ω) holds: P (B) = k P (A i ) P (B A i ) i=1 ML:IV-16 Statistical Learning STEIN

17 Conditional Probability (continued) Theorem 9 (Total Probability) Let (Ω, P(Ω), P ) be a probability space, and let A 1,..., A k be mutually exclusive events with Ω = A 1... A k, P (A i ) > 0, i = 1,..., k. Then for an B P(Ω) holds: P (B) = k P (A i ) P (B A i ) i=1 Proof P (B) = P (Ω B) = P ((A 1... A k ) B) = P ((A 1 B)... (A k B)) k = P (A i B) i=1 k = P (B A i ) = i=1 i=1 k P (A i ) P (B A i ) ML:IV-17 Statistical Learning STEIN

18 Remarks: The theorem of total probability states that the probability of an event equals the sum of the probabilities of the sub-events into which the event has been partitioned. Considered as a function in parameter A and constant B, the conditional probability P (A B) fulfills the Kolmogorov axioms and defines also a probability measure, denoted as P B here. Important consequences (deductions) from the conditional probability definition: 1. P (A B) = P (B) P (A B) (see multiplication rule in Definition 10) 2. P (A B) = P (B A) = P (A) P (B A) 3. P (B) P (A B) = P (A) P (B A) P (A B) = P (A B) P (B) = P (A) P (B A) P (B) 4. P (A B) = 1 P (A B) Usually, the following inequality must be assumed: P (A B) 1 P (A B). ML:IV-18 Statistical Learning STEIN

19 Independence of Events Definition 10 (Statistical Independence of two Events) Let (Ω, P(Ω), P ) be a probability space, and let A, B P(Ω) be two events. Then A and B are called statistically independent iff the following equation holds: P (A B) = P (A) P (B) multiplication rule If statistical independence is given and the two inequalities 0 < P (B) < 1 are fulfilled, the following equivalences hold: P (A B) = P (A) P (B) P (A B) = P (A B) P (A B) = P (A) ML:IV-19 Statistical Learning STEIN

20 Independence of Events (continued) Definition 11 (Statistical Independence of k Events) Let (Ω, P(Ω), P ) be a probability space, and let A 1,..., A k P(Ω) be events. Then the A 1,..., A k are called jointly statistically independent at P iff for all subsets {A i1,..., A il } {A 1,..., A k } the multiplication rule holds: where i 1 < i 2 <... < i l and 2 l k. P (A i1... A il ) = P (A i1 )... P (A il ), ML:IV-20 Statistical Learning STEIN

P (A) = lim P (A) = N(A)/N,

1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or non-deterministic experiments. Suppose an experiment can be repeated any number of times, so that we

E3: PROBABILITY AND STATISTICS lecture notes

E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................

Statistics in Geophysics: Introduction and Probability Theory

Statistics in Geophysics: Introduction and Steffen Unkel Department of Statistics Ludwig-Maximilians-University Munich, Germany Winter Term 2013/14 1/32 What is Statistics? Introduction Statistics is the

Probability and statistics; Rehearsal for pattern recognition

Probability and statistics; Rehearsal for pattern recognition Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering, Department of Cybernetics Center for Machine Perception

Probability - Part I. Definition : A random experiment is an experiment or a process for which the outcome cannot be predicted with certainty.

Probability - Part I Definition : A random experiment is an experiment or a process for which the outcome cannot be predicted with certainty. Definition : The sample space (denoted S) of a random experiment

Is quantum mechanics compatible with a deterministic universe? Two interpretations of quantum probabilities *

Is quantum mechanics compatible with a deterministic universe? Two interpretations of quantum probabilities * László E. Szabó Center for Philosophy of Science University of Pittsburgh and Institute for

Elements of probability theory

2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted

MATHEMATICAL METHODS OF STATISTICS

MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS

Introduction to probability theory in the Discrete Mathematics course

Introduction to probability theory in the Discrete Mathematics course Jiří Matoušek (KAM MFF UK) Version: Oct/18/2013 Introduction This detailed syllabus contains definitions, statements of the main results

CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let

Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as

Fuzzy Probability Distributions in Bayesian Analysis

Fuzzy Probability Distributions in Bayesian Analysis Reinhard Viertl and Owat Sunanta Department of Statistics and Probability Theory Vienna University of Technology, Vienna, Austria Corresponding author:

People have thought about, and defined, probability in different ways. important to note the consequences of the definition:

PROBABILITY AND LIKELIHOOD, A BRIEF INTRODUCTION IN SUPPORT OF A COURSE ON MOLECULAR EVOLUTION (BIOL 3046) Probability The subject of PROBABILITY is a branch of mathematics dedicated to building models

Probability Theory. Florian Herzog. A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T..

Probability Theory A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T.. Florian Herzog 2013 Probability space Probability space A probability space W is a unique triple W = {Ω, F,

Probabilities and Random Variables

Probabilities and Random Variables This is an elementary overview of the basic concepts of probability theory. 1 The Probability Space The purpose of probability theory is to model random experiments so

The "Dutch Book" argument, tracing back to independent work by. F.Ramsey (1926) and B.deFinetti (1937), offers prudential grounds for

The "Dutch Book" argument, tracing back to independent work by F.Ramsey (1926) and B.deFinetti (1937), offers prudential grounds for action in conformity with personal probability. Under several structural

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

Lecture 4: Probability Spaces

EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 4: Probability Spaces Lecturer: Dr. Krishna Jagannathan Scribe: Jainam Doshi, Arjun Nadh and Ajay M 4.1 Introduction

What Is Probability?

1 What Is Probability? The idea: Uncertainty can often be "quantified" i.e., we can talk about degrees of certainty or uncertainty. This is the idea of probability: a higher probability expresses a higher

Math/Stats 425 Introduction to Probability. 1. Uncertainty and the axioms of probability

Math/Stats 425 Introduction to Probability 1. Uncertainty and the axioms of probability Processes in the real world are random if outcomes cannot be predicted with certainty. Example: coin tossing, stock

Chapter 3: The basic concepts of probability

Chapter 3: The basic concepts of probability Experiment: a measurement process that produces quantifiable results (e.g. throwing two dice, dealing cards, at poker, measuring heights of people, recording

The Basics of Graphical Models

The Basics of Graphical Models David M. Blei Columbia University October 3, 2015 Introduction These notes follow Chapter 2 of An Introduction to Probabilistic Graphical Models by Michael Jordan. Many figures

Nonparametric adaptive age replacement with a one-cycle criterion

Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk

Working Paper Series

RGEA Universidade de Vigo http://webs.uvigo.es/rgea Working Paper Series A Market Game Approach to Differential Information Economies Guadalupe Fugarolas, Carlos Hervés-Beloso, Emma Moreno- García and

Elements of probability theory

The role of probability theory in statistics We collect data so as to provide evidentiary support for answers we give to our many questions about the world (and in our particular case, about the business

Mathematics (MAT) MAT 061 Basic Euclidean Geometry 3 Hours. MAT 051 Pre-Algebra 4 Hours

MAT 051 Pre-Algebra Mathematics (MAT) MAT 051 is designed as a review of the basic operations of arithmetic and an introduction to algebra. The student must earn a grade of C or in order to enroll in MAT

1 Short Introduction to Time Series

ECONOMICS 7344, Spring 202 Bent E. Sørensen January 24, 202 Short Introduction to Time Series A time series is a collection of stochastic variables x,.., x t,.., x T indexed by an integer value t. The

Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

Chapter 4. Probability and Probability Distributions

Chapter 4. robability and robability Distributions Importance of Knowing robability To know whether a sample is not identical to the population from which it was selected, it is necessary to assess the

MATHEMATICS (CLASSES XI XII)

MATHEMATICS (CLASSES XI XII) General Guidelines (i) All concepts/identities must be illustrated by situational examples. (ii) The language of word problems must be clear, simple and unambiguous. (iii)

2.1 Sets, power sets. Cartesian Products.

Lecture 8 2.1 Sets, power sets. Cartesian Products. Set is an unordered collection of objects. - used to group objects together, - often the objects with similar properties This description of a set (without

Chapter 2: Systems of Linear Equations and Matrices:

At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,

IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION

IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION 1 WHAT IS STATISTICS? Statistics is a science of collecting data, organizing and describing it and drawing conclusions from it. That is, statistics

SETS, RELATIONS, AND FUNCTIONS

September 27, 2009 and notations Common Universal Subset and Power Set Cardinality Operations A set is a collection or group of objects or elements or members (Cantor 1895). the collection of the four

6 Scalar, Stochastic, Discrete Dynamic Systems

47 6 Scalar, Stochastic, Discrete Dynamic Systems Consider modeling a population of sand-hill cranes in year n by the first-order, deterministic recurrence equation y(n + 1) = Ry(n) where R = 1 + r = 1

CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails

12th International Congress on Insurance: Mathematics and Economics July 16-18, 2008 A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails XUEMIAO HAO (Based on a joint

1 Fixed Point Iteration and Contraction Mapping Theorem

1 Fixed Point Iteration and Contraction Mapping Theorem Notation: For two sets A,B we write A B iff x A = x B. So A A is true. Some people use the notation instead. 1.1 Introduction Consider a function

Polarization codes and the rate of polarization

Polarization codes and the rate of polarization Erdal Arıkan, Emre Telatar Bilkent U., EPFL Sept 10, 2008 Channel Polarization Given a binary input DMC W, i.i.d. uniformly distributed inputs (X 1,...,

Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

Foundations of Geometry 1: Points, Lines, Segments, Angles

Chapter 3 Foundations of Geometry 1: Points, Lines, Segments, Angles 3.1 An Introduction to Proof Syllogism: The abstract form is: 1. All A is B. 2. X is A 3. X is B Example: Let s think about an example.

Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh

Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem

Betting interpretations of probability

Betting interpretations of probability Glenn Shafer June 21, 2010 Third Workshop on Game-Theoretic Probability and Related Topics Royal Holloway, University of London 1 Outline 1. Probability began with

FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is

A Hajós type result on factoring finite abelian groups by subsets II

Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is

Wald s Identity. by Jeffery Hein. Dartmouth College, Math 100

Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,

Notes: Chapter 2 Section 2.2: Proof by Induction

Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case - S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example

GENERALIZED BANKRUPTCY PROBLEM

Alexander Karpov, Semyon Yurkov GENERALIZED BANKRUPTCY PROBLEM BASIC RESEARCH PROGRAM WORKING PAPERS SERIES: FINANCIAL ECONOMICS WP BRP 08/FE/2012 This Working Paper is an output of a research project

axiomatic vs naïve set theory

ED40 Discrete Structures in Computer Science 1: Sets Jörn W. Janneck, Dept. of Computer Science, Lund University axiomatic vs naïve set theory s Zermelo-Fraenkel Set Theory w/choice (ZFC) extensionality

Removing Partial Inconsistency in Valuation- Based Systems*

Removing Partial Inconsistency in Valuation- Based Systems* Luis M. de Campos and Serafín Moral Departamento de Ciencias de la Computación e I.A., Universidad de Granada, 18071 Granada, Spain This paper

Basic Probability Concepts

page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes

Statistics I for QBIC. Contents and Objectives. Chapters 1 7. Revised: August 2013

Statistics I for QBIC Text Book: Biostatistics, 10 th edition, by Daniel & Cross Contents and Objectives Chapters 1 7 Revised: August 2013 Chapter 1: Nature of Statistics (sections 1.1-1.6) Objectives

Sections 2.1, 2.2 and 2.4

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

Chapter 1 Axioms of Probability. Wen-Guey Tzeng Computer Science Department National Chiao University

Chapter 1 Axioms of Probability Wen-Guey Tzeng Computer Science Department National Chiao University Introduction Luca Paccioli(1445-1514), Studies of chances of events Niccolo Tartaglia(1499-1557) Girolamo

A Geometry of Oriented Curves *

ftp://ftp.informatik.uni-hamburg.de/pub/unihh/informatik/wsv/trorientedcurves.pdf A Geometry of Oriented Curves * Lars Kulik & Carola Eschenbach Report from the project 'Axiomatics of Spatial Concepts'

ROULETTE ODDS AND PROFITS. The Mathematics of Complex Bets. Cătălin Bărboianu

ROULETTE ODDS AND PROFITS The Mathematics of Complex Bets Cătălin Bărboianu 1 Cătălin Bărboianu PO Box 1 230 Craiova, Romania http://probability.infarom.ro INFAROM Publishing Pure and applied mathematics

Basic concepts in probability. Sue Gordon

Mathematics Learning Centre Basic concepts in probability Sue Gordon c 2005 University of Sydney Mathematics Learning Centre, University of Sydney 1 1 Set Notation You may omit this section if you are

6.3 Conditional Probability and Independence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

Institute of Actuaries of India Subject CT3 Probability and Mathematical Statistics

Institute of Actuaries of India Subject CT3 Probability and Mathematical Statistics For 2015 Examinations Aim The aim of the Probability and Mathematical Statistics subject is to provide a grounding in

On characterization of a class of convex operators for pricing insurance risks

On characterization of a class of convex operators for pricing insurance risks Marta Cardin Dept. of Applied Mathematics University of Venice e-mail: mcardin@unive.it Graziella Pacelli Dept. of of Social

Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski.

Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski. Fabienne Comte, Celine Duval, Valentine Genon-Catalot To cite this version: Fabienne

Lecture 1 Introduction Properties of Probability Methods of Enumeration Asrat Temesgen Stockholm University

Lecture 1 Introduction Properties of Probability Methods of Enumeration Asrat Temesgen Stockholm University 1 Chapter 1 Probability 1.1 Basic Concepts In the study of statistics, we consider experiments

Name. Final Exam, Economics 210A, December 2011 Here are some remarks to help you with answering the questions.

Name Final Exam, Economics 210A, December 2011 Here are some remarks to help you with answering the questions. Question 1. A firm has a production function F (x 1, x 2 ) = ( x 1 + x 2 ) 2. It is a price

How to build a probability-free casino

How to build a probability-free casino Adam Chalcraft CCR La Jolla dachalc@ccrwest.org Chris Freiling Cal State San Bernardino cfreilin@csusb.edu Randall Dougherty CCR La Jolla rdough@ccrwest.org Jason

Two-Sided Matching Theory

Two-Sided Matching Theory M. Utku Ünver Boston College Introduction to the Theory of Two-Sided Matching To see which results are robust, we will look at some increasingly general models. Even before we

Summary of Probability

Summary of Probability Mathematical Physics I Rules of Probability The probability of an event is called P(A), which is a positive number less than or equal to 1. The total probability for all possible

If, under a given assumption, the of a particular observed is extremely. , we conclude that the is probably not

4.1 REVIEW AND PREVIEW RARE EVENT RULE FOR INFERENTIAL STATISTICS If, under a given assumption, the of a particular observed is extremely, we conclude that the is probably not. 4.2 BASIC CONCEPTS OF PROBABILITY

3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

Fairfield Public Schools

Mathematics Fairfield Public Schools AP Statistics AP Statistics BOE Approved 04/08/2014 1 AP STATISTICS Critical Areas of Focus AP Statistics is a rigorous course that offers advanced students an opportunity

2.1 The Algebra of Sets

Chapter 2 Abstract Algebra 83 part of abstract algebra, sets are fundamental to all areas of mathematics and we need to establish a precise language for sets. We also explore operations on sets and relations

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

Probability. 4.1 Sample Spaces

Probability 4.1 Sample Spaces For a random experiment E, the set of all possible outcomes of E is called the sample space and is denoted by the letter S. For the coin-toss experiment, S would be the results

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

Investigación Operativa. The uniform rule in the division problem

Boletín de Estadística e Investigación Operativa Vol. 27, No. 2, Junio 2011, pp. 102-112 Investigación Operativa The uniform rule in the division problem Gustavo Bergantiños Cid Dept. de Estadística e

Computing and Informatics, Vol. 20, 2001,????, V 2006-Nov-6 UPDATES OF LOGIC PROGRAMS Ján Šefránek Department of Applied Informatics, Faculty of Mathematics, Physics and Informatics, Comenius University,

Analyzing the Demand for Deductible Insurance

Journal of Risk and Uncertainty, 18:3 3 1999 1999 Kluwer Academic Publishers. Manufactured in The Netherlands. Analyzing the emand for eductible Insurance JACK MEYER epartment of Economics, Michigan State

Some Research Problems in Uncertainty Theory

Journal of Uncertain Systems Vol.3, No.1, pp.3-10, 2009 Online at: www.jus.org.uk Some Research Problems in Uncertainty Theory aoding Liu Uncertainty Theory Laboratory, Department of Mathematical Sciences

Summary Last Lecture. Automated Reasoning. Outline of the Lecture. Definition sequent calculus. Theorem (Normalisation and Strong Normalisation)

Summary Summary Last Lecture sequent calculus Automated Reasoning Georg Moser Institute of Computer Science @ UIBK Winter 013 (Normalisation and Strong Normalisation) let Π be a proof in minimal logic

Welcome to Stochastic Processes 1. Welcome to Aalborg University No. 1 of 31

Welcome to Stochastic Processes 1 Welcome to Aalborg University No. 1 of 31 Welcome to Aalborg University No. 2 of 31 Course Plan Part 1: Probability concepts, random variables and random processes Lecturer:

Math212a1010 Lebesgue measure.

Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.

An Introduction to Basic Statistics and Probability

An Introduction to Basic Statistics and Probability Shenek Heyward NCSU An Introduction to Basic Statistics and Probability p. 1/4 Outline Basic probability concepts Conditional probability Discrete Random

The result of the bayesian analysis is the probability distribution of every possible hypothesis H, given one real data set D. This prestatistical approach to our problem was the standard approach of Laplace

What is Linear Programming?

Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to

A set is a Many that allows itself to be thought of as a One. (Georg Cantor)

Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains

SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

1 Introduction to Option Pricing

ESTM 60202: Financial Mathematics Alex Himonas 03 Lecture Notes 1 October 7, 2009 1 Introduction to Option Pricing We begin by defining the needed finance terms. Stock is a certificate of ownership of

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

Chapter 4. Chapter 4. Probability. Probability

Chapter 4 Probability 1 4-1 Overview Chapter 4 Probability 4-2 Fundamentals 4-3 Addition Rule 4-4 Multiplication Rule: Basics 2 Objectives Overview develop sound understanding of probability values used

A Little Set Theory (Never Hurt Anybody)

A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

Chapter II. Controlling Cars on a Bridge

Chapter II. Controlling Cars on a Bridge 1 Introduction The intent of this chapter is to introduce a complete example of a small system development. During this development, you will be made aware of the