Construction and Simulation of Composite Measures and Condensation Model for Designing Probabilistic Computational Applications

Abstract

The probabilistic algorithms are widely applied in designing computational applications such as distributed systems and probabilistic databases, to determine distributed consensus in the presence of random failures of nodes or networks. In distributed computing, symmetry breaking is performed by employing probabilistic algorithms. In general, probabilistic symmetry breaking without any bias is preferred. Thus, the designing of randomized and probabilistic algorithms requires modeling of associated probability spaces to generate control-inputs. It is required that discrete measures in such spaces are computable and tractable in nature. This paper proposes the construction of composite discrete measures in real as well as complex metric spaces. The measures are constructed on different varieties of continuous smooth curves having distinctive non-linear profiles. The compositions of discrete measures consider arbitrary functions within metric spaces. The measures are constructed on 1-D interval and 2-D surfaces and, the corresponding probability metric product is defined. The associated sigma algebraic properties are formulated. The condensation measure of the uniform contraction map is constructed as axioms. The computational evaluations of the proposed composite set of measures are presented.