Related papers: On the isomorphisms between evolution algebras of …
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the…
We exhibit the joint symmetric distribution of the following two parameters on the set of unlabeled, simple, connected graphs with $n$ vertices. The first parameter is the maximal number of leaves attached to a vertex. The second parameter…
We say that a vertex $v$ in a connected graph $G$ is decisive if the numbers of walks from $v$ of each length determine the graph $G$ rooted at $v$ up to isomorphism among all connected rooted graphs with the same number of vertices. On the…
Graphs are commonly used to characterise interactions between objects of interest. Because they are based on a straightforward formalism, they are used in many scientific fields from computer science to historical sciences. In this paper,…
Small-world graphs, which combine randomized and structured elements, are seen as prevalent in nature. Jon Kleinberg showed that in some graphs of this type it is possible to route, or navigate, between vertices in few steps even with very…
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…
In the present paper we describe absolute nilpotent and some idempotent elements of an n- dimensional evolution algebra corresponding to two permutations and we decompose such algebras to the direct sum of evolution algebras corresponding…
We introduce a notion of chain of evolution algebras. The sequence of matrices of the structural constants for this chain of evolution algebras satisfies an analogue of Chapman-Kolmogorov equation. We give several examples (time homogenous,…
A general random graph evolution mechanism is defined. The evolution is a combination of the preferential attachment model and the interaction of N vertices (N>=3). A vertex in the graph is characterized by its degree and its weight. The…
This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism problem for various graph classes. For example, all…
We classify row-finite Leavitt path algebras associated to graphs with no more than two vertices. For the discussion we use the following invariants: decomposability, the $K_0$ group, $\det(N'_E)$ (included in the Franks invariants), the…
In this paper, we examine a time-dependent family of two-dimensional algebras. We investigate the conditions under which any two algebras from this family, formed at different times, are isomorphic. Our findings reveal that the flow…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
Phylogenetic algebraic geometry is concerned with certain complex projective algebraic varieties derived from finite trees. Real positive points on these varieties represent probabilistic models of evolution. For small trees, we recover…
We describe those group algebras over fields of characteristic different from 2 whose units symmetric with respect to the classical involution, satisfy some group identity.
We investigate how the topology of attributed graphs influences the distribution of node attributes. This work offers a novel perspective by treating topology and attributes as structurally distinct but interacting components. We introduce…
We describe a method for associating some non-self-adjoint algebras to Mauldin-Williams graphs and we study the Morita equivalence and isomorphism of these algebras. We also investigate the relationship between the Morita equivalence and…
This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…
Motivated by the harmonic analysis of self-affine measures, we introduce a class of representations of the Cuntz algebra associated to random walks on graphs. The representations are constructed using the dilation theory of row…