Freedman–Diaconis rule

Known as: Sturges' rule, Diaconis, Sturges rule 
In statistics, the Freedman–Diaconis rule, named after David A. Freedman and Persi Diaconis, can be used to select the size of the bins to be used in… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A central limit theorem in the β-model for undirected random graphs with a diverging number of vertices
Chatterjee, Diaconis and Sly (2011) recently established the consistency of the maximum likelihood estimate in the $\beta$-model… (More)
  • table 1
  • table 2
Is this relevant?
2010
2010
The mode oriented stochastic search (MOSS) algorithm for log-linear models with conjugate priors
We describe a novel stochastic search algorithm for rapidly identifying regions of high posterior probability in the space of… (More)
  • table 1
Is this relevant?
2009
2009
Universal cycles for permutations
A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Gibbs Sampling, Exponential Families and Orthogonal Polynomials.
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
Markov chain comparison
  • Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell Martin
  • 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
Gossip algorithms: design, analysis and applications
Motivated by applications to sensor, peer-to-peer and ad hoc networks, we study distributed asynchronous algorithms, also known… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2002
2002
SOME CHARACTERIZATIONS OF MINIMAL MARKOV BASIS FOR SAMPLING FROM DISCRETE CONDITIONAL DISTRIBUTIONS
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
Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
  • David Aldous, Persi Diaconis
  • 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
Random Combinatorial Structures and Prime Factorizations
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
Interactive High-Dimensional Data Visualization
, \Visualization and analysis of multi-variate data: a technique for all elds", Proceedings Visualization '91, (1988), \Elements… (More)
Is this relevant?