Related papers: Homotopy on spatial graphs and the Sato-Levine inv…
We analyse the eigenvectors of the adjacency matrix of a random inhomogeneous graph constructed from a specified degree sequence. We assume that the empirical degree sequence has bounded mean and variance. We show that near the edges of the…
We introduce new formulas that are Vassiliev invariants of flat vertex isotopy classes of spatial 2-bouquet graphs, which are equivalent to 2-string links. Although any Gauss diagram formula of Vassiliev invariants of spatial 2-bouquet…
Following the approach to grid homology of links in $S^3$, we prove combinatorially that the grid homology of links in lens spaces defined by Baker, Grigsby, and Hedden is a link invariant. Further, using the sign assignment defined by…
Using the symplectic geometry of certain manifolds which appear naturally in Lie theory, we define an invariant which assigns a graded abelian group to an oriented link. The relevant manifolds are transverse slices to certain nilpotent…
We give rigorous foundations for parametrized homotopy theory in this monograph. After preliminaries on point-set topology, base change functors, and proper actions of non-compact Lie groups, we develop the homotopy theory of equivariant…
Discrete homotopy theory or A-homotopy theory is a combinatorial homotopy theory defined on graphs, simplicial complexes, and metric spaces, reflecting information about their connectivity. The present paper aims to further understand the…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…
A standard combinatorial construction, due to Kontsevich, associates to any A-infinity algebra with an invariant inner product, an inhomogeneous class in the cohomology of the moduli spaces of Riemann surfaces with marked points. We…
We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological…
We introduce the notion of quasi-triviality of quandles and define homology of quasi-trivial quandles. Quandle cocycle invariants are invariant under link-homotopy if they are associated with 2-cocycles of quasi-trivial quandles. We thus…
We define a notion of finite type invariants for links with a fixed linking matrix. We show that Milnor's triple link homotopy invariant is a finite type invariant, of type 1, in this sense. We also generalize the approach to Milnor's…
For every simplicial complex K there exists a vertex-transitive simplicial complex homotopy equivalent to a wedge of copies of K with some copies of the circle. It follows that every simplicial complex can occur as a homotopy wedge summand…
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
We study the asymptotics of a family of link invariants on the orbits of a smooth volume-preserving ergodic vector field on a compact domain of the 3-space. These invariants, called linear saddle invariants, include many concordance…
Generically, the set of points along which two non-singular vector fields on the three-sphere are positively (resp. negatively) collinear form a link. We prove that the two vector fields are homotopic if and only if the linking number of…
In 1993, Fenn, Rourke and Sanderson introduced rack spaces and rack homotopy invariants, and modifications to quandle spaces and quandle homotopy invariants were introduced by Nosaka in 2011. In this paper, we define the Cayley-type graph…
We consider a compact metric graph of size $\varepsilon$, and attach to it several edges (leads) of length of order one (or of infinite length). As $\varepsilon$ goes to zero, the graph $\mathcal{G}^\varepsilon$ obtained in this way looks…
We study homomorphism problems of signed graphs from a computational point of view. A signed graph $(G,\Sigma)$ is a graph $G$ where each edge is given a sign, positive or negative; $\Sigma\subseteq E(G)$ denotes the set of negative edges.…
Higher dimensional automata, i.e. labelled precubical sets, model concurrent systems. We introduce the homology graph of an HDA, which is a directed graph whose nodes are the homology classes of the HDA. We show that the homology graph is…