Related papers: The Logarithmic Super Divergence and its use in St…
A class of cubic networks composed of a regular one-dimensional lattice and a set of long-range links is introduced. Networks parametrized by a positive integer k are constructed by starting from a one-dimensional lattice and iteratively…
A new generator of univariate continuous distributions, with two additional parameters, called the Log-Lindley generated family is introduced. Some special distributions in the new family are presented. Some mathematical properties of the…
There have lately been several suggestions for parametrized distances on a graph that generalize the shortest path distance and the commute time or resistance distance. The need for developing such distances has risen from the observation…
We develop a novel stability theory for Sinkhorn semigroups based on Lyapunov techniques and quantitative contraction coefficients, and establish exponential convergence of Sinkhorn iterations on weighted Banach spaces. This…
In this paper, we provide some new results for the Weibull-R family of distributions (Alzaghal, Ghosh and Alzaatreh (2016)). We derive some new structural properties of the Weibull-R family of distributions. We provide various…
We consider a new family of operators for reinforcement learning with the goal of alleviating the negative effects and becoming more robust to approximation or estimation errors. Various theoretical results are established, which include…
From the perspective of data reduction, the notions of minimal sufficient and complete statistics together play an important role in determining optimal statistics (estimators). The classical notion of sufficiency and completeness are not…
In this paper we propose the use of $\phi$-divergences as test statistics to verify simple hypotheses about a one-dimensional parametric diffusion process $\de X_t = b(X_t, \theta)\de t + \sigma(X_t, \theta)\de W_t$, from discrete…
A new method for analyzing high-dimensional categorical data, Linear Latent Structure (LLS) analysis, is presented. LLS models belong to the family of latent structure models, which are mixture distribution models constrained to satisfy the…
We consider a dominance order on positive vectors induced by the elementary symmetric polynomials. Under this dominance order we provide conditions that yield simple proofs of several monotonicity questions. Notably, our approach yields a…
The problem behind this paper is the proper measurement of the degree of quality/acceptability/distance to arbitrage of trades. We are narrowing the class of coherent acceptability indices introduced by Cherny and Madan (2007) by imposing…
Acyclic digraphs arise in many natural and artificial processes. Among the broader set, dynamic citation networks represent a substantively important form of acyclic digraphs. For example, the study of such networks includes the spread of…
One of the propositions in the paper [D. Kleinbock and G.A. Margulis, Logarithm laws for flows on homogeneous spaces, Invent. Math. 138 (1999), 451-494] related to approximating certain sets by smooth functions, was recently found to be…
We propose a new approach to compute an interval over-approximation of the finite time reachable set for a large class of nonlinear systems. This approach relies on the notions of sensitivity matrices, which are the partial derivatives…
Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular…
This paper significantly strengthens directed low-diameter decompositions in several ways. We define and give the first results for separated low-diameter decompositions in directed graphs, tighten and generalize probabilistic guarantees,…
This book deals with functions allowing to express the dissimilarity (discrepancy) between two data fields or ''divergence functions'' with the aim of applications to linear inverse problems. Most of the divergences found in the litterature…
Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time…
Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…
A family of self-similar and translation-invariant random sup-measures with long-range dependence are investigated. They are shown to arise as the limit of the empirical random sup-measure of a stationary heavy-tailed process, inspired by…