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

We investigate the dynamics in the logarithmic galactic potential with an analytical approach. The phase-space structure of the real system is approximated with resonant detuned normal forms constructed with the method based on the Lie…

Given a nondecreasing sequence $\Lambda=\{\lambda_n>0\}$ such that $\displaystyle\lim_{n\to\infty} \lambda_n=\infty,$ we consider the sequence $\mathcal N_\Lambda:=\left\{\lambda_ne^{i\theta_n},n\in\,\mathbb N\right\}$, where $\theta_n$ are…

Deterministic identification (DI) has emerged as a promising paradigm for large-scale and goal-oriented communication systems. Despite significant progress, a fundamental open problem has remained unresolved: a persistent gap between the…

It is well-known that the semi-circle law, which is the limiting distribution in the Wigner theorem, is the minimizer of the logarithmic energy penalized by the second moment. A very similar fact holds for the Girko and Marchenko--Pastur…

In "Reliable Communication in the Absence of a Common Clock" (Yeung et al., 2009), the authors introduce general run-length sets, which form a class of constrained systems that permit run-lengths from a countably infinite set. For a…

In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices. The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes…

We prove that in any finite set of $\mathbb Z^d$ with $d\ge 3$, there is a subset whose capacity and volume are both of the same order as the capacity of the initial set. As an application we obtain estimates on the probability of {\it…

We establish the satisfiability threshold for random $k$-SAT for all $k\ge k_0$, with $k_0$ an absolute constant. That is, there exists a limiting density $\alpha_*(k)$ such that a random $k$-SAT formula of clause density $\alpha$ is with…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

Catalytic computing concerns space bounded computation which starts with memory full of data that have to be restored by the end of the computation. Lossy catalytic computing, defined by Gupta et al. (2024) and fully characterized by…

Stochastic gradient descent (SGD) and its variants have established themselves as the go-to algorithms for large-scale machine learning problems with independent samples due to their generalization performance and intrinsic computational…

We show that the Goemans-Linial semidefinite relaxation of the Sparsest Cut problem with general demands has integrality gap $(\log n)^{\Omega(1)}$. This is achieved by exhibiting $n$-point metric spaces of negative type whose $L_1$…

The probability distribution of sums of iterates of the logistic map at the edge of chaos has been recently shown [see U. Tirnakli, C. Beck and C. Tsallis, Phys. Rev. E 75, 040106(R) (2007)] to be numerically consistent with a q-Gaussian,…

We study the input-entropy-constrained Gaussian channel capacity problem in the asymptotic high signal-to-noise ratio (SNR) regime. We show that the capacity-achieving distribution as SNR goes to infinity is given by a discrete Gaussian…

In this short note we prove a conjecture for the interval $(0,1)$, related to a logarithmically completely monotonic function, presented in \cite{BG}. Then, we extend by proving a more generalized theorem. At the end we pose an open problem…

In this paper, we discuss computational aspects to obtain accurate inferences for the parameters of the generalized gamma (GG) distribution. Usually, the solution of the maximum likelihood estimators (MLE) for the GG distribution have no…

We consider the probability of having two intervals (gaps) without eigenvalues in the bulk scaling limit of the Gaussian Unitary Ensemble of random matrices. We describe uniform asymptotics for the transition between a single large gap and…

Given a probability measure over a state space, a partial collection (sub-$\sigma$-algebra) of events whose probabilities are known, induces a capacity over the collection of all possible events. The \emph{induced capacity} of an event $F$…

Let $Z(F)$ be the number of solutions of a random $k$-satisfiability formula $F$ with $n$ variables and clause density $\alpha$. Assume that the probability that $F$ is unsatisfiable is $O(1/\log(n)^{1+\e})$ for $\e>0$. We show that…

We compute the distribution of the partition functions for a class of one-dimensional Random Energy Models (REM) with logarithmically correlated random potential, above and at the glass transition temperature. The random potential sequences…