activity
20092013
most citedThe number of graphs and a random graph with a given degree sequence

9 citations · 17 across the 5 of their papers we have counts for

collaborators

5 papers

math.ST2013

Bounding the Maximum of Dependent Random Variables

J. A. Hartigan

Let be the maximum of zero-mean gaussian variables with covariance matrix of minimum eigenvalue and maximum eigenvalue . Then, for , $$\Pr\{…

cs.DM2011

Conditioned Poisson distributions and the concentration of chromatic numbers

John Hartigan, David Pollard, Sekhar Tatikonda

The paper provides a simpler method for proving a delicate inequality that was used by Achlioptis and Naor to establish asymptotic concentration for chromatic numbers of Erdos-Reny…

math.ST2010

Asymptotic admissibility of priors and elliptic differential equations

J. A. Hartigan

We evaluate priors by the second order asymptotic behavior of the corresponding estimators.Under certain regularity conditions, the risk differences between efficient estimators of…

math.CO2010★ 9 cited

The number of graphs and a random graph with a given degree sequence

Alexander Barvinok, J. A. Hartigan

We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient…

math.CO2009★ 8 cited

An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums

Alexander Barvinok, J. A. Hartigan

We count mxn non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally eff…