A NEW PROOF OF THE ERDOS-KAC CENTRAL LIMIT THEOREM

Publications associées (27)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Arjen Lenstra, Robert Granger, Thorsten Kleinjung, Benjamin Pierre Charles Wesolowski

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

AMER MATHEMATICAL SOC2021

Common Information Components Analysis

Michael Christoph Gastpar, Erixhen Sula

Wyner's common information is a measure that quantifies and assesses the commonality between two random variables. Based on this, we introduce a novel two-step procedure to construct features from data, referred to as Common Information Components Analysis ...

2021

A hybrid collocation-perturbation approach for PDEs with random domains

Fabio Nobile

Consider a linear elliptic PDE defined over a stochastic stochastic geometry a function of N random variables. In many application, quantify the uncertainty propagated to a quantity of interest (QoI) is an important problem. The random domain is split into ...

2021

Feedback and Common Information: Bounds and Capacity for Gaussian Networks

Erixhen Sula

Network information theory studies the communication of information in a network and considers its fundamental limits. Motivating from the extensive presence of the networks in the daily life, the thesis studies the fundamental limits of particular network ...

EPFL2021

Generalization Error Bounds Via Rényi-, f-Divergences and Maximal Leakage

Michael Christoph Gastpar, Amedeo Roberto Esposito, Ibrahim Issa

In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two random variables. ...

2021

Sub‐asymptotic motivation for new conditional multivariate extreme models

Anthony Christopher Davison, Thomas Lugrin, Jonathan A. Tawn

Statistical models for extreme values are generally derived from non-degenerate probabilistic limits that can be used to approximate the distribution of events that exceed a selected high threshold. If convergence to the limit distribution is slow, then th ...

2021

Strong convergence of multivariate maxima

Simone Padoan, Stefano Rizzelli

It is well known and readily seen that the maximum of n independent and uniformly on [0, 1] distributed random variables, suitably standardised, converges in total variation distance, as n increases, to the standard negative exponential distribution. We ex ...

CAMBRIDGE UNIV PRESS2020

On arithmetic progressions in symmetric sets in finite field model

Jan Hazla

We consider two problems regarding arithmetic progressions in symmetric sets in the finite field (product space) model. ...

ELECTRONIC JOURNAL OF COMBINATORICS2020

Fractional extreme distributions

Thomas Simon, Lotfi Boudabsa

We consider three classes of linear differential equations on distribution functions, with a fractional order alpha is an element of [0; 1]. The integer case alpha = 1 corresponds to the three classical extreme families. In general, we show that there is a ...

2020

Distributional Robustness in Mechanism Design

Cagil Kocyigit

Mechanism design theory examines the design of allocation mechanisms or incentive systems involving multiple rational but self-interested agents and plays a central role in many societally important problems in economics. In mechanism design problems, agen ...

EPFL2020

Page 2 sur 3

ELECTRONIC JOURNAL OF COMBINATORICS2020