On the isomorphisms between evolution algebras of graphs and random walks

Evolution algebras are non-associative algebras inspired from biological phenomena, with applications to or connections with different mathematical fields. There are two natural ways to define an evolution algebra associated to a given graph. While one takes into account only the adjacencies of the...

Full description

Autores:
Rodiño Montoya, Mary Luz
Cadavid Salazar, Paula Andrea
Martín Rodriguez, Pablo
Tipo de recurso:
Article of investigation
Fecha de publicación:
2019
Institución:
Universidad de Antioquia
Repositorio:
Repositorio UdeA
Idioma:
eng
OAI Identifier:
oai:bibliotecadigital.udea.edu.co:10495/46223
Acceso en línea:
https://hdl.handle.net/10495/46223
Palabra clave:
Random walks (Mathematics)
Paseos aleatorios (Matemáticas)
Isomorfismos (Matemáticas)
Isomorphisms (Mathematics)
Álgebra
Algebra
Álgebra - Métodos gráficos
Algebra - Graphic methods
Teoría de grafos
Graph theory
http://id.loc.gov/authorities/subjects/sh85111357
http://id.loc.gov/authorities/subjects/sh85068654
Rights
openAccess
License
http://creativecommons.org/licenses/by-nc-nd/4.0/
Description
Summary:Evolution algebras are non-associative algebras inspired from biological phenomena, with applications to or connections with different mathematical fields. There are two natural ways to define an evolution algebra associated to a given graph. While one takes into account only the adjacencies of the graph, the other includes probabilities related to the symmetric random walk on the same graph. In this work we state new properties related to the relation between these algebras, which is one of the open problems in the interplay between evolution algebras and graphs. On the one hand, we show that for any graph both algebras are strongly isotopic. On the other hand, we provide conditions under which these algebras are or are not isomorphic. For the case of finite non-singular graphs we provide a complete description of the problem, while for the case of finite singular graphs we state a conjecture supported by examples and partial results. The case of graphs with an infinite number of vertices is also discussed. As a sideline of our work, we revisit a result existing in the literature about the identification of the automorphism group of an evolution algebra, and we give an improved version of it.