Application of Algebraic Statistics to Mark-Recapture Models with Misidentificaton

Size: px
Start display at page:

Download "Application of Algebraic Statistics to Mark-Recapture Models with Misidentificaton"

Transcription

1 Application of Algebraic Statistics to Mark-Recapture Models with Misidentificaton Dr. Simon Bonner 1, Dr. Matthew Schofield 2, Patrik Noren 3, and Dr. Ruriko Yoshida 1 1 Department of Statistics, University of Kentucky, USA 2 Department of Mathematics and Statistics, University of Otago, NZ 2 Institute of Science and Technology, AT simon.bonner@uky.edu Algebraic Statistics 2014 Illinois Institute of Technology

2 Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 2/22

3 Introduction to Mark-Recapture Setup Individuals are sampled from a population on T occasions. On each occasion: New individuals are marked Identities of marked individuals are recorded All individuals are returned to the population Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 3/22

4 Introduction to Mark-Recapture Setup Individuals are sampled from a population on T occasions. On each occasion: New individuals are marked Identities of marked individuals are recorded All individuals are returned to the population Raw Data ID History Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 3/22

5 Introduction to Mark-Recapture Setup Individuals are sampled from a population on T occasions. On each occasion: New individuals are marked Identities of marked individuals are recorded All individuals are returned to the population Raw Data ID History Summaries n n n n Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 3/22

6 Introduction to Mark-Recapture Setup Individuals are sampled from a population on T occasions. On each occasion: New individuals are marked Identities of marked individuals are recorded All individuals are returned to the population Raw Data ID History Summaries n n n n Model π(n θ) Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 3/22

7 Introduction to Mark-Recapture Setup Individuals are sampled from a population on T occasions. On each occasion: New individuals are marked Identities of marked individuals are recorded All individuals are returned to the population Raw Data ID History Summaries n n n n Model π(θ n) π(n θ)π(θ) Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 3/22

8 images.nationalgeographic.com/wpf/media-live/photos/000/007/cache/whale-shark_754_600x450.jpg Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 4/22

9 Mark-Recapture with Multiple Marks ID History 001 0L00R 002 L00L R LR0L. Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 5/22

10 Mark-Recapture with Multiple Marks ID History 001 0L00R 002 L00L R LR0L. ID(L/R) 001(L) 001(R) 002(L) 003(R) 004(L) 004(R) Obs. Hist. 0L R L00L0 00R00 0L00L 00R00. Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 5/22

11 Mark-Recapture with Multiple Marks Obs. Hist. 0L R L00L0 00R00 0L00L 00R00. Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 5/22

12 Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 6/22

13 Model M tα Model Assumptions 1 Individuals may be misidentified 2 Errors occur independently with probability α 3 All errors are unique True Observed Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 7/22

14 Connection with Algebraic Statistics Define: H obs : set of observable histories ( H obs = 2 T 1) H true : set of true histories and: n: observed counts of the histories in H obs x: latent counts of the true histories in H true Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 8/22

15 Connection with Algebraic Statistics Define: and: H obs : set of observable histories ( H obs = 2 T 1) H true : set of true histories n: observed counts of the histories in H obs x: latent counts of the true histories in H true Assume that there is a linear map: n = Ax Given a model π(x θ) we can make infernce about θ by sampling from the joint posterior distribution: π(x, θ n) = I (n = Ax)π(x θ)π(θ) Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 8/22

16 MCMC Algorithm of Link et al. (2010) Construct a basis for ker(a): b 1,..., b K. Define initial values x (0) s.t. n = Ax (0). On iteration j 1) Set x curr = x (j 1) 2) For k = 1, 2,...: i. Sample c k { D k,..., 1, 1,..., D k } and set: x prop = x curr + c k b k ii. Set x curr = x prop with probability: ( α = min 1, π(xprop θ) ) π(x prop θ) 3) Set x (j) = x curr. Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 9/22

17 MCMC Algorithm of Link et al. (2010) Construct a (lattice) basis for ker(a): b 1,..., b K. Define initial values x (0) s.t. n = Ax (0). On iteration j 1) Set x curr = x (j 1) 2) For k = 1, 2,...: i. Sample c k { D k,..., 1, 1,..., D k } and set: x prop = x curr + c k b k ii. Set x curr = x prop with probability: ( α = min 1, π(xprop θ) ) π(x prop θ) 3) Set x (j) = x curr. Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 9/22

18 MCMC Algorithm of Link et al. (2010) Theorem 1a: A Markov Basis for Multiple Marks There exists a lattice basis for the multiple marks model which is also a Markov basis. Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 10/22

19 MCMC Algorithm of Link et al. (2010) Theorem 1a: A Markov Basis for Multiple Marks There exists a lattice basis for the multiple marks model which is also a Markov basis. Theorem 1b: A Markov Basis for Model M tα There exists a lattice basis for model M tα which is also a Markov basis. Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 10/22

20 Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 11/22

21 Misidentification 2: Band Read Error Model Model Assumptions 1 Individuals may have false negative (2) or false positive (3) captures. 2 Errors may not occur on or before the individual is marked. 3 False negatives occur independently with probability α 4 False negatives and positives cannot co-occur True Observed Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 12/22

22 Misidentification 2: Band Read Error Model Computation MB with 4ti2 Occasions (T ) # Lattice Basis # Markov Basis ?????? Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 13/22

23 Misidentification 2: Band Read Error Model Theorem 2: A Markov basis for the BRE Model Let ω, ν H true such that: Define ω and µ such that: { ωs ωs s t = 2 s = t ω t = 0 and ν t = 1. and ν s = { νs s t 3 s = t Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 14/22

24 Misidentification 2: Band Read Error Model Theorem 2: A Markov basis for the BRE Model Let ω, ν H true such that: Define ω and µ such that: { ωs ωs s t = 2 s = t ω t = 0 and ν t = 1. and ν s = { νs s t 3 s = t A Markov basis, M, is formed by all moves of the form: x ω x ω 1 x ω x ω + 1 x ν x ν 1 x ν x ν + 1 and their invereses. Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 14/22

25 Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 15/22

26 Simple Corruptions We call an error in mark-recapture a simple corruption if it splits the true history for an individual into two or more observed histories. Examples: Multiple marks: Model M tα : 0LRL0 0L0L0, 00R , Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 16/22

27 Simple Corruptions We call an error in mark-recapture a simple corruption if it splits the true history for an individual into two or more observed histories. If all errors are simple corruptions then the configuration matrix has Hermite normal form (up to permuting the columns): H = [I A ]. where A contains only the values 0, 1. Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 16/22

28 General Result Theorem 1: General Result Suppose that the configuration matrix has Hermite normal form (up to permuting the columns): H = [I A ] where A contains only the values 0, 1. Then there exists a lattice basis which is a Markov basis. Proof A Markov basis is formed by the columns of: ( ) A I Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 17/22

29 Band Read Error Model: Continuing Work Theorem 3: Size of the Fiber Ignoring the constraints matching the number of false negatives and false positives we can compute size of the fiber generated by n. This provides and upper bound on the true fiber: F A,n ( ) nω + 2 fω 1 2 fω 1 where: ω H true f ω = T min{t ω t = 1}. Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 18/22

30 Band Read Error Model: Continuing Work Theorem 4: Connectivity of the Fiber Graph Suppose n ω 1 for all ω H obs. Then the fiber graph formed by the previously defined Markov basis, G(F A,n, M) has connectivity: κ(g(f A,n, M) = δ(g(f A,n, M) = T (2 2T 2 ) 2 T (2 T 1)+ (4T 1). 3 Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 19/22

31 Band Read Error Model: Continuing Work Conjecture 1 The Markov basis M is a Gröbner basis with some term order. Conjecture 2 The Markov basis M is a universal Gröbner basis. Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 20/22

32 Thank You! Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 21/22

33 References Bonner, S. J. and Holmberg, J. (2013). Mark-recapture with multiple non-invasive marks. Biometrics, 69(3): Link, W. a., Yoshizaki, J., Bailey, L. L., and Pollock, K. H. (2010). Uncovering a latent multinomial: Analysis of mark-recapture data with misidentification. Biometrics, 66(March): Wright, J. A., Barker, R. J., Schofield, M. R., Frantz, A. C., Byrom, A. E., and Gleeson, D. M. (2009). Incorporating genotype uncertainty into mark-recapture-type models for estimating abundance using DNA samples. Biometrics, 65(3): Yoshizaki, J., Brownie, C., Pollock, K. H., and Link, W. A. (2011). Modeling misidentification errors that result from use of genetic tags in capture-recapture studies. Environmental and Ecological Statistics, 18(1): Mark-Recapture and Misidentification Bonner, Schofield, Noren, and Yoshida 22/22

SUPPLEMENT TO EXTENDING THE LATENT MULTINOMIAL MODEL WITH COMPLEX ERROR PROCESSES AND DYNAMIC MARKOV BASES

SUPPLEMENT TO EXTENDING THE LATENT MULTINOMIAL MODEL WITH COMPLEX ERROR PROCESSES AND DYNAMIC MARKOV BASES SUPPLEMENT TO EXTENDING THE LATENT MULTINOMIAL MODEL WITH COMPLEX ERROR PROCESSES AND DYNAMIC MARKOV BASES By Simon J Bonner, Matthew R Schofield, Patrik Noren Steven J Price University of Western Ontario,

More information

Mark-recapture with identification errors

Mark-recapture with identification errors Mark-recapture with identification errors Richard Vale 16/07/14 1 Hard to estimate the size of an animal population. One popular method: markrecapture sampling 2 A population A sample, taken by a biologist

More information

Spatial Statistics with Image Analysis. Outline. A Statistical Approach. Johan Lindström 1. Lund October 6, 2016

Spatial Statistics with Image Analysis. Outline. A Statistical Approach. Johan Lindström 1. Lund October 6, 2016 Spatial Statistics Spatial Examples More Spatial Statistics with Image Analysis Johan Lindström 1 1 Mathematical Statistics Centre for Mathematical Sciences Lund University Lund October 6, 2016 Johan Lindström

More information

Review Article Putting Markov Chains Back into Markov Chain Monte Carlo

Review Article Putting Markov Chains Back into Markov Chain Monte Carlo Hindawi Publishing Corporation Journal of Applied Mathematics and Decision Sciences Volume 2007, Article ID 98086, 13 pages doi:10.1155/2007/98086 Review Article Putting Markov Chains Back into Markov

More information

Computer intensive statistical methods

Computer intensive statistical methods Lecture 13 MCMC, Hybrid chains October 13, 2015 Jonas Wallin jonwal@chalmers.se Chalmers, Gothenburg university MH algorithm, Chap:6.3 The metropolis hastings requires three objects, the distribution of

More information

Statistical Inference: Maximum Likelihood and Bayesian Approaches

Statistical Inference: Maximum Likelihood and Bayesian Approaches Statistical Inference: Maximum Likelihood and Bayesian Approaches Surya Tokdar From model to inference So a statistical analysis begins by setting up a model {f (x θ) : θ Θ} for data X. Next we observe

More information

STAT 499/962 Topics in Statistics Bayesian Inference and Decision Theory Jan 2018, Handout 01

STAT 499/962 Topics in Statistics Bayesian Inference and Decision Theory Jan 2018, Handout 01 STAT 499/962 Topics in Statistics Bayesian Inference and Decision Theory Jan 2018, Handout 01 Nasser Sadeghkhani a.sadeghkhani@queensu.ca There are two main schools to statistical inference: 1-frequentist

More information

VCMC: Variational Consensus Monte Carlo

VCMC: Variational Consensus Monte Carlo VCMC: Variational Consensus Monte Carlo Maxim Rabinovich, Elaine Angelino, Michael I. Jordan Berkeley Vision and Learning Center September 22, 2015 probabilistic models! sky fog bridge water grass object

More information

Markov basis for testing homogeneity of Markov chains

Markov basis for testing homogeneity of Markov chains Markov basis for testing homogeneity of Markov chains Akimichi Takemura and Hisayuki Hara University of Tokyo July 6, 2009 Takemura and Hara (Univ. of Tokyo) Testing homogeneity of Markov chains July 6,

More information

Fitting Narrow Emission Lines in X-ray Spectra

Fitting Narrow Emission Lines in X-ray Spectra Outline Fitting Narrow Emission Lines in X-ray Spectra Taeyoung Park Department of Statistics, University of Pittsburgh October 11, 2007 Outline of Presentation Outline This talk has three components:

More information

ESTIMATING POPULATION SIZE FROM DNA-BASED CLOSED CAPTURE RECAPTURE DATA INCORPORATING GENOTYPING ERROR

ESTIMATING POPULATION SIZE FROM DNA-BASED CLOSED CAPTURE RECAPTURE DATA INCORPORATING GENOTYPING ERROR Research Notes ESTIMATING POPULATION SIZE FROM DNA-BASED CLOSED CAPTURE RECAPTURE DATA INCORPORATING GENOTYPING ERROR PAUL M LUKACS, 1 Colorado Cooperative Fish and Wildlife Research Unit, Department of

More information

Continuous, Individual, Time-Dependent Covariates in the Cormack-Jolly-Seber Model

Continuous, Individual, Time-Dependent Covariates in the Cormack-Jolly-Seber Model Continuous, Individual, Time-Dependent Covariates in the Cormack-Jolly-Seber Model by Simon J. Bonner B.Sc. Hons., McGill University, 2001 a Project submitted in partial fulfillment of the requirements

More information

PHP 2510 Probability Part 3. Calculate probability by counting (cont ) Conditional probability. Law of total probability. Bayes Theorem.

PHP 2510 Probability Part 3. Calculate probability by counting (cont ) Conditional probability. Law of total probability. Bayes Theorem. PHP 2510 Probability Part 3 Calculate probability by counting (cont ) Conditional probability Law of total probability Bayes Theorem Independence PHP 2510 Sept 22, 2009 1 Last time... Count the number

More information

Computer intensive statistical methods Lecture 1

Computer intensive statistical methods Lecture 1 Computer intensive statistical methods Lecture 1 Jonas Wallin Chalmers, Gothenburg. Jonas Wallin - jonwal@chalmers.se 1/27 People and literature The following people are involved in the course: Function

More information

Distributed detection of topological changes in communication networks. Riccardo Lucchese, Damiano Varagnolo, Karl H. Johansson

Distributed detection of topological changes in communication networks. Riccardo Lucchese, Damiano Varagnolo, Karl H. Johansson 1 Distributed detection of topological changes in communication networks Riccardo Lucchese, Damiano Varagnolo, Karl H. Johansson Thanks to... 2 The need: detecting changes in topological networks 3 The

More information

STAT 536: Genetic Statistics

STAT 536: Genetic Statistics STAT 536: Genetic Statistics Tests for Hardy Weinberg Equilibrium Karin S. Dorman Department of Statistics Iowa State University September 7, 2006 Statistical Hypothesis Testing Identify a hypothesis,

More information

that bias in traditional population size estimators can be substantial because misidentification is ignored, and our new estimators perform well in

that bias in traditional population size estimators can be substantial because misidentification is ignored, and our new estimators perform well in Abstract YOSHIZAKI, JU. Use of atural Tags in Closed Population Capture-Recapture Studies: Modeling Misidentification. (Under the direction of Kenneth H. Pollock and icholas M. Haddad.) Estimates of demographic

More information

Improving the Computational Efficiency in Bayesian Fitting of Cormack-Jolly-Seber Models with Individual, Continuous, Time-Varying Covariates

Improving the Computational Efficiency in Bayesian Fitting of Cormack-Jolly-Seber Models with Individual, Continuous, Time-Varying Covariates University of Kentucky UKnowledge Theses and Dissertations--Statistics Statistics 2017 Improving the Computational Efficiency in Bayesian Fitting of Cormack-Jolly-Seber Models with Individual, Continuous,

More information

Marginal Specifications and a Gaussian Copula Estimation

Marginal Specifications and a Gaussian Copula Estimation Marginal Specifications and a Gaussian Copula Estimation Kazim Azam Abstract Multivariate analysis involving random variables of different type like count, continuous or mixture of both is frequently required

More information

A review of Continuous Time MC STA 624, Spring 2015

A review of Continuous Time MC STA 624, Spring 2015 A review of Continuous Time MC STA 624, Spring 2015 Ruriko Yoshida Dept. of Statistics University of Kentucky polytopes.net STA 624 1 Continuous Time Markov chains Definition A continuous time stochastic

More information

Computer intensive statistical methods

Computer intensive statistical methods Lecture 11 Markov Chain Monte Carlo cont. October 6, 2015 Jonas Wallin jonwal@chalmers.se Chalmers, Gothenburg university The two stage Gibbs sampler If the conditional distributions are easy to sample

More information

Topic Modelling and Latent Dirichlet Allocation

Topic Modelling and Latent Dirichlet Allocation Topic Modelling and Latent Dirichlet Allocation Stephen Clark (with thanks to Mark Gales for some of the slides) Lent 2013 Machine Learning for Language Processing: Lecture 7 MPhil in Advanced Computer

More information

BAYESIAN METHODS FOR VARIABLE SELECTION WITH APPLICATIONS TO HIGH-DIMENSIONAL DATA

BAYESIAN METHODS FOR VARIABLE SELECTION WITH APPLICATIONS TO HIGH-DIMENSIONAL DATA BAYESIAN METHODS FOR VARIABLE SELECTION WITH APPLICATIONS TO HIGH-DIMENSIONAL DATA Intro: Course Outline and Brief Intro to Marina Vannucci Rice University, USA PASI-CIMAT 04/28-30/2010 Marina Vannucci

More information

Bayesian Networks: Construction, Inference, Learning and Causal Interpretation. Volker Tresp Summer 2016

Bayesian Networks: Construction, Inference, Learning and Causal Interpretation. Volker Tresp Summer 2016 Bayesian Networks: Construction, Inference, Learning and Causal Interpretation Volker Tresp Summer 2016 1 Introduction So far we were mostly concerned with supervised learning: we predicted one or several

More information

MARKOV CHAIN MONTE CARLO

MARKOV CHAIN MONTE CARLO MARKOV CHAIN MONTE CARLO RYAN WANG Abstract. This paper gives a brief introduction to Markov Chain Monte Carlo methods, which offer a general framework for calculating difficult integrals. We start with

More information

Capture-recapture experiments

Capture-recapture experiments 4 Inference in finite populations Binomial capture model Two-stage capture-recapture Open population Accept-Reject methods Arnason Schwarz s Model 236/459 Inference in finite populations Inference in finite

More information

Deblurring Jupiter (sampling in GLIP faster than regularized inversion) Colin Fox Richard A. Norton, J.

Deblurring Jupiter (sampling in GLIP faster than regularized inversion) Colin Fox Richard A. Norton, J. Deblurring Jupiter (sampling in GLIP faster than regularized inversion) Colin Fox fox@physics.otago.ac.nz Richard A. Norton, J. Andrés Christen Topics... Backstory (?) Sampling in linear-gaussian hierarchical

More information

Stat 535 C - Statistical Computing & Monte Carlo Methods. Lecture 18-16th March Arnaud Doucet

Stat 535 C - Statistical Computing & Monte Carlo Methods. Lecture 18-16th March Arnaud Doucet Stat 535 C - Statistical Computing & Monte Carlo Methods Lecture 18-16th March 2006 Arnaud Doucet Email: arnaud@cs.ubc.ca 1 1.1 Outline Trans-dimensional Markov chain Monte Carlo. Bayesian model for autoregressions.

More information

Reminder of some Markov Chain properties:

Reminder of some Markov Chain properties: Reminder of some Markov Chain properties: 1. a transition from one state to another occurs probabilistically 2. only state that matters is where you currently are (i.e. given present, future is independent

More information

Infering the Number of State Clusters in Hidden Markov Model and its Extension

Infering the Number of State Clusters in Hidden Markov Model and its Extension Infering the Number of State Clusters in Hidden Markov Model and its Extension Xugang Ye Department of Applied Mathematics and Statistics, Johns Hopkins University Elements of a Hidden Markov Model (HMM)

More information

Introduction to Bayesian methods in inverse problems

Introduction to Bayesian methods in inverse problems Introduction to Bayesian methods in inverse problems Ville Kolehmainen 1 1 Department of Applied Physics, University of Eastern Finland, Kuopio, Finland March 4 2013 Manchester, UK. Contents Introduction

More information

Continuous Covariates in Mark-Recapture-Recovery Analysis: A Comparison. of Methods

Continuous Covariates in Mark-Recapture-Recovery Analysis: A Comparison. of Methods Biometrics 000, 000 000 DOI: 000 000 0000 Continuous Covariates in Mark-Recapture-Recovery Analysis: A Comparison of Methods Simon J. Bonner 1, Byron J. T. Morgan 2, and Ruth King 3 1 Department of Statistics,

More information

Partial factor modeling: predictor-dependent shrinkage for linear regression

Partial factor modeling: predictor-dependent shrinkage for linear regression modeling: predictor-dependent shrinkage for linear Richard Hahn, Carlos Carvalho and Sayan Mukherjee JASA 2013 Review by Esther Salazar Duke University December, 2013 Factor framework The factor framework

More information

Markov bases and subbases for bounded contingency tables

Markov bases and subbases for bounded contingency tables Markov bases and subbases for bounded contingency tables arxiv:0905.4841v2 [math.co] 23 Jun 2009 Fabio Rapallo Abstract Ruriko Yoshida In this paper we study the computation of Markov bases for contingency

More information

Fitting Narrow Emission Lines in X-ray Spectra

Fitting Narrow Emission Lines in X-ray Spectra Fitting Narrow Emission Lines in X-ray Spectra Taeyoung Park Department of Statistics, Harvard University October 25, 2005 X-ray Spectrum Data Description Statistical Model for the Spectrum Quasars are

More information

Decomposable Graphical Gaussian Models

Decomposable Graphical Gaussian Models CIMPA Summerschool, Hammamet 2011, Tunisia September 12, 2011 Basic algorithm This simple algorithm has complexity O( V + E ): 1. Choose v 0 V arbitrary and let v 0 = 1; 2. When vertices {1, 2,..., j}

More information

Basic math for biology

Basic math for biology Basic math for biology Lei Li Florida State University, Feb 6, 2002 The EM algorithm: setup Parametric models: {P θ }. Data: full data (Y, X); partial data Y. Missing data: X. Likelihood and maximum likelihood

More information

Finite mixture models in secr 3.0 Murray Efford

Finite mixture models in secr 3.0 Murray Efford Finite mixture models in secr 3.0 Murray Efford 2017-04-05 Contents Implementation in secr 1 Number of classes 3 Multimodality 3 Hybrid hcov model 5 Notes 5 References 5 Appendix. SECR finite mixture model

More information

Integrating mark-resight, count, and photograph data to more effectively monitor non-breeding American oystercatcher populations

Integrating mark-resight, count, and photograph data to more effectively monitor non-breeding American oystercatcher populations Integrating mark-resight, count, and photograph data to more effectively monitor non-breeding American oystercatcher populations Gibson, Daniel, Thomas V. Riecke, Tim Keyes, Chris Depkin, Jim Fraser, and

More information

Bayesian statistics, simulation and software

Bayesian statistics, simulation and software Module 10: Bayesian prediction and model checking Department of Mathematical Sciences Aalborg University 1/15 Prior predictions Suppose we want to predict future data x without observing any data x. Assume:

More information

Bayesian philosophy Bayesian computation Bayesian software. Bayesian Statistics. Petter Mostad. Chalmers. April 6, 2017

Bayesian philosophy Bayesian computation Bayesian software. Bayesian Statistics. Petter Mostad. Chalmers. April 6, 2017 Chalmers April 6, 2017 Bayesian philosophy Bayesian philosophy Bayesian statistics versus classical statistics: War or co-existence? Classical statistics: Models have variables and parameters; these are

More information

Analyzing the genetic structure of populations: a Bayesian approach

Analyzing the genetic structure of populations: a Bayesian approach Analyzing the genetic structure of populations: a Bayesian approach Introduction Our review of Nei s G st and Weir and Cockerham s θ illustrated two important principles: 1. It s essential to distinguish

More information

Bayesian spatial hierarchical modeling for temperature extremes

Bayesian spatial hierarchical modeling for temperature extremes Bayesian spatial hierarchical modeling for temperature extremes Indriati Bisono Dr. Andrew Robinson Dr. Aloke Phatak Mathematics and Statistics Department The University of Melbourne Maths, Informatics

More information

BTRY 4830/6830: Quantitative Genomics and Genetics Fall 2014

BTRY 4830/6830: Quantitative Genomics and Genetics Fall 2014 BTRY 4830/6830: Quantitative Genomics and Genetics Fall 2014 Homework 4 (version 3) - posted October 3 Assigned October 2; Due 11:59PM October 9 Problem 1 (Easy) a. For the genetic regression model: Y

More information

Topic Models. Brandon Malone. February 20, Latent Dirichlet Allocation Success Stories Wrap-up

Topic Models. Brandon Malone. February 20, Latent Dirichlet Allocation Success Stories Wrap-up Much of this material is adapted from Blei 2003. Many of the images were taken from the Internet February 20, 2014 Suppose we have a large number of books. Each is about several unknown topics. How can

More information

BIOINFORMATICS. Gilles Guillot

BIOINFORMATICS. Gilles Guillot BIOINFORMATICS Vol. 00 no. 00 2008 Pages 1 19 Supplementary material for: Inference of structure in subdivided populations at low levels of genetic differentiation. The correlated allele frequencies model

More information

STA 414/2104: Machine Learning

STA 414/2104: Machine Learning STA 414/2104: Machine Learning Russ Salakhutdinov Department of Computer Science! Department of Statistics! rsalakhu@cs.toronto.edu! http://www.cs.toronto.edu/~rsalakhu/ Lecture 9 Sequential Data So far

More information

Linear Dynamical Systems

Linear Dynamical Systems Linear Dynamical Systems Sargur N. srihari@cedar.buffalo.edu Machine Learning Course: http://www.cedar.buffalo.edu/~srihari/cse574/index.html Two Models Described by Same Graph Latent variables Observations

More information

TEORIA BAYESIANA Ralph S. Silva

TEORIA BAYESIANA Ralph S. Silva TEORIA BAYESIANA Ralph S. Silva Departamento de Métodos Estatísticos Instituto de Matemática Universidade Federal do Rio de Janeiro Sumário Numerical Integration Polynomial quadrature is intended to approximate

More information

Bayesian Networks: Construction, Inference, Learning and Causal Interpretation. Volker Tresp Summer 2014

Bayesian Networks: Construction, Inference, Learning and Causal Interpretation. Volker Tresp Summer 2014 Bayesian Networks: Construction, Inference, Learning and Causal Interpretation Volker Tresp Summer 2014 1 Introduction So far we were mostly concerned with supervised learning: we predicted one or several

More information

Recall that the AR(p) model is defined by the equation

Recall that the AR(p) model is defined by the equation Estimation of AR models Recall that the AR(p) model is defined by the equation X t = p φ j X t j + ɛ t j=1 where ɛ t are assumed independent and following a N(0, σ 2 ) distribution. Assume p is known and

More information

Tutorial on ABC Algorithms

Tutorial on ABC Algorithms Tutorial on ABC Algorithms Dr Chris Drovandi Queensland University of Technology, Australia c.drovandi@qut.edu.au July 3, 2014 Notation Model parameter θ with prior π(θ) Likelihood is f(ý θ) with observed

More information

STA 4273H: Statistical Machine Learning

STA 4273H: Statistical Machine Learning STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Statistics! rsalakhu@utstat.toronto.edu! http://www.utstat.utoronto.ca/~rsalakhu/ Sidney Smith Hall, Room 6002 Lecture 11 Project

More information

Monte Carlo Techniques for Regressing Random Variables. Dan Pemstein. Using V-Dem the Right Way

Monte Carlo Techniques for Regressing Random Variables. Dan Pemstein. Using V-Dem the Right Way : Monte Carlo Techniques for Regressing Random Variables Workshop Goals (Re)familiarize you with Monte Carlo methods for estimating functions of random variables, integrating/marginalizing (Re)familiarize

More information

Mixture models. Mixture models MCMC approaches Label switching MCMC for variable dimension models. 5 Mixture models

Mixture models. Mixture models MCMC approaches Label switching MCMC for variable dimension models. 5 Mixture models 5 MCMC approaches Label switching MCMC for variable dimension models 291/459 Missing variable models Complexity of a model may originate from the fact that some piece of information is missing Example

More information

Supporting information for Demographic history and rare allele sharing among human populations.

Supporting information for Demographic history and rare allele sharing among human populations. Supporting information for Demographic history and rare allele sharing among human populations. Simon Gravel, Brenna M. Henn, Ryan N. Gutenkunst, mit R. Indap, Gabor T. Marth, ndrew G. Clark, The 1 Genomes

More information

Bayesian inference for stochastic differential mixed effects models - initial steps

Bayesian inference for stochastic differential mixed effects models - initial steps Bayesian inference for stochastic differential ixed effects odels - initial steps Gavin Whitaker 2nd May 2012 Supervisors: RJB and AG Outline Mixed Effects Stochastic Differential Equations (SDEs) Bayesian

More information

Monte Carlo Dynamically Weighted Importance Sampling for Spatial Models with Intractable Normalizing Constants

Monte Carlo Dynamically Weighted Importance Sampling for Spatial Models with Intractable Normalizing Constants Monte Carlo Dynamically Weighted Importance Sampling for Spatial Models with Intractable Normalizing Constants Faming Liang Texas A& University Sooyoung Cheon Korea University Spatial Model Introduction

More information

Bayesian Estimation of log N log S

Bayesian Estimation of log N log S Bayesian Estimation of log N log S Paul Baines, Irina Udaltsova Department of Statistics University of California, Davis July 12th, 2011 Introduction What is log N log S? Cumulative number of sources detectable

More information

Stat 534 Philip Dixon Fall References: Estimating Population Parameters: Closed and Open populations

Stat 534 Philip Dixon Fall References: Estimating Population Parameters: Closed and Open populations Stat 534 Philip Dixon Fall 2017 References: Estimating Population Parameters: Closed and Open populations Population Biology: Vandermeer, J.H. and Goldberg, D.E. 2013. Population Ecology: First Principles.

More information

Different points of view for selecting a latent structure model

Different points of view for selecting a latent structure model Different points of view for selecting a latent structure model Gilles Celeux Inria Saclay-Île-de-France, Université Paris-Sud Latent structure models: two different point of views Density estimation LSM

More information

Bayesian Asymptotics

Bayesian Asymptotics BS2 Statistical Inference, Lecture 8, Hilary Term 2008 May 7, 2008 The univariate case The multivariate case For large λ we have the approximation I = b a e λg(y) h(y) dy = e λg(y ) h(y ) 2π λg (y ) {

More information

Bayesian Inference for Discretely Sampled Diffusion Processes: A New MCMC Based Approach to Inference

Bayesian Inference for Discretely Sampled Diffusion Processes: A New MCMC Based Approach to Inference Bayesian Inference for Discretely Sampled Diffusion Processes: A New MCMC Based Approach to Inference Osnat Stramer 1 and Matthew Bognar 1 Department of Statistics and Actuarial Science, University of

More information

A = {(x, u) : 0 u f(x)},

A = {(x, u) : 0 u f(x)}, Draw x uniformly from the region {x : f(x) u }. Markov Chain Monte Carlo Lecture 5 Slice sampler: Suppose that one is interested in sampling from a density f(x), x X. Recall that sampling x f(x) is equivalent

More information

On a perturbation method for determining group of invariance of hierarchical models

On a perturbation method for determining group of invariance of hierarchical models .... On a perturbation method for determining group of invariance of hierarchical models Tomonari SEI 1 Satoshi AOKI 2 Akimichi TAKEMURA 1 1 University of Tokyo 2 Kagoshima University Dec. 16, 2008 T.

More information

Quantifying Fingerprint Evidence using Bayesian Alignment

Quantifying Fingerprint Evidence using Bayesian Alignment Quantifying Fingerprint Evidence using Bayesian Alignment Peter Forbes Joint work with Steffen Lauritzen and Jesper Møller Department of Statistics University of Oxford UCL CSML Lunch Talk 14 February

More information

Cormack-Jolly-Seber Models

Cormack-Jolly-Seber Models Cormack-Jolly-Seber Models Estimating Apparent Survival from Mark-Resight Data & Open-Population Models Ch. 17 of WNC, especially sections 17.1 & 17.2 For these models, animals are captured on k occasions

More information

An Extension of the Cormack Jolly Seber Model for Continuous Covariates with Application to Microtus pennsylvanicus

An Extension of the Cormack Jolly Seber Model for Continuous Covariates with Application to Microtus pennsylvanicus Biometrics 62, 142 149 March 2006 DOI: 10.1111/j.1541-0420.2005.00399.x An Extension of the Cormack Jolly Seber Model for Continuous Covariates with Application to Microtus pennsylvanicus S. J. Bonner

More information

LECTURE 15 Markov chain Monte Carlo

LECTURE 15 Markov chain Monte Carlo LECTURE 15 Markov chain Monte Carlo There are many settings when posterior computation is a challenge in that one does not have a closed form expression for the posterior distribution. Markov chain Monte

More information

Assessing Regime Uncertainty Through Reversible Jump McMC

Assessing Regime Uncertainty Through Reversible Jump McMC Assessing Regime Uncertainty Through Reversible Jump McMC August 14, 2008 1 Introduction Background Research Question 2 The RJMcMC Method McMC RJMcMC Algorithm Dependent Proposals Independent Proposals

More information

New Insights into History Matching via Sequential Monte Carlo

New Insights into History Matching via Sequential Monte Carlo New Insights into History Matching via Sequential Monte Carlo Associate Professor Chris Drovandi School of Mathematical Sciences ARC Centre of Excellence for Mathematical and Statistical Frontiers (ACEMS)

More information

Introduction to Restricted Boltzmann Machines

Introduction to Restricted Boltzmann Machines Introduction to Restricted Boltzmann Machines Ilija Bogunovic and Edo Collins EPFL {ilija.bogunovic,edo.collins}@epfl.ch October 13, 2014 Introduction Ingredients: 1. Probabilistic graphical models (undirected,

More information

Modeling Environment

Modeling Environment Topic Model Modeling Environment What does it mean to understand/ your environment? Ability to predict Two approaches to ing environment of words and text Latent Semantic Analysis (LSA) Topic Model LSA

More information

Discrete & continuous characters: The threshold model

Discrete & continuous characters: The threshold model Discrete & continuous characters: The threshold model Discrete & continuous characters: the threshold model So far we have discussed continuous & discrete character models separately for estimating ancestral

More information

Accounting for Calibration Uncertainty in Spectral Analysis. David A. van Dyk

Accounting for Calibration Uncertainty in Spectral Analysis. David A. van Dyk Accounting for in Spectral Analysis David A van Dyk Statistics Section, Imperial College London Joint work with Vinay Kashyap, Jin Xu, Alanna Connors, and Aneta Siegminowska IACHEC March 2013 David A van

More information

Approximate Bayesian Computation: a simulation based approach to inference

Approximate Bayesian Computation: a simulation based approach to inference Approximate Bayesian Computation: a simulation based approach to inference Richard Wilkinson Simon Tavaré 2 Department of Probability and Statistics University of Sheffield 2 Department of Applied Mathematics

More information

ST 740: Multiparameter Inference

ST 740: Multiparameter Inference ST 740: Multiparameter Inference Alyson Wilson Department of Statistics North Carolina State University September 23, 2013 A. Wilson (NCSU Statistics) Multiparameter Inference September 23, 2013 1 / 21

More information

Lecture 8 Learning Sequence Motif Models Using Expectation Maximization (EM) Colin Dewey February 14, 2008

Lecture 8 Learning Sequence Motif Models Using Expectation Maximization (EM) Colin Dewey February 14, 2008 Lecture 8 Learning Sequence Motif Models Using Expectation Maximization (EM) Colin Dewey February 14, 2008 1 Sequence Motifs what is a sequence motif? a sequence pattern of biological significance typically

More information

Strassen-like algorithms for symmetric tensor contractions

Strassen-like algorithms for symmetric tensor contractions Strassen-lie algorithms for symmetric tensor contractions Edgar Solomoni University of Illinois at Urbana-Champaign Scientfic and Statistical Computing Seminar University of Chicago April 13, 2017 1 /

More information

Vanishing Ranges for the Cohomology of Finite Groups of Lie Type

Vanishing Ranges for the Cohomology of Finite Groups of Lie Type for the Cohomology of Finite Groups of Lie Type University of Wisconsin-Stout, University of Georgia, University of South Alabama The Problem k - algebraically closed field of characteristic p > 0 G -

More information

Directed Probabilistic Graphical Models CMSC 678 UMBC

Directed Probabilistic Graphical Models CMSC 678 UMBC Directed Probabilistic Graphical Models CMSC 678 UMBC Announcement 1: Assignment 3 Due Wednesday April 11 th, 11:59 AM Any questions? Announcement 2: Progress Report on Project Due Monday April 16 th,

More information

Dynamic models. Dependent data The AR(p) model The MA(q) model Hidden Markov models. 6 Dynamic models

Dynamic models. Dependent data The AR(p) model The MA(q) model Hidden Markov models. 6 Dynamic models 6 Dependent data The AR(p) model The MA(q) model Hidden Markov models Dependent data Dependent data Huge portion of real-life data involving dependent datapoints Example (Capture-recapture) capture histories

More information

Algebra II. A2.1.1 Recognize and graph various types of functions, including polynomial, rational, and algebraic functions.

Algebra II. A2.1.1 Recognize and graph various types of functions, including polynomial, rational, and algebraic functions. Standard 1: Relations and Functions Students graph relations and functions and find zeros. They use function notation and combine functions by composition. They interpret functions in given situations.

More information

Risk Estimation and Uncertainty Quantification by Markov Chain Monte Carlo Methods

Risk Estimation and Uncertainty Quantification by Markov Chain Monte Carlo Methods Risk Estimation and Uncertainty Quantification by Markov Chain Monte Carlo Methods Konstantin Zuev Institute for Risk and Uncertainty University of Liverpool http://www.liv.ac.uk/risk-and-uncertainty/staff/k-zuev/

More information

ComputationalToolsforComparing AsymmetricGARCHModelsviaBayes Factors. RicardoS.Ehlers

ComputationalToolsforComparing AsymmetricGARCHModelsviaBayes Factors. RicardoS.Ehlers ComputationalToolsforComparing AsymmetricGARCHModelsviaBayes Factors RicardoS.Ehlers Laboratório de Estatística e Geoinformação- UFPR http://leg.ufpr.br/ ehlers ehlers@leg.ufpr.br II Workshop on Statistical

More information

Bayesian Inference on Joint Mixture Models for Survival-Longitudinal Data with Multiple Features. Yangxin Huang

Bayesian Inference on Joint Mixture Models for Survival-Longitudinal Data with Multiple Features. Yangxin Huang Bayesian Inference on Joint Mixture Models for Survival-Longitudinal Data with Multiple Features Yangxin Huang Department of Epidemiology and Biostatistics, COPH, USF, Tampa, FL yhuang@health.usf.edu January

More information

Scaling Neighbourhood Methods

Scaling Neighbourhood Methods Quick Recap Scaling Neighbourhood Methods Collaborative Filtering m = #items n = #users Complexity : m * m * n Comparative Scale of Signals ~50 M users ~25 M items Explicit Ratings ~ O(1M) (1 per billion)

More information

Bayesian Estimation of log N log S

Bayesian Estimation of log N log S Bayesian Estimation of log N log S Paul D. Baines Department of Statistics University of California, Davis May 10th, 2013 Introduction Project Goals Develop a comprehensive method to infer (properties

More information

CSC 2541: Bayesian Methods for Machine Learning

CSC 2541: Bayesian Methods for Machine Learning CSC 2541: Bayesian Methods for Machine Learning Radford M. Neal, University of Toronto, 2011 Lecture 4 Problem: Density Estimation We have observed data, y 1,..., y n, drawn independently from some unknown

More information

Markov Chain Monte Carlo, Numerical Integration

Markov Chain Monte Carlo, Numerical Integration Markov Chain Monte Carlo, Numerical Integration (See Statistics) Trevor Gallen Fall 2015 1 / 1 Agenda Numerical Integration: MCMC methods Estimating Markov Chains Estimating latent variables 2 / 1 Numerical

More information

Probabilistic Graphical Networks: Definitions and Basic Results

Probabilistic Graphical Networks: Definitions and Basic Results This document gives a cursory overview of Probabilistic Graphical Networks. The material has been gleaned from different sources. I make no claim to original authorship of this material. Bayesian Graphical

More information

CSC 2541: Bayesian Methods for Machine Learning

CSC 2541: Bayesian Methods for Machine Learning CSC 2541: Bayesian Methods for Machine Learning Radford M. Neal, University of Toronto, 2011 Lecture 3 More Markov Chain Monte Carlo Methods The Metropolis algorithm isn t the only way to do MCMC. We ll

More information

INTRODUCTION TO MCMC AND PAGERANK. Eric Vigoda Georgia Tech. Lecture for CS 6505

INTRODUCTION TO MCMC AND PAGERANK. Eric Vigoda Georgia Tech. Lecture for CS 6505 INTRODUCTION TO MCMC AND PAGERANK Eric Vigoda Georgia Tech Lecture for CS 6505 1 MARKOV CHAIN BASICS 2 ERGODICITY 3 WHAT IS THE STATIONARY DISTRIBUTION? 4 PAGERANK 5 MIXING TIME 6 PREVIEW OF FURTHER TOPICS

More information

Theory of Stochastic Processes 8. Markov chain Monte Carlo

Theory of Stochastic Processes 8. Markov chain Monte Carlo Theory of Stochastic Processes 8. Markov chain Monte Carlo Tomonari Sei sei@mist.i.u-tokyo.ac.jp Department of Mathematical Informatics, University of Tokyo June 8, 2017 http://www.stat.t.u-tokyo.ac.jp/~sei/lec.html

More information

Robust Principal Component Analysis

Robust Principal Component Analysis ELE 538B: Mathematics of High-Dimensional Data Robust Principal Component Analysis Yuxin Chen Princeton University, Fall 2018 Disentangling sparse and low-rank matrices Suppose we are given a matrix M

More information

Algebraic Generation of Orthogonal Fractional Factorial Designs

Algebraic Generation of Orthogonal Fractional Factorial Designs Algebraic Generation of Orthogonal Fractional Factorial Designs Roberto Fontana Dipartimento di Matematica, Politecnico di Torino Special Session on Advances in Algebraic Statistics AMS 2010 Spring Southeastern

More information

Machine Learning, Midterm Exam: Spring 2009 SOLUTION

Machine Learning, Midterm Exam: Spring 2009 SOLUTION 10-601 Machine Learning, Midterm Exam: Spring 2009 SOLUTION March 4, 2009 Please put your name at the top of the table below. If you need more room to work out your answer to a question, use the back of

More information

Bayesian Model Comparison

Bayesian Model Comparison BS2 Statistical Inference, Lecture 11, Hilary Term 2009 February 26, 2009 Basic result An accurate approximation Asymptotic posterior distribution An integral of form I = b a e λg(y) h(y) dy where h(y)

More information

Ergodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.

Ergodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R. Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions

More information

Machine learning: Hypothesis testing. Anders Hildeman

Machine learning: Hypothesis testing. Anders Hildeman Location of trees 0 Observed trees 50 100 150 200 250 300 350 400 450 500 0 100 200 300 400 500 600 700 800 900 1000 Figur: Observed points pattern of the tree specie Beilschmiedia pendula. Location of

More information