Related papers: Weighted Analytic Torsion for Weighted Digraphs

Graph Neural Networks (GNNs) have been widely used to learn representations on graphs and tackle many real-world problems from a wide range of domains. In this paper we propose wsGAT, an extension of the Graph Attention Network (GAT)…

The connections in many networks are not merely binary entities, either present or not, but have associated weights that record their strengths relative to one another. Recent studies of networks have, by and large, steered clear of such…

For a non-compact hyperbolic 3-manifold with cusps we prove an explicit formula that relates the regularized analytic torsion associated to the even symmetric powers of the standard representation of SL_2(C) to the corresponding…

We consider infinite weighted graphs $G$, i.e., sets of vertices $V$, and edges $E$ assumed countable infinite. An assignment of weights is a positive symmetric function $c$ on $E$ (the edge-set), conductance. From this, one naturally…

Suppose you are given a graph $G=(V,E)$ with a weight assignment $w:V\rightarrow\mathbb{Z}$ and that your objective is to modify $w$ using legal steps such that all vertices will have the same weight, where in each legal step you are…

Gr\"otschel, Lov\'asz, and Schrijver generalized the Lov\'asz $\vartheta$ function by allowing a weight for each vertex. We provide a similar generalization of Duan, Severini, and Winter's $\tilde{\vartheta}$ on non-commutative graphs.…

Two problems in the search of metric characteristics on weighted undirected graphs with non-negative edge weights are being considered. The first problem: a weighted undirected graph with non-negative edge weight is given. The radius,…

Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…

We construct a canonical element, called the refined analytic torsion, of the determinant line of the cohomology of a closed oriented odd-dimensional manifold M with coefficients in a flat complex vector bundle E. We compute the Ray-Singer…

We introduce the weighted random graph (WRG) model, which represents the weighted counterpart of the Erdos-Renyi random graph and provides fundamental insights into more complicated weighted networks. We find analytically that the WRG is…

Consider the setting of \emph{randomly weighted graphs}, namely, graphs whose edge weights are chosen independently according to probability distributions with finite support over the non-negative reals. Under this setting, properties of…

In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…

This paper introduces a novel and generic framework to solve the flagship task of supervised labeled graph prediction by leveraging Optimal Transport tools. We formulate the problem as regression with the Fused Gromov-Wasserstein (FGW) loss…

We extend the definition of analytic and Reidemeister torsion from closed compact Riemannian manifolds to compact Riemannian manifolds with boundary $(M, \partial M)$, given a flat bundle $\Cal F$ of $\Cal A$-Hilbert modules of finite type…

For a graph $G=(V,E)$, assigning each edge $e\in E$ a weight of a dual number $w(e)=1+\widehat{a}_{e}\varepsilon$, the weighted graph $G^{w}=(V,E,w)$ is called a dual number weighted graph, where $-\widehat{a}_{e}$ can be regarded as the…

Feng--Huang (2016) introduced weighted topological entropy and pressure for factor maps between dynamical systems and established its variational principle. Tsukamoto (2022) redefined those invariants quite differently for the simplest case…

Based on the large N duality relating topological string theory on Calabi-Yau 3-folds and Chern-Simons theory on 3-manifolds, M. Aganagic, A. Klemm, M. Marino and C. Vafa proposed the topological vertex (hep-th/0305132), an algorithm on…

A semi-proper orientation of a given graph $G$, denoted by $(D,w)$, is an orientation $D$ with a weight function $w: A(D)\rightarrow \mathbb{Z}_+$, such that the in-weight of any adjacent vertices are distinct, where the in-weight of $v$ in…

Let $\mathcal{T}_{+}(E)$ be the tensor algebra of a $W^{*}$-correspondence $E$ over a $W^{*}$-algebra $M$. In earlier work, we showed that the completely contractive representations of $\mathcal{T}_{+}(E)$, whose restrictions to $M$ are…

We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…