Related papers: Linear Systems on Edge-Weighted Graphs
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…
We consider the linearized Korteweg-de-Vries equa- tions, sometimes called Airy equation, on general metric graphs with edge lengths bounded away from zero. We show that pro- perties of the induced dynamics can be obtained by studying…
This paper reviews graph convolutional neural networks (GCNNs) through the lens of edge-variant graph filters. The edge-variant graph filter is a finite order, linear, and local recursion that allows each node, in each iteration, to weigh…
What are the relations between the edge weights and the topology in real-world graphs? Given only the topology of a graph, how can we assign realistic weights to its edges based on the relations? Several trials have been done for…
In algebraic geometry, there is a reduction algorithm that transforms the unreduced divisor into a unique reduced divisor, which existence is guaranteed by the Riemann-Roch theorem. We discuss application of this algorithm to construction…
In this paper we present a sufficient condition that guarantees identifiability of linear network dynamic systems exhibiting continuous-time weighted consensus protocols with acyclic structure. Each edge of the underlying network graph…
We give formulas, in terms of graph theoretical invariants, for the minimum distance and the generalized Hamming weights of the linear code generated by the rows of the incidence matrix of a signed graph over a finite field, and for those…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
We investigate the structure of a Finsler manifold of nonnegative weighted Ricci curvature including a straight line, and extend the classical Cheeger-Gromoll-Lichnerowicz splitting theorem. Such a space admits a diffeomorphic,…
The theory of Newton-Okounkov bodies attaches a convex body to a line bundle on a variety equipped with flag of subvarieties. This convex body encodes the asymptotic properties of sections of powers of the line bundle. In this paper, we…
A {\em $3$-graph} is a connected cubic graph such that each vertex is is equipped with a cyclic order of the edges incident with it. A {\em weight system} is a function $f$ on the collection of $3$-graphs which is {\em antisymmetric}:…
Networks are a useful representation for data on connections between units of interests, but the observed connections are often noisy and/or include missing values. One common approach to network analysis is to treat the network as a…
We study the problem of approximating all-pair distances in a weighted undirected graph with differential privacy, introduced by Sealfon [Sea16]. Given a publicly known undirected graph, we treat the weights of edges as sensitive…
In recent years, discrete spaces such as graphs attract much attention as models for physical spacetime or as models for testing the spirit of non-commutative geometry. In this work, we construct the differential algebras for graphs by…
Graph filters are one of the core tools in graph signal processing. A central aspect of them is their direct distributed implementation. However, the filtering performance is often traded with distributed communication and computational…
Let (G,P) be a bar framework of n vertices in general position in R^d, d <= n-1, where G is a (d+1)-lateration graph. In this paper, we present a constructive proof that (G,P) admits a positive semi-definite stress matrix with rank n-d-1.…
Sparse models for high-dimensional linear regression and machine learning have received substantial attention over the past two decades. Model selection, or determining which features or covariates are the best explanatory variables, is…
Given a graph $G$ whose edges are labeled by ideals of a commutative ring $R$ with identity, a generalized spline is a vertex labeling of $G$ by the elements of $R$ so that the difference of labels on adjacent vertices is an element of the…
We associate a graph to a possible non-zero zero-divisor in the group algebra of a torsion-free group.
An edge-weighting of a graph is called vertex-coloring if the weighted degrees yield a proper vertex coloring of the graph. It is conjectured that for every graph without isolated edge, a vertex-coloring edge-weighting with the set {1,2,3}…