Related papers: Approximating the Hard Square Entropy Constant wit…
We present the notion of the nearly dual compressed shift-invariant subspaces of the orthogonal complement of the model space and obtain their structure using Hitt's algorithm \cite{DH}.
The construction of $r$-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate $r$-nets with respect to Euclidean…
We tackle the problem of high-dimensional nonparametric density estimation by taking the class of log-concave densities on $\mathbb{R}^p$ and incorporating within it symmetry assumptions, which facilitate scalable estimation algorithms and…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
This paper is devoted to the convergence analysis of stochastic approximation algorithms of the form $\theta\_{n+1} = \theta\_n + \gamma\_{n+1} H\_{\theta\_n}(X\_{n+1})$ where $\{\theta\_nn, n \geq 0\}$ is a $R^d$-valued sequence,…
A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…
The purpose of this article is to develop a technique to estimate certain bounds for entropy numbers of diagonal operator on spaces of p-summable sequences for finite p greater than 1. The approximation method we develop in this direction…
The Hough transform (HT) is a fundamental tool across various domains, from classical image analysis to neural networks and tomography. Two key aspects of the algorithms for computing the HT are their computational complexity and accuracy -…
Conserving approximations are applied to the attractive Holstein and Hubbard models (on an infinite-dimensional hypercubic lattice). All effects of nonconstant density of states and vertex corrections are taken into account in the…
Consider a measure-preserving transition kernel $T$ on an arbitrary probability space $(\mathbb X,\mathcal cA,\pi)$. In this level of generality, we prove that a one-step hyper-contractivity estimate of the form $\|T\|_{p\to q}\le 1$ with…
We derive exact expressions for the local entanglement entropy E in the ground state of the one-dimensional Hubbard model at a quantum phase transition driven by a change in magnetic field h or chemical potential u. The leading divergences…
Let $Q_d$ be the hypercube of dimension $d$ and let $H$ and $K$ be subsets of the vertex set $V(Q_d)$, called configurations in $Q_d$. We say that $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ onto…
A graphon is said to have the $H$-property if a random undirected graph $G_n$ on $n$ nodes sampled from it has a node-wise disjoint cycle cover almost surely as $n\to\infty$. It has been shown in the earlier work that the $H$-property obeys…
Let $H$ be a graph on $h$ vertices. The number of induced copies of $H$ in a graph $G$ is denoted by $i_H(G)$. Let $i_H(n)$ denote the maximum of $i_H(G)$ taken over all graphs $G$ with $n$ vertices. Let $f(n,h) = \Pi_{i}^h a_i$ where…
Entropy estimation is of practical importance in information theory and statistical science. Many existing entropy estimators suffer from fast growing estimation bias with respect to dimensionality, rendering them unsuitable for…
The $S$-gap shifts have a dynamically and combinatorially rich structure. Dynamical properties of the $S$-gap shift can be related to the properties of the set $S$. This interplay is particularly interesting when $S$ is not syndetic such as…
We study Hamiltonicity in random subgraphs of the hypercube $\mathcal{Q}^n$. Our first main theorem is an optimal hitting time result. Consider the random process which includes the edges of $\mathcal{Q}^n$ according to a uniformly chosen…
We have a new observation that near horizon symmetry generators, corresponding to diffeomorphisms which leave the horizon structure invariant, satisfy noncommutative Heisenberg algebra. The results are valid for any null surfaces (which has…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
The well-known proof of Beurling's Theorem in the Hardy space $H^2$, which describes all shift-invariant subspaces, rests on calculating the orthogonal projection of the unit constant function onto the subspace in question. Extensions to…