Related papers: Equilibrium problems for Raney densities
We address the construction of stable random matrix ensembles as the generalization of the stable random variables (Levy distributions). With a simple method we derive the Cauchy case, which is known to have remarkable properties. These…
In this article, we study the regularity of minimizing and stationary $p$-harmonic maps between Riemannian manifolds. The aim is obtaining Minkowski-type volume estimates on the singular set $S(f)=\{x \ \ s.t. \ \ f \text{ is not continuous…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
Estimating the density of a continuous random variable X has been studied extensively in statistics, in the setting where n independent observations of X are given a priori and one wishes to estimate the density from that. Popular methods…
We present a method using Feynman-like diagrams to calculate the statistical properties of random many-body potentials. This method provides a promising alternative to existing techniques typically applied to this class of problems, such as…
In this paper, we study the equilibrium states of a $N\times N$ stochastic complex random matrix $M$, whose entries evolve in time accordingly with a Langevin equation including both Gaussian white noises and a linear disorder, materialized…
Renyi's information measures ---the Renyi information, mean, capacity, radius, and center--- are analyzed relying on the elementary properties of the Renyi divergence and the power means. The van Erven-Harremoes conjecture is proved for any…
A companion paper develops a framework in which probability measures are represented by distribution-kernel pairs (T,phi) with T a tempered distribution and phi a Schwartz kernel, so that weak moments of all orders exist unconditionally.…
In this paper, we develop the Littman-Stampacchia-Weinberger duality approach to obtain global W^1,p estimates for a class of elliptic problems involving Leray-Hardy operators and measure sources in a distributional framework associated…
On a closed manifold, consider the space of all Riemannian metrics for which -Delta + kR is positive (nonnegative) definite, where k > 0 and R is the scalar curvature. This spectral generalization of positive (nonnegative) scalar curvature…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
This article deals with the variable coefficient thin obstacle problem in $n+1$ dimensions. We address the regular free boundary regularity, the behavior of the solution close to the free boundary and the optimal regularity of the solution…
Causal inference requires evaluating models on balanced distributions between treatment and control groups, while training data often exhibits imbalance due to historical decision-making policies. Most conventional statistical methods…
The purpose of the present paper is to establish moment estimates of Rosenthal type for a rather general class of random variables satisfying certain bounds on the cumulants. We consider sequences of random variables which satisfy a central…
The fundamental task of general density estimation $p(x)$ has been of keen interest to machine learning. In this work, we attempt to systematically characterize methods for density estimation. Broadly speaking, most of the existing methods…
The random coefficients model is an extension of the linear regression model that allows for unobserved heterogeneity in the population by modeling the regression coefficients as random variables. Given data from this model, the statistical…
The min-entropy is a widely used metric to quantify the randomness of generated random numbers in cryptographic applications; it measures the difficulty of guessing the most likely output. An important min-entropy estimator is the…
We provide in a unified way quantitative forms of strong convergence results for numerous iterative procedures which satisfy a general type of Fejer monotonicity where the convergence uses the compactness of the underlying set. These…
We study matchings on sparse random graphs by means of the cavity method. We first show how the method reproduces several known results about maximum and perfect matchings in regular and Erdos-Renyi random graphs. Our main new result is the…
Entropy is a fundamental property of both classical and quantum systems, spanning myriad theoretical and practical applications in physics and computer science. We study the problem of obtaining estimates to within a multiplicative factor…