Related papers: Homomorphisms of connectome graphs
A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel intermediate-level topological analysis that considers non-overlapping subgraphs…
Topological data analysis is becoming increasingly relevant to support the analysis of unstructured data sets. A common assumption in data analysis is that the data set is a sample---not necessarily a uniform one---of some high-dimensional…
Counting homomorphisms from a graph $H$ into another graph $G$ is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where \emph{both} graphs $H$ and $G$ stem from given classes of graphs:…
A way to characterize the space of leaves of a foliation in terms of connections is proposed. A particular example of vertex algebra cohomology of codimension one foliations on complex curves is considered.
We calculate the cohomology rings of a collection of seven dimensional manifolds supporting an S^3 x S^3-action with one dimensional orbit space. These manifolds are of interest to differential geometers studying non-negative and positive…
In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…
We introduce new methods for understanding the topology of $\Hom$ complexes (spaces of homomorphisms between two graphs), mostly in the context of group actions on graphs and posets. We view $\Hom(T,-)$ and $\Hom(-,G)$ as functors from…
We study homomorphisms of Hecke monoids, notably parabolic homomorphisms, which map parabolic elements to parabolic elements, and injective ones. The importance of the first class stems from the fact that parabolic elements form a rather…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
We study a family of closed quantum graphs described by one singular vertex of order n=4. By suitable choice of the parameters specifying the singular vertex, we can construct a closed sequence of paths in the parameter space that…
Associative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities:…
We present simple examples of finite-dimensional connected homogeneous spaces (they are actually topological manifolds) with nonhomogeneous and nonrigid factors. In particular, we give an elementary solution of an old problem in general…
The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jeli\'c Milutinovi\'c et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the…
A heterogeneous graph consists of different vertices and edges types. Learning on heterogeneous graphs typically employs meta-paths to deal with the heterogeneity by reducing the graph to a homogeneous network, guide random walks or capture…
We describe a simple homological test for obstructions to graph colorings. The main idea is to combine the framework of Hom-complexes with the following general fact: an arbitrary Z_2-space has nontrivial homology with Z_2-coefficients in…
In recent times a great amount of progress has been achieved in symplectic and contact geometry, leading to the development of powerful invariants of 3-manifolds such as Heegaard Floer homology and embedded contact homology. These…
Homophily is a graph property describing the tendency of edges to connect similar nodes. There are several measures used for assessing homophily but all are known to have certain drawbacks: in particular, they cannot be reliably used for…
We describe the relation of $r$-similarity and finite-order invariants on the homotopy set $[S^1,Y]=\pi_1(Y)$.
Johnson and Livingston have characterized peripheral structures in homomorphs of knot groups. We extend their approach to the case of links. The main result is an algebraic characterization of all possible peripheral structures in certain…
We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences…