Related papers: ProPs of graphs and generalised traces
We explain how a simple twisting of the notion of spectral triple allows to incorporate type III examples, such as those arising from the transverse geometry of codimension one foliations. Since the twisting of the commutators turns the…
The Reeb space of a continuous map is the space of all (elements representing) connected components of preimages endowed with the quotient topology induced from the natural equivalence relation on the domain. These objects are strong tools…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions. Due to its combinatorial nature, many approximate solutions have been developed, including…
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecular structures are mined to discover fragments useful as…
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has been extensively studied, due to both its interesting structure…
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.…
A family of permutations called 2-clumped permutations forms a basis for a sub-Hopf algebra of the Malvenuto-Reutenauer Hopf algebra of permutations. The 2-clumped permutations are in bijection with certain decompositions of a square into…
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
In our paper, we introduce special-generic-like maps or SGL maps as smooth maps and study their several algebraic topological and differential topological properties. The new class generalize the class of so-called special generic maps.…
The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
Full Bayesian computational inference for model determination in undirected graphical models is currently restricted to decomposable graphs, except for problems of very small scale. In this paper we develop new, more efficient methodology…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this "fractal" property contributes to the spectacular properties of the homomorphism…
We compare quasi-graphs and generalized $\sin(1/x)$-type continua, which are two classes of continua that generalize topological graphs and contain the Warsaw circle as a nontrivial common element. We show that neither class is a subset of…
We study generalizations of pre-Lie algebras, where the free objects are based on rooted trees which edges are typed, instead of usual rooted trees, and with generalized pre-Lie products formed by graftings. Working with a discrete set of…
In a recent paper published in Nature, Y.I. Sobolev et al. introduced the concept of trajectoids: convex, rigid objects, which roll without slip or spin on a flat plane along a prescribed periodic, unbounded planar path. A geometric…
Attributed graph clustering is challenging as it requires joint modelling of graph structures and node attributes. Recent progress on graph convolutional networks has proved that graph convolution is effective in combining structural and…
We extend the notions of nonautonomous dynamics to arbitrary groups, through groupoid morphisms. This also presents a generalization of classic dynamical systems and group actions. We introduce the structure of cotranslations, as a specific…