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

Let $M$ denote a low-dimensional manifold embedded in Euclidean space and let ${X}= \{ x_1, \dots, x_n \}$ be a collection of points uniformly sampled from it. We study the relationship between the curvature of a random geometric graph…

The existing research on robust Graph Neural Networks (GNNs) fails to acknowledge the significance of directed graphs in providing rich information about networks' inherent structure. This work presents the first investigation into the…

Massive deployment of Graph Neural Networks (GNNs) in high-stake applications generates a strong demand for explanations that are robust to noise and align well with human intuition. Most existing methods generate explanations by…

A graph $\Gamma$ is said to be stable if $\mathrm{Aut}(\Gamma\times K_2)\cong\mathrm{Aut}(\Gamma)\times \mathbb{Z}_{2}$ and unstable otherwise. If an unstable graph is connected, non-bipartite and any two of its distinct vertices have…

We consider a $\varphi$-rigidity property for divergence-free vector fields in the Euclidean $n$-space, where $\varphi(t)$ is a non-negative convex function vanishing only at $t=0$. We show that this property is always satisfied in…

Contrastive learning (CL) has emerged as a powerful framework for learning representations of images and text in a self-supervised manner while enhancing model robustness against adversarial attacks. More recently, researchers have extended…

Liu, M\"unch, and Peyerimhoff introduced the notion of Bakry-\'Emery curvature for connection graphs as a means to derive Buser-type bounds on the eigenvalues of connection Laplacians. In this work, we present a reformulation of the…

We introduce a novel definition of curvature for hypergraphs, a natural generalization of graphs, by introducing a multi-marginal optimal transport problem for a naturally defined random walk on the hypergraph. This curvature, termed…

We revisit the concept of minimal rigidity as applied to soft repulsive, frictionless sphere packings in two-dimensions with the introduction of the jamming graph. Minimal rigidity is a purely combinatorial property encoded via Laman's…

This paper deals with the question of prescribing the Gaussian curvature on a disk and the geodesic curvature of its boundary by means of a conformal deformation of the metric. We restrict ourselves to a symmetric setting in which the…

The purpose of this paper is to infer a global (collective) model of time-varying responses of a set of nodes as a dynamic graph, where the individual time series are respectively observed at each of the nodes. The motivation of this work…

The existence of adversarial examples has led to considerable uncertainty regarding the trust one can justifiably put in predictions produced by automated systems. This uncertainty has, in turn, lead to considerable research effort in…

This work analyzes Graph Neural Networks, a generalization of Fully-Connected Deep Neural Nets on Graph structured data, when their width, that is the number of nodes in each fullyconnected layer is increasing to infinity. Infinite Width…

In this paper, we study curvature dimension conditions on birth-death processes which correspond to linear graphs, i.e., weighted graphs supported on the infinite line or the half line. We give a combinatorial characterization of Bakry and…

We study Forman--Ricci and effective resistance curvatures on the skeleta of convex polytopes. Our guiding questions are: how frequently do polytopal graphs exhibit everywhere positive curvature, and what structural constraints does…

We investigate how to find generic and globally rigid realizations of graphs in $\mathbb{R}^d$ based on elementary geometric observations. Our arguments lead to new proofs of a combinatorial characterization of the global rigidity of graphs…

In hep-th/9910245, Witten and Yau consider the AdS/CFT correspondence in the context of a Riemannian Einstein manifold $M^{n+1}$ of negative Ricci curvature which admits a conformal compactification with conformal boundary $N^n$. They prove…

Considerable recent attention has been given to the study of shape formation using modern responsive materials that can be preprogrammed to undergo spatially inhomogeneous local deformations. In particular, nematic liquid crystal polymer…

This work considers the robustness of uncertain consensus networks. The first set of results studies the stability properties of consensus networks with negative edge weights. We show that if either the negative weight edges form a cut in…

Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured…