Related papers: The Pascal automorphism has a purely continuous sp…
Persistent random walks are intermediate transport processes between a uniform rectilinear motion and a Brownian motion. They are formed by successive steps of random finite lengths and directions travelled at a fixed speed. The isotropic…
Recently, the work on quantum automorphism groups of graphs has seen renewed progress, which we expand in this paper. Quantum symmetry is a richer notion of symmetry than the classical symmetries of a graph. In general, it is non-trivial to…
We compare two classes of polynomial automorphisms, strongly nilpotent and Pascal finite. We conclude that every strongly nilpotent automorphism is a Pascal finite one, but not vice versa. We observe that Nagata's automorphism is Pascal…
The study of matter fields on an ensemble of random geometries is a difficult problem still in need of new methods and ideas. We will follow a point of view inspired by probability theory techniques that relies on an expansion of the two…
We define a general notion of a smooth invariant (central) ergodic measure on the space of paths of an $N$-graded graph (Bratteli diagram). It is based on the notion of standardness of the tail filtration in the space of paths, and the…
We address the problem of defining graph transformations by the simultaneous application of direct transformations even when these cannot be applied independently of each other. An algebraic approach is adopted, with production rules of the…
Quasisymmetry is a well-studied property of homeomorphisms between metric spaces, and Ahlfors regular conformal dimension is a quasisymmetric invariant. In the present paper, we consider the Ahlfors regular conformal dimension of metrics on…
Assumed to be undirected, simple, and connected are all of the graphs in this study, and adjacency matrix $A$ serves as the associated matrix. In this paper we show that it is possible to relate a creation sequence for a type of cographs…
If $v$ is an eigenvector for eigenvalue $\lambda$ of a graph $X$ and $\alpha$ is an automorphism of $X$, then $\alpha(v)$ is also an eigenvector for $\lambda$. Thus it is rather exceptional for an eigenvalue of a vertex-transitive graph to…
One version of the polycirculant conjecture states that every vertex-transitive graph has a semiregular automorphism. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open case.
We study ergodic properties of a family of traffic maps acting in the space of bi-infinite sequences of real numbers. The corresponding dynamics mimics the motion of vehicles in a simple traffic flow, which explains the name. Using…
We are studying stationary random processes with conditional polynomial moments that allow a continuous path modification. Processes with continuous path modification, are important because they are relatively easy to simulate. One does not…
In directed graphs, a cycle can be seen as a structure that allows its vertices to loop back to themselves, or as a structure that allows pairs of vertices to reach each other through distinct paths. We extend these concepts to temporal…
In an attempt to propose more general conditions for decoherence to occur, we study spectral and ergodic properties of unital, completely positive maps on not necessarily unital $C^*$-algebras, with a particular focus on gapped maps for…
The central question of this paper is: how do algebraic invariants of edge ideals change under natural graph operations? We study this question through the lens of suspensions. The (full) suspension of a graph is obtained by adjoining a new…
Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…
Inspired by theories such as Loop Quantum Gravity, a class of stochastic graph dynamics was studied in an attempt to gain a better understanding of discrete relational systems under the influence of local dynamics. Unlabeled graphs in a…
Dirac's approach to gauge symmetries is discussed. We follow closely the steps that led him from his conjecture concerning the generators of gauge transformations {\it at a given time} --to be contrasted with the common view of gauge…
It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…