Related papers: Approximating the Hard Square Entropy Constant wit…
This paper characterises the subspaces of $H^2(\mathbb D)$ simultaneously invariant under $S^2 $ and $S^{2k+1}$, where $S$ is the unilateral shift, then further identifies the subspaces that are nearly invariant under both $(S^2)^*$ and…
We define a stochastic variant of the proximal point algorithm in the general setting of nonlinear (separable) Hadamard spaces for approximating zeros of the mean of a stochastically perturbed monotone vector field and prove its convergence…
In this paper we study certain properties of R\'{e}nyi entropy functionals $H_\alpha(\mathcal{P})$ on the space of probability distributions over $\mathbb{Z}_+$. Primarily, continuity and convergence issues are addressed. Some properties…
We define a proportionally dense subgraph (PDS) as an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the subgraph as in the graph. We prove that the problem of…
Hypergraphs provide a natural representation for many-to-many relationships in data-intensive applications, yet their scalability is often hindered by high memory consumption. While prior work has improved computational efficiency, reducing…
We study approximation of the embedding $\ell_p^m \hookrightarrow \ell_q^m$, $1 \leq p < q \leq \infty$, based on randomized algorithms that use up to $n$ arbitrary linear functionals as information on a problem instance where $n \ll m$. By…
The internal structure of stripes in the two dimensional Hubbard model is studied by going beyond the Hartree-Fock approximation. Partially filled stripes, consistent with experimental observations, are stabilized by quantum fluctuations,…
We present a nonlinear (in the sense of McKean) generalization of Hamiltonian Monte Carlo (HMC) termed nonlinear HMC (nHMC) capable of sampling from nonlinear probability measures of mean-field type. When the underlying confinement…
Higher-dimensional binary shifts of number-theoretic origin with positive topological entropy are considered. We are particularly interested in analysing their symmetries and extended symmetries. They form groups, known as the topological…
The commonly used spatial entropy $h_{r}(\mathcal{U})$ of the multi-dimensional shift space $\mathcal{U}$ is the limit of growth rate of admissible local patterns on finite rectangular sublattices which expands to whole space…
A central problem in data-driven scientific inquiry is how to interpret structure in noisy, high-dimensional data. Topological data analysis (TDA) provides a solution via persistent homology, which encodes features of interest as…
It was shown in Dey and Roy (2012) that the near horizon limit of the 1/4 BPS threshold F-D$p$ (for $0\leq p \leq 5$, $p \neq 4$) bound state solutions of type II string theories give rise to space-time metrics endowed with Lifshitz scaling…
We present a series of almost settled inapproximability results for three fundamental problems. The first in our series is the subexponential-time inapproximability of the maximum independent set problem, a question studied in the area of…
In this paper, we develop a novel paradigm, namely hypergraph shift, to find robust graph modes by probabilistic voting strategy, which are semantically sound besides the self-cohesiveness requirement in forming graph modes. Unlike the…
The limited penetrable horizontal visibility algorithm is a new time analysis tool and is a further development of the horizontal visibility algorithm. We present some exact results on the topological properties of the limited penetrable…
We present the results of our computation of the subregion complexity and also compare it with the entanglement entropy of a $2+1$--dimensional holographic superconductor which has a fully backreacted gravity dual with a stable ground sate.…
We establish the geometric ergodicity of the preconditioned Hamiltonian Monte Carlo (HMC) algorithm defined on an infinite-dimensional Hilbert space, as developed in [Beskos et al., Stochastic Process. Appl., 2011]. This algorithm can be…
It is well known that the entropy $H(X)$ of a discrete random variable $X$ is always greater than or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tight…
Relative entropy between two states in the same Hilbert space is a fundamental statistical measure of the distance between these states. Relative entropy is always positive and increasing with the system size. Interestingly, for two states…
Suppose $k\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\lfloor n/k\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings…