# Freedman–Diaconis rule

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- 2013

Chatterjee, Diaconis and Sly (2011) recently established the consistency of the maximum likelihood estimate in the $\beta$-model… (More)

Is this relevant?

2010

2010

- 2010

We describe a novel stochastic search algorithm for rapidly identifying regions of high posterior probability in the space of… (More)

Is this relevant?

2009

2009

- Discrete Mathematics
- 2009

A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- 2008

We give families of examples where sharp rates of convergence to stationarity of the widely used Gibbs sampler are available. The… (More)

Is this relevant?

2006

2006

- 2006

This is an expository paper, focussing on the following scenario. We have two Markov chains, M and M′. By some means, we have… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Proceedings IEEE 24th Annual Joint Conference of…
- 2005

Motivated by applications to sensor, peer-to-peer and ad hoc networks, we study distributed asynchronous algorithms, also known… (More)

Is this relevant?

2002

2002

- 2002

In this paper we give some basic characterizations of minimal Markov basis for a connected Markov chain, which is used for… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- 1999

We describe a simple one-person card game, patience sorting. Its analysis leads to a broad circle of ideas linking Young tableaux… (More)

Is this relevant?

1997

1997

- 1997

Introduction Many combinatorial structures decompose into components, with the list of component sizes carrying substantial… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- 1996

, \Visualization and analysis of multi-variate data: a technique for all elds", Proceedings Visualization '91, (1988), \Elements… (More)

Is this relevant?