Related papers: Chernoff approximation of subordinate semigroups a…
One-parameter semigroups of holomorphic functions appear naturally in various applications of Complex Analysis, and in particular, in the theory of (temporally) homogeneous Markov processes. A suitable analogue of one-parameter semigroups…
Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…
In this paper, we introduce formulations of the Trotter Kato theorem for approximation of bi continuous semigroups that provide a useful framework whenever convergence of numerical approximations to solutions of PDEs are studied with…
The notion \emph{Perron-Frobenius theory} usually refers to the interaction between three properties of operator semigroups: positivity, spectrum and long-time behaviour. These interactions gives rise to a profound theory with plenty of…
We develop efficient group-theoretical approach to the problem of classification of evolution equations that admit non-local transformation groups (quasi-local symmetries), i.e., groups involving integrals of the dependent variable. We…
We study the relative entropy of the empirical probability vector with respect to the true probability vector in multinomial sampling of $k$ categories, which, when multiplied by sample size $n$, is also the log-likelihood ratio statistic.…
We identify the stochastic processes associated with one-sided fractional partial differential equations on a bounded domain with various boundary conditions. This is essential for modelling using spatial fractional derivatives. We show…
We study convergence of nonlinear systems in the presence of an `almost Lyapunov' function which, unlike the classical Lyapunov function, is allowed to be nondecreasing---and even increasing---on a nontrivial subset of the phase space.…
We show that for weakly dependent random variables the relative entropy functional satisfies an approximate version of the standard tensorization property which holds in the independent case. As a corollary we obtain a family of…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
Complementarity relations between various characterizations of a probability distribution are at the core of information theory. In particular, lower and upper bounds for the entropic function are of great importance. In applied topics, we…
We establish various results on the structure of approximate subgroups in linear groups such as SL_n(k) that were previously announced by the authors. For example, generalising a result of Helfgott (who handled the cases n = 2 and 3), we…
A computational theory for clustering and a semi-supervised clustering algorithm is presented. Clustering is defined to be the obtainment of groupings of data such that each group contains no anomalies with respect to a chosen grouping…
When dealing with modern big data sets, a very common theme is reducing the set through a random process. These generally work by making "many simple estimates" of the full data set, and then judging them as a whole. Perhaps magically,…
The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…
In this paper, we develop a general approach for probabilistic estimation and optimization. An explicit formula and a computational approach are established for controlling the reliability of probabilistic estimation based on a mixed…
In the present paper, we prove that the $C_{0}$-semigroup generated by a Schr\"odinger operator with drift on a complete Riemannian manifold is approximated by the discrete semigroups associated with a family of discrete time random walks…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
We propose a fast and stable method for constructing matrix approximations to fractional integral operators applied to series in the Chebyshev fractional polynomials. This method utilizes a recurrence relation satisfied by the fractional…
For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…