Fetching the paper…
Reading the bibliography…
For "large" class $\mathcal{C}$ of continuous probability density functions (p.d.f.), we demonstrate that for every $w\in\mathcal{C}$ there is mixture of discrete Binomial distributions (MDBD) with $T\geq N\sqrt{\phi_{w}/\delta}$ distinct Binomial distributions $B(\cdot,N)$ that $\delta$-approximates a discretized p.d.f.
The mixed binomial distributin and the posterior distribution of p for a continuous prior distribution
A. Hald · 1968
Earlier work this paper cites.
Nonnegative Matrices
H. Minc · 1973
Earlier work this paper cites.
Approximate counting, uniform generation and rapidly mixing markov chains
A. Sinclair and M. Jerrum · 1989
Earlier work this paper cites.
Fast algorithms with preprocessing for matrix-vector multiplication problems
I. Gohberg and V. Olshevsky · 1994
Earlier work this paper cites.
Sharp error bounds for the trapezoidal rule and Simpson’s rule
D. Cruz-Uribe and C. Neugebauer · 2002
Earlier work this paper cites.
An elementary proof of error estimates for the trapezoidal rule
D. Cruz-Uribe and C. J. Neugebauer · 2003
Earlier work this paper cites.
Local graph partitioning using pagerank vectors
R. Andersen, F. R. K. Chung, and K. J. Lang · 2006
Earlier work this paper cites.
Support-graph preconditioners
M. W. Bern, J. R. Gilbert, B. Hendrickson, N. Nguyen, and S. Toledo · 2006
Earlier work this paper cites.
Graph sparsification by effective resistances
D. A. Spielman and N. Srivastava · 2008
Earlier work this paper cites.
On the derivatives of Bernstein polynomials: an application for the solution of high even-order differential equations
E. Doha, A. Bhrawy, and M. Saker · 2011
Cited alongside, same era.
A nearly-m log n time solver for sdd linear systems
I. Koutis, G. L. Miller, and R. Peng · 2011
Cited alongside, same era.
Towards an sdp-based approach to spectral methods: A nearly-linear-time algorithm for graph partitioning and decomposition
L. Orecchia and N. K. Vishnoi · 2011
Cited alongside, same era.
Spectral sparsification of graphs
D. A. Spielman and S. Teng · 2011
Cited alongside, same era.
Approximating the expansion profile and almost optimal local graph clustering
S. O. Gharan and L. Trevisan · 2012
Cited alongside, same era.
Improved spectral sparsification and numerical algorithms for SDD matrices
Algorithm Design Using Spectral Graph Theory
R. Y. Peng · 2013
Later among the works it cites.
D. Cheng, Y. Cheng, Y. Liu, R. Peng, and S. Teng · 2014
Later among the works it cites.
Dirichlet eigenvalues, local random walks, and analyzing clusters in graphs
P. Kolev and H. Sun · 2014
Later among the works it cites.
An efficient parallel solver for SDD linear systems
R. Peng and D. A. Spielman · 2014
Later among the works it cites.
Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
D. A. Spielman and S.-H. Teng · 2014
Later among the works it cites.
Efficient sampling for gaussian graphical models via spectral sparsification
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
I. Koutis, A. Levin, and R. Peng · 2012
Cited alongside, same era.
Spectral sparsification in the semi-streaming setting
J. A. Kelner and A. Levin · 2013
Cited alongside, same era.
Approximate maximum flow on separable undirected graphs
G. L. Miller and R. Peng · 2013
Cited alongside, same era.
Spectral sparsification of random-walk matrix polynomials
D. Cheng, Y. Cheng, Y. Liu, R. Peng, and S. Teng
Cited in the paper.
D. Cheng, Y. Cheng, Y. Liu, R. Peng, and S. Teng · 2015
Closest in time.
Uniform sampling for matrix approximation
M. B. Cohen, Y. T. Lee, C. Musco, C. Musco, R. Peng, and A. Sidford · 2015
Closest in time.
Sparsified cholesky and multigrid solvers for connection laplacians
R. Kyng, Y. T. Lee, R. Peng, S. Sachdeva, and D. A. Spielman · 2015
Closest in time.