相关论文: Morphogenesis Across n: Overlays, Emergence Thresh…
For each positive integer $n$, let $G_n$ be the graph of integer partitions of $n$, where two partitions are adjacent if one is obtained from the other by an elementary transfer of a cell in the Ferrers diagram, followed by reordering.…
For a fixed integer $n$, let $G_n$ be the graph whose vertices are the partitions of $n$, with adjacency defined by a single elementary transfer of a cell in the Ferrers diagram. In a previous paper, the clique complex $K_n =…
We study the partition graph $G_n$, whose vertices are the integer partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts. We introduce the simplex stratification of $G_n$: for each vertex $\lambda$,…
We introduce edgewise jump invariants and gradient-type structures for the partition graph $G_n$, whose vertices are the partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts. Previous work on $G_n$…
For the partition graph $G_n$ on the set of partitions of $n$, we study the stratification induced by the local simplex dimension $\dim_{\mathrm{loc}}(\lambda)$, defined as the maximal dimension of a simplex of the clique complex…
We study the grokking phenomenon through the lens of topology. Using persistent homology on point clouds derived from the embedding matrices of a range of models trained on modular arithmetic with varying primes, we identify a clear and…
We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most…
We provide a data structure for maintaining an embedding of a graph on a surface (represented combinatorially by a permutation of edges around each vertex) and computing generators of the fundamental group of the surface, in amortized time…
We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…
We study the outer geometry of the partition graph $G_n$, focusing on its canonical front-and-side framework, the family of nontrivial rectangular partitions, and the rear structures suggested by the visible geometry of the graph. We…
Current Graph Neural Networks (GNN) architectures generally rely on two important components: node features embedding through message passing, and aggregation with a specialized form of pooling. The structural (or topological) information…
It can be shown that each permutation group $G \sqsubseteq S_n$ can be embedded, in a well defined sense, in a connected graph with $O(n+|G|)$ vertices. Some groups, however, require much fewer vertices. For instance, $S_n$ itself can be…
An embedding of a graph on a translation surface is said to be \emph{systolic} if each vertex of the graph corresponds to a singular point (or marked point) and each edge corresponds to a shortest saddle connection on the translation…
Graph embeddings play a critical role in graph representation learning, allowing machine learning models to explore and interpret graph-structured data. However, existing methods often rely on opaque, high-dimensional embeddings, limiting…
The graph structure is a commonly used data storage mode, and it turns out that the low-dimensional embedded representation of nodes in the graph is extremely useful in various typical tasks, such as node classification, link prediction ,…
In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
We introduce the notion of translational Riemannian manifolds and define a Gauss map for orientable immersed hypersurfaces lying in these ambients, an associated translational curvature and prove a Gauss-Bonnet theorem. We also use this…
We study the degree landscape of the partition graph $G_n$, whose vertices are the integer partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts, followed by reordering. Using the previously…
Multi-graph learning is crucial for extracting meaningful signals from collections of heterogeneous graphs. However, effectively integrating information across graphs with differing topologies, scales, and semantics, often in the absence of…