Fetching the paper…
Reading the bibliography…
An $(n,k)$-Poisson Multinomial Distribution (PMD) is the distribution of the sum of $n$ independent random vectors supported on the set ${\cal B}_k=\{e_1,\ldots,e_k\}$ of standard basis vectors in $\mathbb{R}^k$.
The accuracy of the Gaussian approximation to the sum of independent variates
Andrew C. Berry · 1941
Earlier work this paper cites.
On the Liapounoff limit of error in the theory of probability
Carl-Gustaf Esseen · 1942
Earlier work this paper cites.
Quasi-equilibria in markets with non-convex preferences
Ross M Starr · 1969
Earlier work this paper cites.
Stein’s method and Poisson process convergence
Andrew D. Barbour · 1988
Earlier work this paper cites.
Poisson approximations of multinomial distributions and point processes
Paul Deheuvels and Dietmar Pfeifer · 1988
Earlier work this paper cites.
Stein’s method and multinomial approximation
Wei-Liem Loh · 1992
Earlier work this paper cites.
Congestion games with player-specific payoff functions
Igal Milchtaich · 1996
Earlier work this paper cites.
A note on simultaneous congruences
Trevor D. Wooley · 1996
Earlier work this paper cites.
Anonymous games with binary actions
Matthias Blonski · 1999
Earlier work this paper cites.
Multisymmetric functions
John Dalbec · 1999
Earlier work this paper cites.
Asymptotic statistics
A. W Van der Vaart · 2000
Earlier work this paper cites.
Total variation asymptotics for sums of independent integer random variables
Andrew D. Barbour and Ćekanavićius · 2002
Earlier work this paper cites.
Multinomial and Krawtchouk approximations to the generalized multinomial distribution
Bero Roos · 2002
Earlier work this paper cites.
A Lyapunov-type bound in Rd
Vidmantas Bentkus · 2005
Earlier work this paper cites.
The women of Cairo: Equilibria in large anonymous games
Matthias Blonski · 2005
Cited alongside, same era.
Partially-specified large games
Ehud Kalai · 2005
Cited alongside, same era.
Computing equilibria in anonymous games
Constantinos Daskalakis and Christos H. Papadimitriou · 2007
Cited alongside, same era.
Discretized multinomial distributions and Nash equilibria in anonymous games
Constantinos Daskalakis and Christos H. Papadimitriou · 2008
Cited alongside, same era.
Settling the complexity of computing two-player Nash equilibria
Xi Chen, Xiaotie Deng, and Shang-Hua Teng · 2009
Cited alongside, same era.
The complexity of computing a Nash equilibrium
Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou · 2009
Cited alongside, same era.
Twice-Ramanujan sparsifiers
Joshua D. Batson, Daniel A. Spielman, and Nikhil Srivastava · 2012
Later among the works it cites.
Population recovery and partial identification
Avi Wigderson and Amir Yehudayoff · 2012
Later among the works it cites.
Spectral sparsification of graphs: Theory and algorithms
Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava, and Shang-Hua Teng · 2013
Later among the works it cites.
Learning sums of independent integer random variables
Constantinos Daskalakis, Ilias Diakonikolas, Ryan O’Donnell, Rocco A. Servedio, and Li Yang Tan · 2013
Later among the works it cites.
A polynomial time algorithm for lossy population recovery
Ankur Moitra and Michael Saks · 2013
Later among the works it cites.
New algorithms and lower bounds for monotonicity testing
Xi Chen, Rocco A. Servedio, and Li Yang Tan · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On oblivious PTAS’s for Nash equilibrium
Constantinos Daskalakis and Christos H. Papadimitriou · 2009
Cited alongside, same era.
Normal approximation by Stein’s method
Louis H.Y. Chen, Larry Goldstein, and Qi-Man Shao · 2010
Cited alongside, same era.
An improvement of convergence rate estimates in the Lyapunov theorem
I.G. Shevtsova · 2010
Cited alongside, same era.
A CLT and tight lower bounds for estimating entropy
Gregory Valiant and Paul Valiant · 2010
Cited alongside, same era.
Graph sparsification by effective resistances
Daniel A. Spielman and Nikhil Srivastava · 2011
Cited alongside, same era.
Spectral sparsification of graphs
Daniel A. Spielman and Shang-Hua Teng · 2011
Cited alongside, same era.
Faster and sample near-optimal algorithms for proper learning mixtures of Gaussians
Constantinos Daskalakis and Gautam Kamath · 2014
Later among the works it cites.
On the complexity of Nash equilibria in anonymous games
Xi Chen, David Durfee, and Anthi Orfanou · 2015
Closest in time.
On the structure, covering, and learning of Poisson multinomial distributions
Constantinos Daskalakis, Gautam Kamath, and Christos Tzamos · 2015
Closest in time.
Approximate Nash equilibria in anonymous games
Constantinos Daskalakis and Christos H. Papadimitriou · 2015
Closest in time.
Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions
Shachar Lovett and Jiapeng Zhang · 2015
Closest in time.
The Fourier transform of Poisson multinomial distributions and its algorithmic applications
Ilias Diakonikolas, Daniel M. Kane, and Alistair Stewart · 2016
Closest in time.
Optimal learning via the Fourier transform for sums of independent integer random variables
Ilias Diakonikolas, Daniel M. Kane, and Alistair Stewart · 2016
Closest in time.