Related papers: Markov-Dyck shifts, neutral periodic points and to…
We study time-changes of unipotent flows on finite volume quotients of semisimple linear groups, generalising previous work by Ratner on time-changes of horocycle flows. Any measurable isomorphism between time-changes of unipotent flows…
The goal of this article is to study how combinatorial equivalence implies topological conjugacy. For that, we introduce the concept of kneading sequences for nonautonomous discrete dynamical systems and show that these sequences are a…
The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…
Using the technique of the metrization theorem of uniformities with countable bases, in this note we provide, test and compare an explicit algorithm to produce a metric $d(x,y)$ between the vertices $x$ and $y$ of an affinity weighted…
We study asymptotic stability of continuous-time systems with mode-dependent guaranteed dwell time. These systems are reformulated as special cases of a general class of mixed (discrete-continuous) linear switching systems on graphs, in…
Generalized (rational) graph contractions in the framework of a dislocated metric space endowed with a directed graph are investigated. Fixed point results for set-contractions are obtained. We also provide some examples to illustrate our…
We describe a general construction of strongly regular graphs from the collinearity graph of a finite classical polar spaces of rank at least $3$ over a finite field of order $q$. We show that these graphs are non-isomorphic to the…
In this paper, we study a hypothesis test to determine the underlying directed graph structure of nodes in a network, where the nodes represent random processes and the direction of the links indicate a causal relationship between said…
The main goal of this paper is proving the fixed point theorem for finite groups acting on weakly systolic complexes. As corollaries we obtain results concerning classifying spaces for the family of finite subgroups of weakly systolic…
To provide a phenomenological theory for the various interesting transitions in restructuring networks we employ a statistical mechanical approach with detailed balance satisfied for the transitions between topological states. This enables…
We study dynamics in a neighborhood of a nonhyperbolic fixed point or an irreducible homoclinic tangent point. General type conditions for the existence of infinite sets of periodic points are obtained. A new method, based on the study of…
We present a sufficient condition for the stability property of extremal graph problems that can be solved via Zykov's symmetrisation. Our criterion is stated in terms of an analytic limit version of the problem. We show that, for example,…
Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…
We study a class of generalized Chern-Simons equations on discrete lattice graphs. By an iterative scheme combined with an exhaustion argument, we establish the existence of topological solutions, which is also the maximal topological…
Applying a method of Godsil and McKay \cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters…
We consider the Grassmann graphs and dual polar graphs over the same finite field and show that, up to graph automorphism, for every dual polar graph there is the unique isometric embedding in the corresponding Grassmann graph.
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…
We study the existence of periodic colorings and orientations in locally finite graphs. A coloring or orientation of a graph $G$ is periodic if the resulting colored or oriented graph is quasi-transitive, meaning that $V(G)$ has finitely…
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…
We will characterize topologically conjugate two-sided topological Markov shifts $(\bar{X}_A,\bar{\sigma}_A)$ in terms of the associated asymptotic Ruelle $C^*$-algebras ${\mathcal{R}}_A$ with its commutative $C^*$-subalgebras…