Search

The present paper deals with a class of ξ (a) -quadratic stochastic operators, referred to as QSOs, on a two-dimensional simplex. It investigates the algebraic properties of the genetic algebras associated with ξ (a) -QSOs. Namely, the associativity, characters and derivations of genetic algebras are studied. Moreover, the dynamics of these operators are also explored. Specifically, we focus on a particular partition that results in nine classes, which are further reduced to three nonconjugate classes. Each class gives rise to a genetic algebra denoted as A i , and it is shown that these algebras are isomorphic. The investigation then delves into analyzing various algebraic properties within these genetic algebras, such as associativity, characters, and derivations. The conditions for associativity and character behavior are provided. Furthermore, a comprehensive analysis of the dynamic behavior of these operators is conducted. [ABSTRACT FROM AUTHOR]

In this paper, by introducing an entropy of Markov evolution algebras, we treat the isomorphism of S-evolution algebras. A family of Markov evolution algebras is defined through the Hadamard product of structural matrices of non-negative real S-evolution algebras, and their isomorphism is studied by means of their entropy. Furthermore, the isomorphism of S-evolution algebras is treated using the concept of relative entropy. [ABSTRACT FROM AUTHOR]

A deformed exponential family is a generalization of exponential families. Since the useful classes of power law tailed distributions are described by the deformed exponential families, they are important objects in the theory of complex systems. Though the deformed exponential families are defined by deformed exponential functions, these functions do not satisfy the law of exponents in general. The deformed algebras have been introduced based on the deformed exponential functions. In this paper, after summarizing such deformed algebraic structures, it is clarified how deformed algebras work on deformed exponential families. In fact, deformed algebras cause generalization of expectations. The three kinds of expectations for random variables are introduced in this paper, and it is discussed why these generalized expectations are natural from the viewpoint of information geometry. In addition, deformed algebras cause generalization of independences. Whereas it is difficult to check the well-definedness of deformed independence in general, the κ-independence is always well-defined on κ-exponential families. This is one of advantages of κ-exponential families in complex systems. Consequently, we can well generalize the maximum likelihood method for the κ-exponential family from the viewpoint of information geometry. [ABSTRACT FROM AUTHOR]

In the paper we propose, using the logical entropy function, a new kind of entropy in product MV-algebras, namely the logical entropy and its conditional version. Fundamental characteristics of these quantities have been shown and subsequently, the results regarding the logical entropy have been used to define the logical mutual information of experiments in the studied case. In addition, we define the logical cross entropy and logical divergence for the examined situation and prove basic properties of the suggested quantities. To illustrate the results, we provide several numerical examples. [ABSTRACT FROM AUTHOR]

Using the algebraic state space representation, this paper studies the robust consensus of networked evolutionary games (NEGs) with attackers and forbidden profiles. Firstly, an algebraic form is established for NEGs with attackers and forbidden profiles. Secondly, based on the algebraic form, a necessary and sufficient condition is presented for the robust constrained reachability of NEGs. Thirdly, a series of robust reachable sets is constructed by using the robust constrained reachability, based on which a constructive procedure is proposed to design state feedback controls for the robust consensus of NEGs with attackers and forbidden profiles. Finally, an illustrative example is given to show that the main results are effective. [ABSTRACT FROM AUTHOR]

In 2007, and in a series of later papers, Joy Christian claimed to refute Bell's theorem, presenting an alleged local realistic model of the singlet correlations using techniques from geometric algebra (GA). Several authors published papers refuting his claims, and Christian's ideas did not gain acceptance. However, he recently succeeded in publishing yet more ambitious and complex versions of his theory in fairly mainstream journals. How could this be? The mathematics and logic of Bell's theorem is simple and transparent and has been intensely studied and debated for over 50 years. Christian claims to have a mathematical counterexample to a purely mathematical theorem. Each new version of Christian's model used new devices to circumvent Bell's theorem or depended on a new way to misunderstand Bell's work. These devices and misinterpretations are in common use by other Bell critics, so it useful to identify and name them. I hope that this paper can serve as a useful resource to those who need to evaluate new "disproofs of Bell's theorem". Christian's fundamental idea is simple and quite original: he gives a probabilistic interpretation of the fundamental GA equation a · b = (a b + b a) / 2 . After that, ambiguous notation and technical complexity allows sign errors to be hidden from sight, and new mathematical errors can be introduced. [ABSTRACT FROM AUTHOR]

In this paper, we will give the derivation of an inquiry calculus, or, equivalently, a Bayesian information theory. From simple ordering follow lattices, or, equivalently, algebras. Lattices admit a quantification, or, equivalently, algebras may be extended to calculi. The general rules of quantification are the sum and chain rules. Probability theory follows from a quantification on the specific lattice of statements that has an upper context. Inquiry calculus follows from a quantification on the specific lattice of questions that has a lower context. There will be given here a relevance measure and a product rule for relevances, which, taken together with the sum rule of relevances, will allow us to perform inquiry analyses in an algorithmic manner. [ABSTRACT FROM AUTHOR]

Quantum simulation qubit models of electronic Hamiltonians rely on specific transformations in order to take into account the fermionic permutation properties of electrons. These transformations (principally the Jordan–Wigner transformation (JWT) and the Bravyi–Kitaev transformation) correspond in a quantum circuit to the introduction of a supplementary circuit level. In order to include the fermionic properties in a more straightforward way in quantum computations, we propose to use methods issued from Geometric Algebra (GA), which, due to its commutation properties, are well adapted for fermionic systems. First, we apply the Witt basis method in GA to reformulate the JWT in this framework and use this formulation to express various quantum gates. We then rewrite the general one and two-electron Hamiltonian and use it for building a quantum simulation circuit for the Hydrogen molecule. Finally, the quantum Ising Hamiltonian, widely used in quantum simulation, is reformulated in this framework. [ABSTRACT FROM AUTHOR]

Graph-based causal inference has recently been successfully applied to explore system reliability and to predict failures in order to improve systems. One popular causal analysis following Pearl and Spirtes et al. to study causal relationships embedded in a system is to use a Bayesian network (BN). However, certain causal constructions that are particularly pertinent to the study of reliability are difficult to express fully through a BN. Our recent work demonstrated the flexibility of using a Chain Event Graph (CEG) instead to capture causal reasoning embedded within engineers' reports. We demonstrated that an event tree rather than a BN could provide an alternative framework that could capture most of the causal concepts needed within this domain. In particular, a causal calculus for a specific type of intervention, called a remedial intervention, was devised on this tree-like graph. In this paper, we extend the use of this framework to show that not only remedial maintenance interventions but also interventions associated with routine maintenance can be well-defined using this alternative class of graphical model. We also show that the complexity in making inference about the potential relationships between causes and failures in a missing data situation in the domain of system reliability can be elegantly addressed using this new methodology. Causal modelling using a CEG is illustrated through examples drawn from the study of reliability of an energy distribution network. [ABSTRACT FROM AUTHOR]

But the bivectors HT ht square to HT ht and the trivector I M i squares to HT ht . The three basis vectors HT ht , by definition, square to HT ht . The pseudo-scalar I M i squares to HT ht . [Extracted from the article]

The process algebra model has been suggested as an alternative mathematical framework for non-relativistic quantum mechanics (NRQM). It appears to reproduce the wave functions of non-relativistic quantum mechanics to a high degree of accuracy. It posits a fundamental level of finite, discrete events upon which the usual entities of NRQM supervene. It has been suggested that the process algebra model provides a true completion of NRQM, free of divergences and paradoxes, with causally local information propagation, contextuality, and realism. Arguments in support of these claims have been mathematical. Missing has been an ontology of this fundamental level from which the formalism naturally emerges. In this paper, it is argued that information and information flow provides this ontology. Higher level constructs such as energy, momentum, mass, spacetime, are all emergent from this fundamental level. [ABSTRACT FROM AUTHOR]

Several recent works have shown that aggregating local descriptors to generate global image representation results in great efficiency for retrieval and classification tasks. The most popular method following this approach is VLAD (Vector of Locally Aggregated Descriptors). We present a novel image presentation called Distribution Entropy Boosted VLAD (EVLAD), which extends the original vector of locally aggregated descriptors. The original VLAD adopts only residuals to depict the distribution information of every visual word and neglects other statistical clues, so its discriminative power is limited. To address this issue, this paper proposes the use of the distribution entropy of each cluster as supplementary information to enhance the search accuracy. To fuse two feature sources organically, two fusion methods after a new normalization stage meeting power law are also investigated, which generate identically sized and double-sized vectors as the original VLAD. We validate our approach in image retrieval and image classification experiments. Experimental results demonstrate the effectiveness of our algorithm. [ABSTRACT FROM AUTHOR]

This paper is concerned with the mathematical modelling of Tsallis entropy in product MV-algebra dynamical systems. We define the Tsallis entropy of order α , where α ∈ (0 , 1) ∪ (1 , ∞) , of a partition in a product MV-algebra and its conditional version and we examine their properties. Among other, it is shown that the Tsallis entropy of order α , where α > 1 , has the property of sub-additivity. This property allows us to define, for α > 1 , the Tsallis entropy of a product MV-algebra dynamical system. It is proven that the proposed entropy measure is invariant under isomorphism of product MV-algebra dynamical systems. [ABSTRACT FROM AUTHOR]

In the inference attacks studied in Quantitative Information Flow (QIF), the attacker typically tries to interfere with the system in the attempt to increase its leakage of secret information. The defender, on the other hand, typically tries to decrease leakage by introducing some controlled noise. This noise introduction can be modeled as a type of protocol composition, i.e., a probabilistic choice among different protocols, and its effect on the amount of leakage depends heavily on whether or not this choice is visible to the attacker. In this work, we consider operators for modeling visible and hidden choice in protocol composition, and we study their algebraic properties. We then formalize the interplay between defender and attacker in a game-theoretic framework adapted to the specific issues of QIF, where the payoff is information leakage. We consider various kinds of leakage games, depending on whether players act simultaneously or sequentially, and on whether or not the choices of the defender are visible to the attacker. In the case of sequential games, the choice of the second player is generally a function of the choice of the first player, and his/her probabilistic choice can be either over the possible functions (mixed strategy) or it can be on the result of the function (behavioral strategy). We show that when the attacker moves first in a sequential game with a hidden choice, then behavioral strategies are more advantageous for the defender than mixed strategies. This contrasts with the standard game theory, where the two types of strategies are equivalent. Finally, we establish a hierarchy of these games in terms of their information leakage and provide methods for finding optimal strategies (at the points of equilibrium) for both attacker and defender in the various cases. [ABSTRACT FROM AUTHOR]

The classical-quantum dichotomy is analyzed from the perspective of the Process Algebra approach, which views fundamental phenomena through the lens of complex systems theory and Whitehead's process theory. Broadly, the dichotomy can be framed in terms of differences in ontology (phenomena and their behavior) and differences in epistemology (theoretical languages used in their description). The Process Algebra posits a reality, generated by processes, whose fundamental characteristics include becoming, generativity, transience, locality, and contextuality. From this perspective, the classical-quantum dichotomy appears to be a false dichotomy—it arises because of stereotyped, strawman-like depictions of what it means to be classical or quantum. A more careful examination reveals that reality is unitary, that whether a system behaves in a quantum or classical manner depends upon its particularities, in particular, whether it is complex or not, and how information flows govern its dynamics. [ABSTRACT FROM AUTHOR]

The article reconsiders quantum theory in terms of the following principle, which can be symbolically represented as QUANTUMNESS → PROBABILITY → ALGEBRA and will be referred to as the QPA principle. The principle states that the quantumness of physical phenomena, that is, the specific character of physical phenomena known as quantum, implies that our predictions concerning them are irreducibly probabilistic, even in dealing with quantum phenomena resulting from the elementary individual quantum behavior (such as that of elementary particles), which in turn implies that our theories concerning these phenomena are fundamentally algebraic, in contrast to more geometrical classical or relativistic theories, although these theories, too, have an algebraic component to them. It follows that one needs to find an algebraic scheme able make these predictions in a given quantum regime. Heisenberg was first to accomplish this in the case of quantum mechanics, as matrix mechanics, whose matrix character testified to his algebraic method, as Einstein characterized it. The article explores the implications of the Heisenberg method and of the QPA principle for quantum theory, and for the relationships between mathematics and physics there, from a nonrealist or, in terms of this article, "reality-without-realism" or RWR perspective, defining the RWR principle, thus joined to the QPA principle. [ABSTRACT FROM AUTHOR]

This article deals with new concepts in a product MV-algebra, namely, with the concepts of Rényi entropy and Rényi divergence. We define the Rényi entropy of order q of a partition in a product MV-algebra and its conditional version and we study their properties. It is shown that the proposed concepts are consistent, in the case of the limit of q going to 1, with the Shannon entropy of partitions in a product MV-algebra defined and studied by Petrovičová (Soft Comput.2000, 4, 41–44). Moreover, we introduce and study the notion of Rényi divergence in a product MV-algebra. It is proven that the Kullback–Leibler divergence of states on a given product MV-algebra introduced by Markechová and Riečan in (Entropy2017, 19, 267) can be obtained as the limit of their Rényi divergence. In addition, the relationship between the Rényi entropy and the Rényi divergence as well as the relationship between the Rényi divergence and Kullback–Leibler divergence in a product MV-algebra are examined. [ABSTRACT FROM AUTHOR]