JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for ALLSTAT Archives


ALLSTAT Archives

ALLSTAT Archives


allstat@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

ALLSTAT Home

ALLSTAT Home

ALLSTAT  April 2010

ALLSTAT April 2010

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

biostatistics seminars at the University of Limerick

From:

"David.Ramsey" <[log in to unmask]>

Reply-To:

David.Ramsey

Date:

Fri, 16 Apr 2010 08:47:34 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (163 lines)

The BIO-SI project, based in Limerick and Galway, invites you to the following seminars to take place as follows:

 

Friday, May 7th, 2-pm

ROOM CG054, MAIN BUILDING

UNIVERSITY OF LIMERICK

 

2pm Chris Cannings (University of Sheffield) The Coalescent

3pm Florian Frommlet (University of Vienna) Asymptotic optimality properties of multiple testing and model selection procedures under sparsity

 

The abstracts are given below

 

The Coalescent

Chris Cannings,

School of Mathematics and Statistics, 

University of Sheffield

 

The Wright-Fisher model of "genetic drift" considers a population of

šfixed size N, with non-overlapping generations. Each individual in the

š population at time t+1 is the offspring of any particular individual in the population

šš at time t with probability 1/N, (mutually) independently of the parentage of other

šš individuals. It is possible in this and in a wider class of

šš models (Cannings,1974) to specify the eigenvalues and

šš eigenvectors in a fairly full fashion and thus to study various

šš aspects of the process.

 

šKingman(1982) introduced a major insight

šš for the study of such processes, the Coalescent. Instead of

šš looking at whole generations with time running forward the

šš coalescent runs time backward. Since the number of individuals in

šš generation t who are actually, rather than potentially, parents of some set of k

šš individuals in generation t+1, is ˜ k (with non-zero probability for

šš <k), the ancestry of any set of individuals is a tree running

šš backwards in time to a MRCA (most recent common ancestor of the

šš set). This is the coalescent, and the study of the genetic drift process

šš reduces to the study of this tree.

 

A brief survey of some of the features of this process will include

the probabilities of various tree topologies, and the time to the

MRCA. 

 

The coalescent approach will then be used to tackle two problems.

 

(1) Suppose that individuals have a type specified by an integer,

and that a parent of type x produces an offspring of type x-1,

x or x+1 with probabilities u/2, 1-u and u/2. We

wish to specify aspects of the distribution of the types in the

population at some time n. This model correspond to genetic

situations in which an individual has some number of copies of a

genetic unit, and that due to errors in the copying process required

for producing an offspring, that offspring may have a slightly

different number of copies. We derive certain results for the moments of

šthis and a related normalised process.

 

(2) The branch from an individual backwards in time to the

coalescent tree is called an external edge. Some results regarding

the lengths of such edges will be derived.

 

 

š Malgorzata Bogdan, Arijit Chakrabarti, Florian Frommlet,š Jayanta K. Ghosh

Asymptotic optimality properties of multiple testing and model selection procedures under sparsity

 

Asymptotic optimality of a large class of multiple testing rules is investigated using

the framework of Bayesian Decision Theory. A normal scale mixture model is considered, leading to an asymptotic 

framework which can be naturally motivated under the assumption of sparsity, 

where the proportion of ``true'' alternativesš converges to zero. Within this setup optimality of a rule is proved by 

showing that the ratio of its Bayes risk and that of the

šBayes oracle (a rule which minimizes the Bayes risk) converges to one. 

The class of fixed threshold multiple testing rules which are asymptotically optimal is fully characterized as well 

as the class of optimal rules controlling the Bayesian False Discovery Rate (BFDR). 

Furthermore, conditions are provided under which the popular Benjamini-Hochbergš procedure is asymptotically optimal. 

It is shown that for a wide class of sparsity levels, the threshold of the former can

be approximated very well by a non-random threshold. 

 

Apart from multiple testing the problem of model selection for multiple regression under sparsity is considered. 

Under the assumption of orthogonality and for known variances results from multiple testing immediately translate into the regression setting, 

where the scale mixture model is extended to a more general class of priors.

šWe illustrate asymptotic optimality properties of modified versions of the Bayesian Information Criterion (mBIC), 

where we specifically discuss modifications allowing to control FDR. Finally optimality of mBIC in the case of unknown variances is proven.


You may leave the list at any time by sending the command

SIGNOFF allstat

to [log in to unmask], leaving the subject line blank.

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager