Tight bounds for universal compression of large alphabets, 2013 IEEE International Symposium on Information Theory, pp.2875-2879, 2013. ,
DOI : 10.1109/ISIT.2013.6620751
Optimal probability estimation with applications to prediction and classification, Conference on Learning Theory, pp.764-796, 2013. ,
Poissonization and universal compression of envelope classes, 2014 IEEE International Symposium on Information Theory, 2014. ,
DOI : 10.1109/ISIT.2014.6875158
Universal compression of envelope classes: Tight characterization via poisson sampling ,
Optimal testing for properties of distributions, Advances in Neural Information Processing Systems, pp.3577-3598, 2015. ,
Random walks on finite groups and rapidly mixing markov chains, Seminar on probability, XVII, pp.243-297, 1983. ,
DOI : 10.1214/aop/1176994578
Shuffling cards and stopping times, American Mathematical Monthly, pp.333-348, 1986. ,
A counterexample to a correlation inequality in finite sampling. The Annals of Statistics, pp.436-439, 1989. ,
NON-BACKTRACKING RANDOM WALKS MIX FASTER, Communications in Contemporary Mathematics, vol.23, issue.04, pp.585-603, 2007. ,
DOI : 10.1017/S0963548300000390
Extreme value theory for a class of discrete distributions with applications to some stochastic processes, Journal of Applied Probability, pp.99-113, 1970. ,
Convergence properties of functional estimates for discrete distributions, Random Structures and Algorithms, vol.24, issue.3-4, pp.163-193, 2001. ,
DOI : 10.1109/TIT.1978.1055934
On the number of distinct values in a large sample from an infinite discrete distribution, 26A(Supp. II), pp.67-75, 1960. ,
Small counts in the infinite occupancy scheme. Electron, J. Probab, vol.14, issue.13, pp.365-384, 2009. ,
Concentration inequalities for sampling without replacement. ArXiv e-prints, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01216652
Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models. arXiv preprint arXiv:1402, 2014. ,
Characterization of cutoff for reversible Markov chains, 2015. ,
The Complexity of Approximating the Entropy, SIAM Journal on Computing, vol.35, issue.1, pp.132-150, 2005. ,
DOI : 10.1137/S0097539702403645
Testing Closeness of Discrete Distributions, Journal of the ACM, vol.60, issue.1 ,
DOI : 10.1145/2432622.2432626
Trailing the dovetail shuffle to its lair. The Annals of Applied Probability, pp.294-313, 1992. ,
Statistics of extremes: theory and applications, 2006. ,
DOI : 10.1002/0470012382
Cutoff for non-backtracking random walks on sparse random graphs, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01141192
Concentration inequalities in the infinite urn scheme for occupancy counts and the missing mass, with applications. arXiv preprint arXiv:1412, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01101671
Weighted sampling without replacement. arXiv preprint, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01376925
Disorder, entropy and harmonic functions . arXiv preprint arXiv, pp.1111-4853, 2011. ,
On the concentration of the missing mass, Electronic Communications in Probability, vol.18, issue.0, 2013. ,
DOI : 10.1214/ECP.v18-2359
A finite sample analysis of the naive bayes classifier, Journal of Machine Learning Research, vol.16, pp.1519-1545, 2015. ,
Cutoff for conjugacy-invariant random walks on the permutation group, 2014. ,
Random walks on the random graph, The Annals of Probability, vol.46, issue.1, 2015. ,
DOI : 10.1214/17-AOP1189
Random fragmentation and coagulation processes, 2006. ,
DOI : 10.1017/CBO9780511617768
URL : https://hal.archives-ouvertes.fr/hal-00103015
On the variance of the number of occupied boxes, Advances in Applied Mathematics, vol.40, issue.4, pp.401-432, 2008. ,
DOI : 10.1016/j.aam.2007.05.002
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs, European Journal of Combinatorics, vol.1, issue.4, pp.311-316, 1980. ,
DOI : 10.1016/S0195-6698(80)80030-8
Random graphs, 1998. ,
Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes, IEEE Transactions on Information Theory, vol.57, issue.3, pp.1466-1478, 2011. ,
DOI : 10.1109/TIT.2010.2103831
URL : https://hal.archives-ouvertes.fr/hal-00284638
About Adaptive Coding on Countable Alphabets, IEEE Transactions on Information Theory, vol.60, issue.2, pp.808-821, 2014. ,
DOI : 10.1109/TIT.2013.2288914
URL : https://hal.archives-ouvertes.fr/hal-00665033
Random walk on sparse random digraphs. arXiv preprint, 2015. ,
DOI : 10.1007/s00440-017-0796-7
URL : https://hal.archives-ouvertes.fr/hal-01187523
Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp.1347-1357, 2015. ,
DOI : 10.1109/FOCS.2015.86
URL : https://hal.archives-ouvertes.fr/hal-01137952
A sharp concentration inequality with applications. Random Structures and Algorithms, pp.277-292, 2000. ,
Coding on Countably Infinite Alphabets, IEEE Transactions on Information Theory, vol.55, issue.1, pp.358-373, 2009. ,
DOI : 10.1109/TIT.2008.2008150
URL : https://hal.archives-ouvertes.fr/hal-00121892
About Adaptive Coding on Countable Alphabets: Max-Stable Envelope Classes, IEEE Transactions on Information Theory, vol.61, issue.9, pp.614948-4967, 2015. ,
DOI : 10.1109/TIT.2015.2455058
URL : https://hal.archives-ouvertes.fr/hal-01263282
On the second eigenvalue of random regular graphs, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp.286-294, 1987. ,
DOI : 10.1109/SFCS.1987.45
Estimating the number of species: a review, Journal of the American Statistical Association, vol.88, issue.421, pp.364-373, 1993. ,
Statistical learning theory and stochastic optimization, Lecture Notes in Mathematics, vol.1851, 2004. ,
DOI : 10.1007/b99352
URL : https://hal.archives-ouvertes.fr/hal-00104952
Prediction, learning, and games, 2006. ,
DOI : 10.1017/CBO9780511546921
Stein's method for concentration inequalities. Probability theory and related fields, pp.305-321, 2007. ,
The Cutoff Phenomenon for Ergodic Markov Processes, Electronic Journal of Probability, vol.13, issue.0, pp.26-78, 2008. ,
DOI : 10.1214/EJP.v13-474
Normal approximation by Stein's method, 2010. ,
Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful, Structural Information and Communication Complexity, pp.1-14, 2011. ,
DOI : 10.1007/s00453-003-1030-9
Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk, SIAM Journal on Discrete Mathematics, vol.30, issue.1, 2014. ,
DOI : 10.1137/14097937X
Elements of information theory, 1991. ,
Information Theory: Coding Theorems for Discrete Memoryless Channels, 1981. ,
DOI : 10.1017/CBO9780511921889
Glauber Dynamics for the Mean-Field Potts Model, Journal of Statistical Physics, vol.126, issue.1, pp.432-477, 2012. ,
DOI : 10.1007/BF02124328
IntroductionàIntroductionà l'estimation non paramétrique, 2003. ,
Extreme value theory: an introduction, 2007. ,
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications, Physical Review E, vol.33, issue.6, p.66106, 2011. ,
DOI : 10.1103/PhysRevE.78.046110
URL : https://hal.archives-ouvertes.fr/hal-00661643
Nonparametric density estimation: the L1 view, 1985. ,
Combinatorial methods in density estimation, 2012. ,
DOI : 10.1007/978-1-4613-0125-7
The cutoff phenomenon in finite Markov chains., Proceedings of the National Academy of Sciences, vol.93, issue.4, pp.1659-1664, 1996. ,
DOI : 10.1073/pnas.93.4.1659
Generating a random permutation with random transpositions. Probability Theory and Related Fields, pp.159-179, 1981. ,
Asymptotic analysis of a random walk on a hypercube with many dimensions. Random structures and algorithms, pp.51-72, 1990. ,
The Mixing Time Evolution of Glauber Dynamics for the Mean-Field Ising Model, Communications in Mathematical Physics, vol.127, issue.2, pp.725-764, 2009. ,
DOI : 10.1007/s00220-009-0781-9
Total variation cutoff in birth-and-death chains. Probability theory and related fields, pp.61-85, 2010. ,
Balls and bins: A study in negative dependence. Random Structures and Algorithms, pp.99-124, 1998. ,
Central limit theorems for infinite urn models. The Annals of Probability, pp.1255-1263, 1989. ,
The jackknife estimate of variance. The Annals of Statistics, pp.586-596, 1981. ,
Estimating the number of unseen species: How many words did Shakespeare know?, Biometrika, vol.63, issue.3, pp.435-447, 1976. ,
DOI : 10.1093/biomet/63.3.435
Universal codeword sets and representations of the integers, IEEE Transactions on Information Theory, vol.21, issue.2, pp.194-203, 1975. ,
DOI : 10.1109/TIT.1975.1055349
Confidence Intervals for the Coverage of Low Coverage Samples, The Annals of Statistics, vol.10, issue.1, pp.190-196, 1982. ,
DOI : 10.1214/aos/1176345701
The Efficiency of Good's Nonparametric Coverage Estimator, The Annals of Statistics, vol.14, issue.3, pp.1257-1260, 1986. ,
DOI : 10.1214/aos/1176350066
Confidence intervals for an occupancy problem estimator used by numismatists, Math. Sci, vol.9, issue.2, pp.111-115, 1984. ,
Universal compression of power-law distributions, 2015 IEEE International Symposium on Information Theory (ISIT), pp.2001-2005, 2015. ,
DOI : 10.1109/ISIT.2015.7282806
The Relation Between the Number of Species and the Number of Individuals in a Random Sample of an Animal Population, The Journal of Animal Ecology, vol.12, issue.1, pp.42-58, 1411. ,
DOI : 10.2307/1411
On tail probabilities for martingales. the Annals of Probability, pp.100-118, 1975. ,
A proof of Alon???s second eigenvalue conjecture and related problems, Memoirs of the American Mathematical Society, vol.195, issue.910, 2008. ,
DOI : 10.1090/memo/0910
Good???turing frequency estimation without tears*, Journal of Quantitative Linguistics, vol.73, issue.3, pp.217-237, 1995. ,
DOI : 10.3115/981732.981742
Cutoff for the east process. arXiv preprint, 2013. ,
A Lower-Bound for the Maximin Redundancy in Pattern Coding, Entropy, vol.27, issue.4, pp.634-642, 2009. ,
DOI : 10.1093/qmath/2.1.85
URL : https://hal.archives-ouvertes.fr/hal-00479585
Codage universel et identification d'ordre par sélection de modèles, 2014. ,
Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws, Probability Surveys, vol.4, issue.0, pp.146-171, 2007. ,
DOI : 10.1214/07-PS092
Regeneration in random combinatorial structures, Probability Surveys, vol.7, issue.0, pp.105-15610, 2010. ,
DOI : 10.1214/10-PS163
The Population Frequencies of species and the estimation of population parameters, Biometrika, vol.40, pp.16-264, 1953. ,
THE NUMBER OF NEW SPECIES, AND THE INCREASE IN POPULATION COVERAGE, WHEN A SAMPLE IS INCREASED, Biometrika, vol.43, issue.1-2, pp.45-63, 1956. ,
DOI : 10.1093/biomet/43.1-2.45
Successive Sampling in Large Finite Populations, The Annals of Statistics, vol.11, issue.2, pp.702-706, 1983. ,
DOI : 10.1214/aos/1176346175
Tight inequalities among set hitting times in Markov chains, Proceedings of the American Mathematical Society, pp.3285-3298, 2014. ,
DOI : 10.1090/S0002-9939-2014-12045-4
Gaps in Discrete Random Samples, Journal of Applied Probability, vol.AH, issue.04, pp.1038-1051, 2009. ,
DOI : 10.1016/j.aam.2007.05.002
On Universal Noiseless Source Coding for Infinite Source Alphabets, European Transactions on Telecommunications, vol.34, issue.1, pp.125-132, 1993. ,
DOI : 10.1002/0471200611
There is no Universal Source Code for Infinite Alphabet, Proceedings. IEEE International Symposium on Information Theory, pp.267-271, 1994. ,
DOI : 10.1109/ISIT.1993.748370
Minimax estimation of discrete distributions under 1 loss, IEEE Trans. Inform. Theory, issue.11, pp.616343-6354, 2015. ,
Adaptive estimation of Shannon entropy, 2015 IEEE International Symposium on Information Theory (ISIT), pp.1372-1376, 2015. ,
DOI : 10.1109/ISIT.2015.7282680
A technical report on hitting times, mixing and cutoff. arXiv preprint, 2015. ,
Probability Inequalities for Sums of Bounded Random Variables, Journal of the American Statistical Association, vol.1, issue.301, pp.13-30, 1963. ,
DOI : 10.1007/BF02883985
Some Limit Theorems with Applications in Sampling Theory, The Annals of Statistics, vol.1, issue.4, pp.644-658, 1973. ,
DOI : 10.1214/aos/1176342460
Local limit theorems for finite and infinite urn models, The Annals of Probability, vol.36, issue.3, pp.992-102207, 2008. ,
DOI : 10.1214/07-AOP350
The Probability That a Random Multigraph is Simple, Combinatorics, Probability and Computing, vol.19, issue.1-2, pp.205-225, 2009. ,
DOI : 10.1017/CBO9780511814068
Minimax Estimation of Functionals of Discrete Distributions, IEEE Transactions on Information Theory, vol.61, issue.5, pp.2835-2885, 2015. ,
DOI : 10.1109/TIT.2015.2412945
Negative association of random variables with applications. The Annals of Statistics, pp.286-295, 1983. ,
Urn Models and Their Application: An Approach to Modern Discrete Probability Theory., Biometrics, vol.34, issue.3, 1977. ,
DOI : 10.2307/2530628
Boundary and entropy of random walks in random environment, Prob. Theory and Math. Stat, vol.1, pp.573-579, 1990. ,
Random walks on discrete groups: boundary and entropy. The annals of probability, pp.457-490, 1983. ,
On learning distributions from their samples, Proceedings of The 28th Conference on Learning Theory, pp.1066-1100, 2015. ,
Central Limit Theorems for Certain Infinite Urn Schemes, Indiana University Mathematics Journal, vol.17, issue.4, pp.373-401, 1967. ,
DOI : 10.1512/iumj.1968.17.17020
Large deviation methods for approximate probabilistic inference, Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, pp.311-319 ,
A unified approach to weak universal source coding, IEEE Transactions on Information Theory, vol.24, issue.6, pp.674-682, 1978. ,
DOI : 10.1109/TIT.1978.1055960
Concentration around the mean for maxima of empirical processes. The Annals of Probability, pp.1060-1077, 2005. ,
The performance of universal encoding. Information Theory, IEEE Transactions on, vol.27, issue.2, pp.199-207, 1981. ,
The Cutoff profile for the Simple-Exclusion process on the cycle. arXiv preprint, 2015. ,
Markov chains and mixing times, 2009. ,
DOI : 10.1090/mbk/058
Glauber dynamics for the mean-field Ising model: cutoff , critical power law, and metastability. Probability Theory and Related Fields, pp.223-265, 2010. ,
Cutoff on all ramanujan graphs. arXiv preprint, 2015. ,
Cutoff phenomena for random walks on random regular graphs, Duke Mathematical Journal, vol.153, issue.3, pp.475-510, 2010. ,
DOI : 10.1215/00127094-2010-029
Explicit Expanders with Cutoff Phenomena, Electronic Journal of Probability, vol.16, issue.0, pp.419-435, 2011. ,
DOI : 10.1214/EJP.v16-869
Cutoff for General Spin Systems with Arbitrary Boundary Conditions, Communications on Pure and Applied Mathematics, vol.105, issue.1, pp.982-1027, 2014. ,
DOI : 10.1016/0022-1236(92)90073-R
Universality of cutoff for the Ising model. arXiv preprint, 2014. ,
Ramanujan graphs, Combinatorica, vol.4, issue.3, pp.261-277, 1988. ,
DOI : 10.1007/978-3-642-61856-7
Large-deviation bounds for sampling without replacement, American Mathematical Monthly, vol.121, issue.5, pp.449-454, 2014. ,
Ergodic theory on galton-watson trees: Speed of random walk and dimension of harmonic measure. Ergodic Theory and Dynamical Systems, pp.593-619, 1995. ,
Community detection thresholds and the weak Ramanujan property, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC '14, pp.694-703, 2014. ,
DOI : 10.1017/S0963548309990514
Concentration inequalities for the missing mass and for histogram rule error, The Journal of Machine Learning Research, vol.4, pp.895-911, 2003. ,
On the convergence rate of Good-Turing estimators, pp.1-6, 2000. ,
On the impossibility of learning the missing mass. arXiv preprint, 2015. ,
A proof of the block model threshold conjecture, Combinatorica, vol.22, 2013. ,
DOI : 10.1214/11-AAP789
Comparison methods for stochastic models and risks. Wiley Series in Probability and Statistics, 2002. ,
On the second eigenvalue of a graph [127] M. I. Ohannessian and M. A. Dahleh. Rare Probability Estimation under Regularly Varying Heavy Tails, Discrete Mathematics Journal of Machine Learning Research-Proceedings Track, vol.91, issue.23, pp.207-21021, 1991. ,
Mixing and hitting times for finite Markov chains, Electronic Journal of Probability, vol.17, issue.0, pp.1-12, 2012. ,
DOI : 10.1214/EJP.v17-2274
Speaking of Infinity, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2215-2230, 2004. ,
DOI : 10.1109/TIT.2004.834734
Competitive distribution estimation: Why is good-turing good, Advances in Neural Information Processing Systems, pp.2134-2142, 2015. ,
Always Good Turing: Asymptotically Optimal Probability Estimation, Science, vol.302, issue.5644, pp.427-431, 2003. ,
DOI : 10.1126/science.1088284
On modeling profiles instead of values, Proceedings of the 20th conference on Uncertainty in artificial intelligence, pp.426-435, 2004. ,
Universal compression of memoryless sources over unknown alphabets. Information Theory, IEEE Transactions on, vol.50, issue.7, pp.1469-1481, 2004. ,
American institute of mathematics (AIM) research workshop " sharp thresholds for mixing times Summary available at http://www, 2004. ,
Mixing Times are Hitting Times of Large Sets, Journal of Theoretical Probability, vol.20, issue.3, pp.1-32, 2013. ,
DOI : 10.1145/225058.225086
On the complexity of a concentrator, 7th International Telegraffic Conference, pp.1-318, 1973. ,
Size biased permutation of a finite sequence with independent and identically distributed terms. ArXiv e-prints, 2012. ,
The two-parameter poisson-dirichlet distribution derived from a stable subordinator. The Annals of Probability, pp.855-900, 1997. ,
Concentration of Measure Inequalities in Information Theory, Communications and Coding, vol.10 ,
Stochastic complexity and modeling. The annals of statistics, pp.1080-1100, 1986. ,
Arithmetic Coding, IBM Journal of Research and Development, vol.23, issue.2, pp.149-162, 1979. ,
DOI : 10.1147/rd.232.0149
Asymptotic Theory for Successive Sampling with Varying Probabilities Without Replacement, II, The Annals of Mathematical Statistics, vol.43, issue.3, pp.373-397, 1972. ,
DOI : 10.1214/aoms/1177692543
Fundamentals of Stein???s method, Probability Surveys, vol.8, issue.0, pp.210-293, 2011. ,
DOI : 10.1214/11-PS182
Random Walks on Finite Groups, Probability on discrete structures, pp.263-346, 2004. ,
DOI : 10.1007/978-3-662-09444-0_5
Probability Inequalities for the Sum in Sampling without Replacement, The Annals of Statistics, vol.2, issue.1, pp.39-48, 1974. ,
DOI : 10.1214/aos/1176342611
Stochastic orders Springer Series in Statistics, 2007. ,
Universal lossless compression with unknown alphabets&# 8212; the average case. Information Theory, IEEE Transactions on, vol.52, issue.11, pp.4915-4944, 2006. ,
A comparison theorem on moment inequalities between negatively associated and independent random variables, Journal of Theoretical Probability, vol.13, issue.2, pp.343-356, 2000. ,
DOI : 10.1023/A:1007849609234
The Existence of Probability Measures with Given Marginals, The Annals of Mathematical Statistics, vol.36, issue.2, pp.423-439, 1965. ,
DOI : 10.1214/aoms/1177700153
Statistical inference over large domains, 2016. ,
Stochastic ordering and dependence in applied probability, Lecture Notes in Statistics, vol.97, pp.978-979, 1995. ,
DOI : 10.1007/978-1-4612-2528-7
A hierarchical Bayesian language model based on Pitman-Yor processes, Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL , ACL '06, pp.985-992, 2006. ,
DOI : 10.3115/1220175.1220299
Estimating the unseen, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.685-694, 2011. ,
DOI : 10.1145/1993636.1993727
Random Graphs and Complex Networks, 2013. ,
DOI : 10.1017/9781316779422
Distances in random graphs with finite variance degrees. Random Structures Algorithms, pp.76-123, 2005. ,
Asymptotic minimax regret for data compression, gambling, and prediction . Information Theory, IEEE Transactions on, vol.46, issue.2, pp.431-445, 2000. ,
On the inclusion probabilities in some unequal probability sampling plans without replacement, Bernoulli, vol.18, issue.1, pp.279-28910, 2012. ,
DOI : 10.3150/10-BEJ337