Related papers: Connes embeddability of graph products

We prove that, if $C$ is a smooth projective curve over the complex numbers, and $E$ is a stable vector bundle on $C$ whose slope does not lie in the interval $[-1,n-1]$, then the associated tautological bundle $E^{[n]}$ on the symmetric…

We show that Connes' embedding problem for II_1-factors is equivalent to a statement about distributions of sums of self-adjoint operators with matrix coefficients. This is an application of a linearization result for finite von Neumann…

We prove that every class of graphs $\mathscr C$ that is monadically stable and has bounded twin-width can be transduced from some class with bounded sparse twin-width. This generalizes analogous results for classes of bounded linear…

Graph embedding methods embed the nodes in a graph in low dimensional vector space while preserving graph topology to carry out the downstream tasks such as link prediction, node recommendation and clustering. These tasks depend on a…

Let $X$ be a connected Cayley graph on an abelian group of odd order, such that no two distinct vertices of $X$ have exactly the same neighbours. We show that the direct product $X \times K_2$ (also called the "canonical double cover" of…

In this paper we introduce the notion of the stability of a sequence of modules over Hecke algebras. We prove that a finitely generated consistent sequence associated with Hecke algebras is representation stable.

We extend the characterization of stable subgroups of right-angled Artin groups of Koberda, Mangahas and Taylor to the case of graph products of infinite groups. Specifically, we show that the stable subgroups of such graph products are…

We prove that graph products of sofic groups are sofic, as are graphs of groups for which vertex groups are sofic and edge groups are amenable.

These notes are a self-contained short proof of the stability of persistence diagrams.

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

Graph is an important data representation which appears in a wide diversity of real-world scenarios. Effective graph analytics provides users a deeper understanding of what is behind the data, and thus can benefit a lot of useful…

The network embedding problem that maps nodes in a graph to vectors in Euclidean space can be very useful for addressing several important tasks on a graph. Recently, graph neural networks (GNNs) have been proposed for solving such a…

We confirm the equitable $\Delta$-coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable colorability about square (or Cartesian) and cross (or…

An ordinary voltage graph embedding of a graph in a surface encodes a certain kind of highly symmetric covering space of that surface. Given an ordinary voltage graph embedding of a graph $G$ in a surface with voltage group $A$ and a…

We consider graphical solutions to mean curvature flow and obtain a stability result for homothetically expanding solutions coming out of cones of positive mean curvature: If another solution is initially close to the cone at infinity, then…

In this paper we want to apply the notion of product between ultrafilters to answer several questions which arise around the Connes' embedding problem. For instance, we will give a simplification and generalization of a theorem by…

A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph…

We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…

We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…

In this paper, based on the embedded homology groups of hypergraphs defined in \cite{h1}, we define the product of hypergraphs and prove the corresponding K\"{u}nneth formula of hypergraphs which can be generalized to the K\"{u}nneth…