SearcharxivSearch

arXiv subjects

Edward Eriksson

Publications and source records attributed to Edward Eriksson.

3 recordsLinked to original sources

The Unseen Species Problem Revisited

Given $n$ i.i.d. samples from an unknown discrete distribution over an unknown set, the unseen species problem is to predict how many new outcomes would be observed in $m$ additional samples. For small $m$ we show that the Good--Toulmin estimator is the unique estimator which both respects the symmetries of the problem and has non-trivial rate. We resolve the open problem of constructing principled prediction intervals for it. For intermediate $m$ we propose a new estimator which has vastly improved worst case MSE guarantees compared to competing methods and good empirical performance. For large $m$ we follow previous authors in assuming a power law tail and show that a simple estimator achieves the same rate as, and better empirical performance than, a recent sophisticated method. Moreover, we give pre-asymptotic guarantees and asymptotically calibrated prediction intervals. Many of our results extend to incidence data, without further independence assumptions, provided that the sets are of bounded size. Using Stein's method we obtain concentration inequalities for some natural functionals of sequences of i.i.d. discrete-set-valued random variables which are of independent interest.

math.ST

Edge Exchangeable Graphs: Connectedness, Gaussianity and Completeness

We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient condition for asymptotic normality of the vertex count, and a necessary and sufficient condition for the produced graph to be eventually forever almost complete.

math.PR

On the moments of moments of random matrices and Ehrhart polynomials

There has been significant interest in studying the asymptotics of certain generalised moments, called the moments of moments, of characteristic polynomials of random Haar-distributed unitary and symplectic matrices, as the matrix size $N$ goes to infinity. These quantities depend on two parameters $k$ and $q$ and when both of them are positive integers it has been shown that these moments are in fact polynomials in the matrix size $N$. In this paper we classify the integer roots of these polynomials and moreover prove that the polynomials themselves satisfy a certain symmetry property. This confirms some predictions from the thesis of Bailey. The proof uses the Ehrhart-Macdonald reciprocity for rational convex polytopes and certain bijections between lattice points in some polytopes.

math-ph