Related papers: Multicoloured Random Graphs: Constructions and Sym…
In this paper we will provide an introductory understanding of random graph models, and matchings in the case of Erdos-Renyi random graphs. We will provide a synthesis of background theory to this end. We will further examine pertinent…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
This monograph is a study of the category of polynomial endofunctors on the category of sets and its applications to modeling interaction protocols and dynamical systems. We assume basic categorical background and build the categorical…
This is a survey paper about a selection of results in complex algebraic geometry that appeared in the recent and less recent litterature, and in which rational homogeneous spaces play a prominent r{\^o}le. This selection is largely…
Cographs--defined most simply as complete graphs with colored lines--both dualize and generalize ordinary graphs, and promise a comparably wide range of applications. This article introduces them by examples, catalogues, and elementary…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
Let $T(H, G_n)$ be the number of monochromatic copies of a fixed connected graph $H$ in a uniformly random coloring of the vertices of the graph $G_n$. In this paper we give a complete characterization of the limiting distribution of $T(H,…
Our purpose is to explore, in the context of loop ensembles on finite graphs, the relations between combinatorial group theory, loops topology, loop measures, and signatures of discrete paths. We determine the distributions of the loop…
Higher-rank graphs are, as the name suggests, higher-dimensional analogues of directed graphs which we will define using category theory. The whole idea of my project was to construct what we call a Baumslag-Solitar graph, a higher-rank…
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological…
We extend results from an earlier paper giving reconstruction results for the endomorphism monoid of the rational numbers under the strict and reflexive relations to the first order reducts of the rationals and the corresponding…
A spectral sequence calculating the homology groups of some spaces of maps equivariant under compact group actions is described. For the main example, we calculate the rational homology groups of spaces of even and odd maps $S^m \to S^M$,…
This is a draft of a monograph to appear in the Springer series "Encyclopaedia of Mathematical Sciences", subseries "Invariant Theory and Algebraic Transformation Groups". The subject is homogeneous spaces of algebraic groups and their…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
Various connections between the theory of permutation groups and the theory of topological groups are described. These connections are applied in permutation group theory and in the structure theory of topological groups. The first draft of…
We start by introducing the basics of configurations of points and lines, and then move into discussing symmetry groups of these configurations. Specifically, we explore how we might classify the symmetries of $(9_3)$ and $(10_3)$ geometric…
In a recent paper Cameron, Lakshmanan and Ajith began an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this can add a new perspective. Following their suggestions, we consider suitable…
A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…
We study the topological structure and the topological dynamics of groups of homeomorphisms of scattered spaces. For a large class of them (including the homeomorphism group of any ordinal space or of any locally compact scattered space),…
We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…