Related papers: On the isomorphisms between evolution algebras of …
The principal observation of the present paper is that an inner isotopy (i.e. a principal isotopy defined by an algebra endomorphism) is a very helpful instrument in constructing and studying interesting classes of nonassociative algebras.…
One of the central questions of universal algebraic geometry is: when two algebras have the same algebraic geometry? There are various interpretations of the sentence "Two algebras have the same algebraic geometry". One of these is…
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…
Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
We consider a method popular in the literature of associating a two-step nilpotent Lie algebra with a finite simple graph. We prove that the two-step nilpotent Lie algebras associated with two graphs are Lie isomorphic if and only if the…
Evolutionary game theory is a powerful framework for studying evolution in populations of interacting individuals. A common assumption in evolutionary game theory is that interactions are symmetric, which means that the players are…
I show how to associate a Clifford algebra to a graph. I describe the structure of these Clifford graph algebras and provide many examples and pictures. I describe which graphs correspond to isomorphic Clifford algebras and also discuss…
We generalise the definition of a group algebra so that it makes sense for non-locally compact topological groups, in particular, we require that the representation theory of the group algebra is isomorphic (in the sense of Gelfand-Raikov)…
The evolution of two species with different fitness is investigated on degree-heterogeneous graphs. The population evolves either by one individual dying and being replaced by the offspring of a random neighbor (voter model (VM) dynamics)…
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
Leavitt path algebras are free algebras subject to relations induced by directed graphs. This paper investigates the ideals of Leavitt path algebras, with an emphasis on the relationship between graph-theoretic properties of a directed…
Graphs with diverse structural characteristics play a central role in modelling and optimization tasks. The ability to generate different types of graphs that exhibit shared properties is likewise essential for algorithm selection and…
Here we introduce researchers in algebraic biology to the exciting new field of cophylogenetics. Cophylogenetics is the study of concomitantly evolving organisms (or genes), such as host and parasite species. Thus the natural objects of…
An eikonal algebra ${\mathfrak E}(\Omega)$ is a C*-algebra related to a metric graph $\Omega$. It is determined by trajectories and reachable sets of a dynamical system associated with the graph. The system describes the waves, which are…
A periodic behavior is a well observed phenomena in biological and economical systems. We show that evolutionary games on graphs with imitation dynamics can display periodic behavior for an arbitrary choice of game theoretical parameters…
In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…
The main goal of this note is to show that subalgebras of regular evolution algebras are themselves evolution algebras. This allows us to assume, without loss of generality, that every subalgebra in the regular setting has a basis…
In nature, most microbial populations have complex spatial structures that can affect their evolution. Evolutionary graph theory predicts that some spatial structures modelled by placing individuals on the nodes of a graph affect the…
In this article we consider several probabilistic processes defining random grapha. One of these processes appeared recently in connection with a factorization problem in the symmetric group. For each of the probabilistic processes, we…