skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: On orthogonality preserving quadratic stochastic operators

Abstract

A quadratic stochastic operator (in short QSO) is usually used to present the time evolution of differing species in biology. Some quadratic stochastic operators have been studied by Lotka and Volterra. In the present paper, we first give a simple characterization of Volterra QSO in terms of absolutely continuity of discrete measures. Further, we introduce a notion of orthogonal preserving QSO, and describe such kind of operators defined on two dimensional simplex. It turns out that orthogonal preserving QSOs are permutations of Volterra QSO. The associativity of genetic algebras generated by orthogonal preserving QSO is studied too.

Authors:
;  [1]
  1. Department of Computational and Theoretical Sciences, Faculty of Science International Islamic University Malaysia, P.O. Box 141, 25710 Kuantan, Pahang Malaysia (Malaysia)
Publication Date:
OSTI Identifier:
22391655
Resource Type:
Journal Article
Resource Relation:
Journal Name: AIP Conference Proceedings; Journal Volume: 1660; Journal Issue: 1; Conference: ICoMEIA 2014: International Conference on Mathematics, Engineering and Industrial Applications 2014, Penang (Malaysia), 28-30 May 2014; Other Information: (c) 2015 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ALGEBRA; BIOLOGICAL EVOLUTION; MATHEMATICAL OPERATORS; MATHEMATICAL SOLUTIONS; STOCHASTIC PROCESSES; TWO-DIMENSIONAL CALCULATIONS; VOLTERRA INTEGRAL EQUATIONS

Citation Formats

Mukhamedov, Farrukh, and Taha, Muhammad Hafizuddin Mohd. On orthogonality preserving quadratic stochastic operators. United States: N. p., 2015. Web. doi:10.1063/1.4915690.
Mukhamedov, Farrukh, & Taha, Muhammad Hafizuddin Mohd. On orthogonality preserving quadratic stochastic operators. United States. doi:10.1063/1.4915690.
Mukhamedov, Farrukh, and Taha, Muhammad Hafizuddin Mohd. 2015. "On orthogonality preserving quadratic stochastic operators". United States. doi:10.1063/1.4915690.
@article{osti_22391655,
title = {On orthogonality preserving quadratic stochastic operators},
author = {Mukhamedov, Farrukh and Taha, Muhammad Hafizuddin Mohd},
abstractNote = {A quadratic stochastic operator (in short QSO) is usually used to present the time evolution of differing species in biology. Some quadratic stochastic operators have been studied by Lotka and Volterra. In the present paper, we first give a simple characterization of Volterra QSO in terms of absolutely continuity of discrete measures. Further, we introduce a notion of orthogonal preserving QSO, and describe such kind of operators defined on two dimensional simplex. It turns out that orthogonal preserving QSOs are permutations of Volterra QSO. The associativity of genetic algebras generated by orthogonal preserving QSO is studied too.},
doi = {10.1063/1.4915690},
journal = {AIP Conference Proceedings},
number = 1,
volume = 1660,
place = {United States},
year = 2015,
month = 5
}
  • In the present paper, we consider a notion of orthogonal preserving nonlinear operators. We introduce π-Volterra quadratic operators finite and infinite dimensional settings. It is proved that any orthogonal preserving quadratic operator on finite dimensional simplex is π-Volterra quadratic operator. In infinite dimensional setting, we describe all π-Volterra operators in terms orthogonal preserving operators.
  • An arbitrary strictly non-Volterra quadratic operator on the 2-simplex is shown to have a unique fixed point, which is established as being nonattracting. A description of the {omega}-limit set of the trajectory of some subclasses of these operators is obtained. Strictly non-Volterra operators, as distinct from the Volterra operators, are shown to have cyclic trajectories. For two particular operators, we show that there exists a cyclic trajectory with period 3. Each trajectory which starts at the boundary of the simplex converges to this cyclic trajectory, whereas trajectories which begin at an interior point of the simplex (not at the fixedmore » point) must diverge. Furthermore, the {omega}-limit set of such a trajectory is infinite, and lies at the boundary of the simplex. Also, we study subclasses of strictly non-Volterra operators whose trajectories tend to a cyclic trajectory with period 2. Bibliography: 18 titles.« less
  • Let (X,F) be a measurable space, and S(X,F) be the set of all probability measures on (X,F) where X is a state space and F is σ - algebraon X. We consider a nonlinear transformation (quadratic stochastic operator) defined by (Vλ)(A) = ∫{sub X}∫{sub X}P(x,y,A)dλ(x)dλ(y), where P(x, y, A) is regarded as a function of two variables x and y with fixed A ∈ F . A quadratic stochastic operator V is called a regular, if for any initial measure the strong limit lim{sub n→∞} V{sup n }(λ) is exists. In this paper, we construct a family of quadratic stochastic operators defined on themore » segment X = [0,1] with Borel σ - algebra F on X , prove their regularity and show that the limit measure is a Dirac measure.« less
  • By means of contractions of Lie algebras, we obtain new classes of indecomposable quasiclassical Lie algebras that satisfy the Yang-Baxter equations in its reformulation in terms of triple products. These algebras are shown to arise naturally from noncompact real simple algebras with nonsimple complexification, where we impose that a nondegenerate quadratic Casimir operator is preserved by the limiting process. We further consider the converse problem and obtain sufficient conditions on integrable cocycles of quasiclassical Lie algebras in order to preserve nondegenerate quadratic Casimir operators by the associated linear deformations.
  • Geoscientific models and measurements generate false precision (scientifically meaningless data bits) that wastes storage space. False precision can mislead (by implying noise is signal) and be scientifically pointless, especially for measurements. By contrast, lossy compression can be both economical (save space) and heuristic (clarify data limitations) without compromising the scientific integrity of data. Data quantization can thus be appropriate regardless of whether space limitations are a concern. We introduce, implement, and characterize a new lossy compression scheme suitable for IEEE floating-point data. Our new Bit Grooming algorithm alternately shaves (to zero) and sets (to one) the least significant bits ofmore » consecutive values to preserve a desired precision. This is a symmetric, two-sided variant of an algorithm sometimes called Bit Shaving that quantizes values solely by zeroing bits. Our variation eliminates the artificial low bias produced by always zeroing bits, and makes Bit Grooming more suitable for arrays and multi-dimensional fields whose mean statistics are important. Bit Grooming relies on standard lossless compression to achieve the actual reduction in storage space, so we tested Bit Grooming by applying the DEFLATE compression algorithm to bit-groomed and full-precision climate data stored in netCDF3, netCDF4, HDF4, and HDF5 formats. Bit Grooming reduces the storage space required by initially uncompressed and compressed climate data by 25–80 and 5–65 %, respectively, for single-precision values (the most common case for climate data) quantized to retain 1–5 decimal digits of precision. The potential reduction is greater for double-precision datasets. When used aggressively (i.e., preserving only 1–2 digits), Bit Grooming produces storage reductions comparable to other quantization techniques such as Linear Packing. Unlike Linear Packing, whose guaranteed precision rapidly degrades within the relatively narrow dynamic range of values that it can compress, Bit Grooming guarantees the specified precision throughout the full floating-point range. Data quantization by Bit Grooming is irreversible (i.e., lossy) yet transparent, meaning that no extra processing is required by data users/readers. Hence Bit Grooming can easily reduce data storage volume without sacrificing scientific precision or imposing extra burdens on users.« less
    Cited by 2