Related papers: A graph theoretical Gauss-Bonnet-Chern Theorem

From the point of view of index theory, we give a simple proof of a Gauss-Bonnet-Chern formula for all Finsler manifolds by the Cartan connection. Based on this, we establish a Gauss-Bonnet-Chern formula for any metric-compatible connection…

Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{\'e}onard by replacing W2-Wasserstein geodesics by Schr{\"o}odinger bridges in the definition of entropic curvature [23, 25, 24].…

In this paper, we present a novel way to summarize the structure of large graphs, based on non-parametric estimation of edge density in directed multigraphs. Following coclustering approach, we use a clustering of the vertices, with a…

A notion of curvature is introduced in multivariable operator theory and an analogue of the Gauss-Bonnet-Chern theorem is established for graded (contractive) Hilbert modules over the complex polynomial algebra in d variables, d=1,2,3,....…

Let M be a bounded domain of a Euclidian space with smooth boundary. We relate the Cheeger constant of M and the conductance of a neighborhood graph defined on a random sample from M. By restricting the minimization defining the latter over…

Assume that $G$ is a finite group and let $a$ and $b$ be non-negative integers. We define an undirected graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and…

Not every graph has an Eulerian tour. But every finite, strongly connected graph has a multi-Eulerian tour, which we define as a closed path that uses each directed edge at least once, and uses edges e and f the same number of times…

Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…

A total weighting of a graph $G$ is a mapping $\phi$ that assigns a weight to each vertex and each edge of $G$. The vertex-sum of $v \in V(G)$ with respect to $\phi$ is $S_{\phi}(v)=\sum_{e\in E(v)}\phi(e)+\phi(v)$. A total weighting is…

Let $G$ be a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. A $k$-matching of a graph $G$ is a function $f:E(G)\rightarrow \{0,1,\ldots, k\}$ satisfying $\sum_{e \in E_G(v)} f(e) \leq k$ for every vertex $v \in V(G)$,…

A gravitational potential has the spherical property when the field outside any uniform spherical shell is indistinguishable from that of a point mass at the center. We present the general potentials that possess this property on constant…

It has been argued by Witten and others that in the presence of a nontrivial B-field, D-brane charges in type IIB string theories are measured by twisted K-theory. In joint work with Bouwknegt, Carey and Murray it was proved that twisted…

We compute the Euler characteristics of the generalized Kummer schemes associated to $A\times Y$, where $A$ is an abelian variety and $Y$ is a smooth quasi-projective variety. When $Y$ is a point, our results prove a formula conjectured by…

As an application of the Bochner formula, we prove that if a $2$-dimensional Riemannian manifold admits a non-trivial smooth tangent vector field $X$ then its Gauss curvature is the divergence of a tangent vector field, constructed from…

Graph neural networks (GNNs) are a popular class of machine learning models whose major advantage is their ability to incorporate a sparse and discrete dependency structure between data points. Unfortunately, GNNs can only be used when such…

For a graph $G$, denote by $t_r(G)$ (resp. $b_r(G)$) the maximum size of a $K_r$-free (resp. $(r-1)$-partite) subgraph of $G$. Of course $t_r(G) \geq b_r(G)$ for any $G$, and Tur\'an's Theorem says that equality holds for complete graphs.…

This is a note on three graph parameters motivated by the Euler-Poincare characteristic for simplicial complex. We show those three graph parameters of a given connected graph $G$ is greater than or equal to that of the complete graph with…

We prove a version of the result in the title that makes use of maximal coactions in the context of discrete groups. Earlier Gauge-Invariant Uniqueness theorems for $C^*$-algebras associated to $P$-graphs and similar $C^*$-algebras…

A graph $G$ is said to be \emph{determined by its spectrum} if any graph having the same spectrum as $G$ is isomorphic to $G$. Let $K_n \setminus P_{\ell}$ be the graph obtained from $K_n$ by removing edges of $P_\ell$, where $P_\ell$ is a…

Given a collection $\mathcal{G}=(G_1,\dots, G_h)$ of graphs on the same vertex set $V$ of size $n$, an $h$-edge graph $H$ on the vertex set $V$ is a $\mathcal{G}$-transversal if there exists a bijection $\lambda : E(H) \rightarrow [h]$ such…