Searcharxiv⌕ Search

arXiv subjects

Alexander Dukhovny

Publications and source records attributed to Alexander Dukhovny.

9 recordsLinked to original sources
arXiv2025

Relative Divergence and Maximum Relative Divergence Principle for Grading Functions on Partially Ordered Sets

Relative Divergence (RD) and Maximum Relative Divergence Principle (MRDP) for grading (order-comonotonic) functions (GF) on posets are used as an expression of Insufficient Reason Principle under the given prior information (IRP+). Classic Probability Theory formulas are presented as IRP+ solutions of MRDP problems on conjoined posets. RD definition principles are analyzed in relation to the poset structure. MRDP techniques are presented for standard posets: power sets, direct products of chains, etc. "Population group-testing" and "Single server of multiple queues" applications are stated and analyzed as "IRP+ by MRDP" problems on conjoined base posets.

cs.IT↗
arXiv2023

Maximum Relative Divergence Principle for Grading Functions on Direct Products of Chains

The concept of Shannon Entropy for probability distributions and associated Maximum Entropy Principle are extended here to the concepts of Relative Divergence of one Grading Function from another and Maximum Relative Divergence Principle for grading functions on direct products of totally ordered chains (chain bundles). Several Operations Research applications are analyzed.

math.OC↗
arXiv2022

Maximum Relative Divergence Principle for Grading Functions on Power Sets

The concept of Relative Divergence of one Grading Function from another is extended from totally ordered chains to power sets of finite event spaces. Shannon Entropy concept is extended to normalized grading functions on such power sets. Maximum Relative Divergence Principle is introduced as a generalization of the Maximum Entropy Principle as a tool for determining the "most reasonable" grading function and used in some Operations Research applications where that function is supposed to be "element-additive" or "cardinality-dependent" under application-specific linear constraints.

math.PR↗
arXiv2019

Axiomatic Origins of Mathematical Entropy: Grading Ordered Sets

Shannon's entropy and other entropy-based concepts are derived from the new, more general concept of relative divergence of one "grading' function on a linearly ordered set from another such function. The definition of relative divergence is derived based on "common sense' assumptions about comparing grading functions. Shannon's entropy formulas emerge from the respective relative divergence ones, entropy based methods are extended to more general cases and some new applications.

math.PR↗
arXiv2011

Reliability of systems with dependent components based on lattice polynomial description

Reliability of a system is considered where the components' random lifetimes may be dependent. The structure of the system is described by an associated "lattice polynomial" function. Based on that descriptor, general framework formulas are developed and used to obtain direct results for the cases where a) the lifetimes are "Bayes-dependent", that is, their interdependence is due to external factors (in particular, where the factor is the "preliminary phase" duration) and b) where the lifetimes' dependence is implied by upper or lower bounds on lifetimes of components in some subsets of the system. (The bounds may be imposed externally based, say, on the connections environment.) Several special cases are investigated in detail.

math.PR↗
arXiv2008

Reliability analysis of semicoherent systems through their lattice polynomial descriptions

A semicoherent system can be described by its structure function or, equivalently, by a lattice polynomial function expressing the system lifetime in terms of the component lifetimes. In this paper we point out the parallelism between the two descriptions and use the natural connection of lattice polynomial functions and relevant random events to collect exact formulas for the system reliability. We also discuss the equivalence between calculating the reliability of semicoherent systems and calculating the distribution function of a lattice polynomial function of random variables.

math.PR↗
arXiv2008

System reliability and weighted lattice polynomials

The lifetime of a system of connected units under some natural assumptions can be represented as a random variable Y defined as a weighted lattice polynomial of random lifetimes of its components. As such, the concept of a random variable Y defined by a weighted lattice polynomial of (lattice-valued) random variables is considered in general and in some special cases. The central object of interest is the cumulative distribution function of Y. In particular, numerous results are obtained for lattice polynomials and weighted lattice polynomials in case of independent arguments and in general. For the general case, the technique consists in considering the joint probability generating function of "indicator" variables. A connection is studied between Y and order statistics of the set of arguments.

math.PR↗