相关论文: Confluence Theory for Graphs

Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…

It is shown that graphs that generalize the ADE Dynkin diagrams and have appeared in various contexts of two-dimensional field theory may be regarded in a natural way as encoding the geometry of a root system. After recalling what are the…

We introduce a homology theory for k-graphs and explore its fundamental properties. We establish connections with algebraic topology by showing that the homology of a k-graph coincides with the homology of its topological realisation as…

We show that Caratheodory's conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f: R^2-->R whose gradient decays uniformly faster than…

Gauss' classical reduction theory for indefinite binary quadratic forms over $\mathbb{Z}$ has originally been proven by means of purely algebraic and arithmetic considerations. It was later discovered that this reduction theory is closely…

Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…

In this paper, we prove a sharp convergence theorem for the mean curvature flow of arbitrary codimension in spheres which improves Baker's convergence theorem. In particular, we obtain a new differentiable sphere theorem for submanifolds in…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

Relationship between agents can be conveniently represented by graphs. When these relationships have different modalities, they are better modelled by multilayer graphs where each layer is associated with one modality. Such graphs arise…

We consider classical curvature flows: 1-parameter families of convex embeddings of the 2-sphere into Euclidean 3-space which evolve by an arbitrary (non-homogeneous) function of the radii of curvature. The associated flow of the radii of…

The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed graphs into members of the sequence…

We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph.…

Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of…

For each Frobenius algebra there is defined a skein module of surfaces embedded in a given 3-manifold and bounding a prescribed curve system in the boundary. The skein relations are local and generate the kernel of a certain natural…

Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. We consider a relaxed version of this problem in the setting of local algorithms. The relaxation is that the constructed subgraph is a sparse spanning…

Modern graph or network datasets often contain rich structure that goes beyond simple pairwise connections between nodes. This calls for complex representations that can capture, for instance, edges of different types as well as so-called…

Machine Learning for graphs is nowadays a research topic of consolidated relevance. Common approaches in the field typically resort to complex deep neural network architectures and demanding training algorithms, highlighting the need for…

We provide a visual and intuitive introduction to effectively calculating in 2-groups along with explicit examples coming from non-abelian 1- and 2-form gauge theory. In particular, we utilize string diagrams, tools similar to tensor…

We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs.…

A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected $2$-complex every link graph of which is 3-connected…