English
Related papers

Related papers: Logarithmic capacity of random $G_\delta$-sets

200 papers

We investigate properties of the particle distribution near the tip of one-dimensional branching random walks at large times $t$, focusing on unusual realizations in which the rightmost lead particle is very far ahead of its expected…

Statistical Mechanics · Physics 2020-08-07 A. H. Mueller , S. Munier

We initiate a study of the following problem: Given a continuous domain $\Omega$ along with its convex hull $\mathcal{K}$, a point $A \in \mathcal{K}$ and a prior measure $\mu$ on $\Omega$, find the probability density over $\Omega$ whose…

Data Structures and Algorithms · Computer Science 2020-04-17 Jonathan Leake , Nisheeth K. Vishnoi

We study the extremal properties of the "integer-valued Gaussian" a.k.a.\ DG-model on the hierarchical lattice $\Lambda_n:=\{1,\dots,b\}^n$ (with $b\ge2$) of depth $n$. This is a random field $\varphi\in\mathbb Z^{\Lambda_n}$ with law…

Probability · Mathematics 2023-11-22 Marek Biskup , Haiyu Huang

We observe that given two (compatible) classes of functions $\mathcal{F}$ and $\mathcal{H}$ with small capacity as measured by their uniform covering numbers, the capacity of the composition class $\mathcal{H} \circ \mathcal{F}$ can become…

Machine Learning · Statistics 2022-06-16 Alireza Fathollah Pour , Hassan Ashtiani

Let $I=(a,b)\times(c,d)\subset {\mathbb R}_{+}^2$ be an index set and let $\{G_{\alpha}(x) \}_{\alpha \in I}$ be a collection of Gaussian functions, i.e. $G_{\alpha}(x) = \exp(-\alpha_1 x_1^2 - \alpha_2 x_2^2)$, where $\alpha = (\alpha_1,…

Classical Analysis and ODEs · Mathematics 2022-06-17 Ilya Zlotnikov

This paper presents a comprehensive analysis of the information-energy capacity region for simultaneous lightwave information and power transfer (SLIPT) systems over lognormal fading channels. Unlike conventional studies that primarily…

Information Theory · Computer Science 2026-04-27 Nizar Khalfet , Kapila W. S. Palitharathna , Symeon Chatzinotas , Ioannis Krikidis

Let $\alpha(\mathbb{F}_q^{d},p)$ be the maximum possible size of a point set in general position in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^{d},p)$ up to a polylogarithmic factor…

Combinatorics · Mathematics 2025-09-09 Yaobin Chen , Jiaxi Nie , Jing Yu , Wentao Zhang

Concentration inequalities for the sample mean, like those due to Bernstein, Hoeffding, and Bentkus, are valid for any sample size but overly conservative, yielding confidence intervals that are unnecessarily wide. The central limit theorem…

Probability · Mathematics 2025-12-23 Morgane Austern , Lester Mackey

Let $\Delta_{\Omega_\varepsilon}$ be the Dirichlet Laplacian in the domain $\Omega_\varepsilon:=\Omega\setminus\left(\cup_i D_{i \varepsilon}\right)$. Here $\Omega\subset\mathbb{R}^n$ and $\{D_{i \varepsilon}\}_{i}$ is a family of tiny…

Spectral Theory · Mathematics 2017-12-27 Andrii Khrabustovskyi , Olaf Post

Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…

Functional Analysis · Mathematics 2026-03-20 M N N Namboodiri

This paper presents an analysis of the concept of capacity for noisy com- putations, i.e. functions implemented by unreliable or random devices. An information theoretic model of noisy computation of a perfect function f (measurable…

Information Theory · Computer Science 2016-03-23 Francois Simon

A subset $A$ of a finite abelian group is called $(k,\ell)$-sum-free if $kA \cap \ell A=\emptyset.$ In this paper, we extend this concept to compact abelian groups and study the question of how large a measurable $(k,\ell)$-sum-free set can…

Combinatorics · Mathematics 2019-01-16 Noah Kravitz

We give an FPTAS for computing the number of matchings of size $k$ in a graph $G$ of maximum degree $\Delta$ on $n$ vertices, for all $k \le (1-\delta)m^*(G)$, where $\delta>0$ is fixed and $m^*(G)$ is the matching number of $G$, and an…

Data Structures and Algorithms · Computer Science 2021-08-04 Vishesh Jain , Will Perkins , Ashwin Sah , Mehtaab Sawhney

In this paper, we consider the Gibbs measure associated to a logarithmically correlated random potential (including two dimensional free fields) at low temperature. We prove that the energy landscape freezes and enters in the so-called…

Probability · Mathematics 2013-10-22 Thomas Madaule , Rémi Rhodes , Vincent Vargas

We offer a natural and extensible measure-theoretic treatment of missingness at random. Within the standard missing data framework, we give a novel characterisation of the observed data as a stopping-set sigma algebra. We demonstrate that…

Methodology · Statistics 2018-01-23 Daniel Farewell , Rhian Daniel , Shaun Seaman

This extends a theorem of Davenport and Erd\"os on sequences of rational integers to sequences of integral ideals in arbitrary number fields $K$. More precisely, we introduce a logarithmic density for sets of integral ideals in $K$ and…

Number Theory · Mathematics 2018-08-30 Christian Huck

We develop a characterization of fading models, which assigns a number called logarithmic Jensen's gap to a given fading model. We show that as a consequence of a finite logarithmic Jensen's gap, approximate capacity region can be obtained…

Information Theory · Computer Science 2018-06-05 Joyson Sebastian , Can Karakus , Suhas Diggavi

The matrix $A:\mathbb{R}^n \to \mathbb{R}^m$ is $(\delta,k)$-regular if for any $k$-sparse vector $x$, $$ \left| \|Ax\|_2^2-\|x\|_2^2\right| \leq \delta \sqrt{k} \|x\|_2^2. $$ We show that if $A$ is $(\delta,k)$-regular for $1 \leq k \leq…

Statistics Theory · Mathematics 2021-03-10 Shahar Mendelson

The paper introduces a novel algorithm for computing the output admissible set of linear discrete-time systems subject to input saturation. The proposed method takes advantage of the piecewise-affine dynamics to propagate the output…

Optimization and Control · Mathematics 2023-11-29 Yaashia Gautam , Marco M. Nicotra

In this paper the limit probabilities of first-order properties are studied. The random graph $G(n,p)$ {\it obeys Zero-One $k$-Law} if for each first-order property with quantifier depth not greater than $k$ its probability tends to 0 or…

Probability · Mathematics 2016-02-02 Aleksandr Matushkin
‹ Prev 1 4 5 6 7 8 10 Next ›