A NEW PROOF OF THE ERDOS-KAC CENTRAL LIMIT THEOREM
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We present a new information-theoretic result which we call the Chaining Lemma. It considers a so-called "chain" of random variables, defined by a source distribution X-(0) with high min-entropy and a number (say, t in total) of arbitrary functions (T-1,.. ...
We consider the setting of estimating the mean of a random variable by a sequential stopping rule Monte Carlo (MC) method. The performance of a typical second moment based sequential stopping rule MC method is shown to be unreliable in such settings both b ...
We study the single-phase flow in a saturated, bounded heterogeneous porous medium. We model the permeability as a log-normal random field. We perform a perturbation analysis, expanding the solution in Taylor series. The series is directly computable in th ...
Dynamic optimization problems affected by uncertainty are ubiquitous in many application domains. Decision makers typically model the uncertainty through random variables governed by a probability distribution. If the distribution is precisely known, then ...
We study the single-phase flow in a saturated, bounded heterogeneous porous medium. We model the permeability as a log-normal random field. We perform a perturbation analysis, expanding the solution in Taylor series. The series is directly computable in th ...
We address adaptive multivariate polynomial approximation by means of the discrete least-squares method with random evaluations, to approximate in the L2 probability sense a smooth function depending on a random variable distributed according to a given pr ...
In this paper, a finite element error analysis is performed on a class of linear and nonlinear elliptic problems with small uncertain input. Using a perturbation approach, the exact (random) solution is expanded up to a certain order with respect to a para ...
The Weil-Barner explicit formula is applied to the prime counting function and to the problem of numerical partial verification of the Riemann hypothesis. ...
For any positive integers n≥3,r≥1 we present formulae for the number of irreducible polynomials of degree n over the finite field F2r where the coefficients of xn−1, xn−2 and xn−3 are zero. Our proofs involve coun ...
We study sums over primes of trace functions of l-adic sheaves. Using an extension of our earlier results on algebraic twists of modular forms to the case of Eisenstein series and bounds for Type II sums based on similar applications of the Riemann hypothe ...
