相关论文: Node resistance curvature in Cartesian graph produ…

Graph Neural Networks (GNNs) are powerful tools in representation learning for graphs. However, recent studies show that GNNs are vulnerable to carefully-crafted perturbations, called adversarial attacks. Adversarial attacks can easily fool…

We show that arising out of noncmmutatve geometry is a natural family of {\em edge Laplacians} on the edges of a graph. The family includes a canonical edge Laplacian associated to the graph, extending the usual graph Laplacian on vertices,…

We define the total curvature of a semialgebraic embedding of a graph in the 3-dimensional Euclidean space. We prove that it satisfies a Chern-Lashof type inequality and we describe when the equality holds. We also prove a generalization of…

In the paper we deal with shells with non-zero Gaussian curvature. We derive sharp Korn's first (linear geometric rigidity estimate) and second inequalities on that kind of shells for zero or periodic Dirichlet, Neumann, and Robin type…

It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…

In this paper, we study combinatorial properties of stable curves. To the dual graph of any nodal curve, it is naturally associated a group, which is the group of components of the N\'eron model of the generalized Jacobian of the curve. We…

We study the problem of adversarially robust self-supervised learning on graphs. In the contrastive learning framework, we introduce a new method that increases the adversarial robustness of the learned representations through i)…

In this paper, anti-van der Waerden numbers on Cartesian products of graphs are investigated and a conjecture made by Schulte, et al (see arXiv:1802.01509) is answered. In particular, the anti-van der Waerden number of the Cartesian product…

Given that no existing graph construction method can generate a perfect graph for a given dataset, graph-based algorithms are often affected by redundant and erroneous edges present within the constructed graphs. In this paper, we view…

We prove explicit upper and lower bounds for the torsional rigidity of extrinsic domains of submanifolds P^m with controlled radial mean curvature in ambient Riemannian manifolds N^n with a pole p and with sectional curvatures bounded from…

The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be solved in polynomial time for graphs with bounded thinness,…

We study the mean curvature flow of graphs both with Neumann boundary conditions and transport terms. We derive boundary gradient estimates for the mean curvature flow. As an application, the existence of the mean curvature flow of graphs…

An $n$-dimensional manifold $M$ ($n\ge 3$) is called {\it generalized graph manifold} if it is glued of blocks that are trivial bundles of $(n-2)$-tori over compact surfaces (of negative Euler characteristic) with boundary. In this paper…

Homophily is a graph property describing the tendency of edges to connect similar nodes. There are several measures used for assessing homophily but all are known to have certain drawbacks: in particular, they cannot be reliably used for…

In this paper, we study the mean curvature flow of graphs with Neumann boundary condition. The main aim is to use the maximum principle to get the boundary gradient estimate for solutions. In particular, we obtain the corresponding…

Kirkpatrick et al. [ALT 2019] and Fallat et al. [JMLR 2023] introduced non-clashing teaching and proved that it is the most efficient batch machine teaching model satisfying the collusion-avoidance benchmark established in the seminal work…

Ricci curvature was proposed by Ollivier in a general framework of metric measure spaces, and it has been studied extensively in the context of graphs in recent years. In this paper we prove upper bounds for Ollivier's Ricci curvature for…

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…

Using a combination of theory and experiments we study the interface between two immiscible domains in a colloidal membrane composed of rigid rods of different lengths. Geometric considerations of rigid rod packing imply that a domain of…

A cursory reading of the literature suggests that we have made a lot of progress in designing effective adversarial defenses for Graph Neural Networks (GNNs). Yet, the standard methodology has a serious flaw - virtually all of the defenses…