Related papers: An inequality for the entropy numbers and its appl…
In our derivation of the second law of thermodynamics from the relation of adiabatic accessibility of equilibrium states we stressed the importance of being able to scale a system's size without changing its intrinsic properties. This…
In this paper, an estimation of lower bound of topological entropy for coupled-expanding systems associated with transition matrices in compact Hausdorff spaces is given. Estimations of upper and lower bounds of topological entropy for…
We study a quantity called discrete layered entropy, which approximates the Shannon entropy within a logarithmic gap. Compared to the Shannon entropy, the discrete layered entropy is piecewise linear, approximates the expected length of the…
Maximum entropy estimation is of broad interest for inferring properties of systems across many different disciplines. In this work, we significantly extend a technique we previously introduced for estimating the maximum entropy of a set of…
This article is a survey of results concerning an inequality, which may be seen as a versatile tool to solve problems in the domain of Applied Probability. The inequality, which we call BRS-inequality, gives a convenient upper bound for the…
We show that extensive thermostatistics based on Renyi entropy and Kolmogorov-Nagumo averages can be expressed in terms of Tsallis non- extensive thermostatistics. We use this correspondence to generalize thermostatistics to a large class…
We generalize the Brezzi-Rappaz-Raviart approximation theorem, which allows to obtain existence and a priori error estimates for approximations of solutions to some nonlinear partial differential equations. Our contribution lies in the fact…
In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm. Since then, there have been many interesting and useful characterizations of greedy-type bases in Banach spaces. In this article, we study…
We show the equivalences of several notions of entropy, like a version of the topological entropy of the geodesic flow and the Minkowski dimension of the boundary, in metric spaces with convex geodesic bicombings satisfying a uniform…
In this paper we prove estimates on the behaviour of the Kolmogorov-Sinai entropy relative to a partition for randomly perturbed dynamical systems. Our estimates use the entropy for the unperturbed system and are obtained using the notion…
We are concerned with multidimensional stochastic balance laws. We identify a class of nonlinear balance laws for which uniform spatial $BV$ bounds for vanishing viscosity approximations can be achieved. Moreover, we establish temporal…
The approximation of a discrete probability distribution $\mathbf{t}$ by an $M$-type distribution $\mathbf{p}$ is considered. The approximation error is measured by the informational divergence $\mathbb{D}(\mathbf{t}\Vert\mathbf{p})$, which…
A general upper bound for topological entropy of switched nonlinear systems is constructed, using an asymptotic average of upper limits of the matrix measures of Jacobian matrices of strongly persistent individual modes, weighted by their…
We establish estimates for the Lebesgue parameters of the Chebyshev Weak Thresholding Greedy Algorithm in the case of general bases in Banach spaces. These generalize and slightly improve earlier results in [9], and are complemented with…
The paper explores three known methods, their variants and limitations, that can be used to obtain new entropy inequalities. The Copy Lemma was distilled from the original Zhang-Yeung construction which produced the first non-Shannon…
We present an analytical-numerical method providing robust upper estimates for the topological entropy or, more generally, uniform volume growth exponents of differentiable mappings. By introducing varying metrics, we simplify the analysis…
We study approximation of non-autonomous linear differential equations with variable delay over infinite intervals. We use piecewise constant argument to obtain a corresponding discrete difference equation. The study of numerical…
Grammar compression represents a string as a context free grammar. Achieving compression requires encoding such grammar as a binary string; there are a few commonly used encodings. We bound the size of practically used encodings for several…
We consider three von Neumann entropy inequalities: subadditivity; Pinsker's inequality for relative entropy; and the monotonicity of relative entropy. For these we state conditions for equality, and we prove some new error bounds away from…
Given a Banach space X and one of its compact sets F, we consider the problem of finding a good n dimensional space X_n \subset X which can be used to approximate the elements of F. The best possible error we can achieve for such an…