arXiv research

HYPA-DBGNN detects anomalous sequential patterns in temporal graphs.

We present a comprehensive study of utility function of the minority game in its efficient regime. We develop an effective description of state of the game. For the payoff function $g(x)=\sgn (x)$ we explicitly represent the game as the Markov process and prove the finitness of number of states. We also demonstrate bou…

A graph multilink is a link with multiplicities in a homology 3-sphere whose exterior is a graph manifold. In this Note, we compute the Novikov homology of graph multilinks. As a corollary, we give a majoration for the number of Novikov modules on a given graph link.

DE improves GNNs by distinguishing graph substructures, enhancing accuracy.

In this communication, we describe some interrelations between generalized $q$-entropies and a generalized version of Fisher information. In information theory, the de Bruijn identity links the Fisher information and the derivative of the entropy. We show that this identity can be extended to generalized versions of en…

The paper extends Hodge-de Rham theory to higher-dimensional Sierpinski gaskets.

Graph theory connects automorphisms to cohomology.

We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to decompose a graph into a set of possibly overlapping clusters, de ned as well-connected subsets of vertices. The decomposition is based on a s…

Goresky, Kottwitz and MacPherson have recently shown that the computation of the equivariant cohomology ring of a G-manifold can be reduced to a computation in graph theory. This opens up the possibility that many of the fundamental theorems in equivariant de Rham theory may, on closer inspection, turn out simply to be…

New constructions from non-separating planar graphs improve understanding of graph linkability and knotability.

The Sinkhorn flow is a gradient flow in a nonlocal Wasserstein geometry.

A celebrated conjecture due to De Giorgi states that any bounded solution of the equation $Δu + (1-u^2) u = 0 \hbox{in} \R^N$ with $\pp_{y_N}u >0$ must be such that its level sets $\{u=\la\}$ are all hyperplanes, {\em \bf at least} for dimension $N\le 8$. A counterexample for $N\ge 9$ has long been believed to exist. …

We study the gordian graph of all knots in $\R^3$: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement of any finite subset is connected.

Study area-minimizing subgraphs in integer lattices.

For a Riemannian polyhedra, we study the geometry of the unit ball for the unidimensional stable norm (stable ball). In the case of a unidimensional Riemannian polyhedra (graph), we show that the stable ball is a polytope whose vertices are completely described by combinatorial properties of the graph. We study then th…

Paper proves flatness of anisotropic minimal graphs in half-spaces.

Study of mean curvature flow in de Sitter space, showing convergence to flat slicing.

3028 obstructions found for embedding without knots.

The natural habitat of most Bayesian methods is data represented by exchangeable sequences of observations, for which de Finetti's theorem provides the theoretical foundation. Dirichlet process clustering, Gaussian process regression, and many other parametric and nonparametric Bayesian models fall within the remit of …

We prove the existence of global minimizers of Allen-Cahn equation in dimensions $8$ and above. More precisely, given any strictly area-minimizing Lawson's cones, there are global minimizers whose nodal sets are asymptotic to the cones. As a consequence of Jerison-Monneau's program we establish the existence of many co…

Tête-à-tête graphs and relative tête-à-tête graphs were introduced by N. A'Campo in 2010 to model monodromies of isolated plane curves. By recent workof Fdez de Bobadilla, Pe Pereira and the author, they provide a way of modeling the periodic mapping classes that leave some boundary component invariant. In this work we…

This article presents some methods to control the bottom of the spectrum of the Laplacian $λ_0$ on hyperbolic surfaces with infinite volume. Our first result bounds the $λ_0$ of a geometrically finite surface in terms of the geometry of its convex core. We then focus on infinite type periodic hyperbolic surfaces built …

Study finds maximal linklessly embeddable graphs up to 11 vertices and their complements.

Community detection in graphs has been the subject of many algorithms. Recent methods want to optimize a modularity function which shows a maximum of relationships within communities and found a minimum of inter-community relations. these algorithms are applied to unipartite, multipartite and directed graphs. However, …

The study compares lamplighter graphs up to quasi-isometry using coarse topology.

We give upper bounds on the principal curvatures of a maximal surface of nonpositive curvature in three-dimensional Anti-de Sitter space, which only depend on the width of the convex hull of the surface. Moreover, given a quasisymmetric homeomorphism $φ$, we study the relation between the width of the convex hull of th…

Fixed points found in Teichmüller space via anti-de Sitter geometry.

Paper proposes a novel graph recovery attack from node embeddings.

A world sheet in anti-de Sitter space is a timelike submanifold consisting of a one-parameter family of spacelike submanifolds. We consider the family of lightlike hypersurfaces along spacelike submanifolds in the world sheet. The locus of the singularities of lightlike hypersurfaces along spacelike submanifolds forms …

Advanced GNNs improve molecular generation models.

We study global monotone solutions of the free boundary problem that arises from minimizing the energy functional $I(u) = \int |\nabla u|^2 + V(u)$, where $V(u)$ is the characteristic function of the interval $(-1,1)$. This functional is a close relative of the scalar Ginzburg-Landau functional $J(u) = \int |\nabla u|^…

Graph attention networks improve performance on heterogeneous graphs.

We present some applications of ideas from partial differential equations and differential geometry to the study of difference equations on infinite graphs. All operators that we consider are examples of "elliptic operators" as defined by Y. Colin de Verdiere. For such operators, we discuss analogs of inequalities of C…

The paper connects Weil-Petersson homeomorphisms to maximal surfaces in anti-de Sitter space.

Graph autoencoders (AE) and variational autoencoders (VAE) recently emerged as powerful node embedding methods, with promising performances on challenging tasks such as link prediction and node clustering. Graph AE, VAE and most of their extensions rely on graph convolutional networks (GCN) to learn vector space repres…

New findings on QHD smoothing for graphs with 3 or 4 large nodes.

Every graph can be represented as a singular set of a special surface.

Within many real-world networks the links between pairs of nodes change over time. Thus, there has been a recent boom in studying temporal graphs. Recognizing patterns in temporal graphs requires a proximity measure to compare different temporal graphs. To this end, we propose to study dynamic time warping on temporal …

The paper presents a new method to represent directed graphs using pseudo-Riemannian manifolds.

The mapping class group $Γ$ of the complement of a Cantor set in the plane arises naturally in dynamics. We show that the ray graph, which is the analog of the complex of curves for this surface of infinite type, has infinite diameter and is hyperbolic. We use the action of $Γ$ on this graph to find an explicit non tri…

Alternative proof and extension of curvature estimates for minimal immersions.

We study that the $n-$graphs defining by smooth map $f:\Om\subset \ir{n}\to \ir{m}, m\ge 2,$ in $\ir{m+n}$ of the prescribed mean curvature and the Gauss image. We derive the interior curvature estimates $$\sup_{D_R(x)}|B|^2\le\f{C}{R^2}$$ under the dimension limitations and the Gauss image restrictions. If there is no…

A characterization of the foliation by spacelike slices of an $(n+1)$-dimensional spatially closed Generalized Robertson-Walker spacetime is given by means of studying a natural mean curvature type equation on spacelike graphs. Under some natural assumptions, of physical or geometric nature, all the entire solutions of…

Seminal works on graph neural networks have primarily targeted semi-supervised node classification problems with few observed labels and high-dimensional signals. With the development of graph networks, this setup has become a de facto benchmark for a significant body of research. Interestingly, several works have rece…

These notes are the English version of the paper "Hyperbolicité du graphe des rayons et quasi-morphismes sur un gros groupe modulaire". The mapping class group Gamma of the complement of a Cantor set in the plane arises naturally in dynamics. We show that the ray graph, which is the analog of the complex of curves for …

A guide to using low-pass graph filters for network data.

We prove that any weakly acausal curve $Γ$ in the boundary of Anti-de Sitter (2+1)-space is the asymptotic boundary of two spacelike $K$-surfaces, one of which is past-convex and the other future-convex, for every $K\in(-\infty,-1)$. The curve $Γ$ is the graph of a quasisymmetric homeomorphism of the circle if and only…

We calculate the RT-invariants of all oriented Seifert manifolds directly from surgery presentations. We work in the general framework of an arbitrary modular category as in [V. G. Turaev, Quantum invariants of knots and 3--manifolds, de Gruyter Stud. Math. 18, Walter de Gruyter (1994)], and the invariants are expresse…