Related papers: Schreier graphs: transitivity and coverings
We study various types of shadowing properties and their implication for C1 generic vector fields. We show that, generically, any of the following three hypotheses implies that an isolated set is topologically transitive and hyperbolic: (i)…
We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces (symmetric measures on the square of a standard Borel space). More generally, we define an analogue of the set of homomorphisms in the form of a measure…
We prove a sharp representation stability result for graph complexes with a distinguished vertex, and prove that the chains realizing this sharp bound pass to non-trivial families of graph homology classes. This result may be interpreted as…
We compare three transitivity properties of finite graphs, namely, for a positive integer $s$, $s$-distance transitivity, $s$-geodesic transitivity and $s$-arc transitivity. It is known that if a finite graph is $s$-arc transitive but not…
Large continuous-time Markov chains with exponentially small transition rates arise in modeling complex systems in physics, chemistry and biology. We propose a constructive graph-algorithmic approach to determine the sequence of critical…
We give characterizations of the structure and degree sequences of hereditary unigraphs, those graphs for which every induced subgraph is the unique realization of its degree sequence. The class of hereditary unigraphs properly contains the…
The representation of complex systems as networks is inappropriate for the study of certain problems. We show several examples of social, biological, ecological and technological systems where the use of complex networks gives very limited…
Suppose that $X$ is an infinite, connected, locally finite, quasi-transitive graph with the property that every bi-infinite quasi-geodesic uniformly coarsely separates $X$ into exactly two deep pieces. We show that such an $X$ is…
Extending earlier results of Godsil and of Dobson and Malnic on Johnson graphs, we characterise those merged Johnson graphs $J=J(n,k)_I$ which are Cayley graphs, that is, which are connected and have a group of automorphisms acting…
A general overview of the phenomenon of automatic continuity of homomorphisms between Polish groups is given. In particular, we study variants and improvements of the closed graph theorem, applying these to the problem of continuity of…
The evaluation of graphs on 2-spheres is a central ingredient of the Turaev-Viro construction of three-dimensional topological field theories. In this article, we introduce a class of graphs, called extruded graphs, that is relevant for the…
The Grassmannian admits an action by a finite cyclic group via the cyclic shift map. We give a simple description of the points fixed by each element of this cyclic group, extending Karp's description of the points fixed by the cyclic shift…
We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…
This work addresses the existence of transitive extensions of certain infinite permutation groups which arise as the automorphism groups of model-theoretic structures which are generic in the Fra\"iss\'e sense. The study of transitive…
An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…
Let X be a coherent configuration associated with a transitive group G. In terms of the intersection numbers of X, a necessary condition for the point stabilizer of G to be a TI-subgroup, is established. Furthermore, under this condition, X…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle matroid. In this paper we describe the families of graphs having the same truncated cycle matroid and prove, in particular, that every…