Related papers: Entropy and a generalisation of `Poincare's Observ…

We give the first rigorous proof of the convergence of Riemannian Hamiltonian Monte Carlo, a general (and practical) method for sampling Gibbs distributions. Our analysis shows that the rate of convergence is bounded in terms of natural…

We show that if one uses the invariant form of the Boltzmann-Shannon continuous entropy, it is possible to obtain the generalized Pareto-Tsallis density function, using an appropriate "prior" measure m_{q}(x) and a "Boltzman constraint"…

We impose the uniform probability measure on the set of all discrete Gelfand-Tsetlin patterns of depth $n$ with the particles on row $n$ in deterministic positions. These systems equivalently describe a broad class of random tilings models,…

The Glivenko--Cantelli theorem is a uniform version of the strong law of large numbers. It states that for every IID sequence of random variables, the empirical measure converges to the underlying distribution (in the sense of uniform…

Polymer quantization is as a useful toy model for the mathematical aspects of loop quantum gravity and is interesting in its own right. Analyzing entropies of physically equivalent states in the standard Hilbert space and the polymer…

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…

We show that, under some general assumptions on the entries of a random complex $n \times n$ matrix $X_n$, the empirical spectral distribution of $\frac{1}{\sqrt{n}} X_n$ converges to the uniform law of an ellipsoid as $n$ tends to…

We investigate concentration properties of spectral measures of Hermitian random matrices with partially dependent entries. More precisely, let $X_n$ be a Hermitian random matrix of size $n\times n$ that can be split into independent blocks…

We establish a density variant of the Frankl-R\"{o}dl theorem on the sphere $\mathbb{S}^{n-1}$, which concerns avoiding pairs of vectors with a specific distance, or equivalently, a prescribed inner product. In particular, we establish…

In this article, we study the topological complexity of manifolds with a lower scalar curvature bound. We introduce a small scale index theorem to establish an upper bound for Gromov's simplicial norm of the Poincar\'e dual of the A-hat…

We prove a generalization of van der Corput's Difference Theorem in the theory of uniform distribution by establishing a connection with unitary operators that have Lebesgue spectrum. This allows us to show, for example, that if $(x_n)_{n =…

In the present paper we propose a new estimator of entropy based on smooth estimators of quantile density. The consistency and asymptotic distribution of the proposed estimates are obtained. As a consequence, a new test of normality is…

We introduce a notion of "gradient at a given scale" of functions defined on a metric measure space. We then use it to define Sobolev inequalities at large scale and we prove their invariance under large-scale equivalence (maps that…

This paper deals with a method for the approximation of a spectral density function among the solutions of a generalized moment problem a` la Byrnes/Georgiou/Lindquist. The approximation is pursued with respect to the Kullback-Leibler…

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…

We study the relative entropy between the empirical estimate of a discrete distribution and the true underlying distribution. If the minimum value of the probability mass function exceeds an $\alpha > 0$ (i.e. when the true underlying…

We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

Suppose the edges of the complete graph on $n$ vertices are assigned a uniformly chosen random ordering. Let $X$ denote the corresponding number of Hamiltonian paths that are increasing in this ordering. It was shown in a recent paper by…

Given a probability distribution P, what is the minimum amount of bits needed to store a value x sampled according to P, such that x can later be recovered (except with some small probability)? Or, what is the maximum amount of uniform…