New invariants distinguish spatial graphs not previously possible.
problem Distinguishing spatial graphs using Dehn colorings.
method Developed vertex-weight invariants based on Dehn colorings.
result Found spatial graphs distinguishable by vertex-weight invariants.
The paper explores weight systems and their applications to graph and embedded graph invariants.
problem Developing weight systems for graphs and embedded graphs.
method Construction of weight systems from graph invariants and metrized Lie algebras, and extending to arbitrary embedded graphs.
result Explicit forms of generating functions and recurrence relations for weight systems on chord diagrams and embedded graphs.
Optimal Euclidean structure minimizes energy in weighted toroidal graphs.
problem Finding the optimal Euclidean structure for weighted toroidal graphs.
method Minimizing Dirichlet energy over all possible Euclidean structures and realizations within a fixed homotopy class.
result The optimal Euclidean structure induces a weighted Delaunay decomposition.
Improved text summarization using belief propagation on weighted bipartite graphs.
problem Text summarization from a graph theory perspective.
method Generalized belief propagation algorithm for weighted bipartite graphs.
result Our algorithm outperforms greedy methods in text summarization tasks.
Paper extends Steklov eigenvalue estimate to weighted graphs.
problem Steklov eigenvalue estimation on weighted graphs.
method Extended Perrin's estimate to general weighted graphs.
result Characterized rigidity of the extended estimate.
The paper aims at proving global height estimates for Killing graphs defined over a complete manifold with nonempty boundary. To this end, we first point out how the geometric analysis on a Killing graph is naturally related to a weighted manifold structure, where the weight is defined in terms of the length of the Kil…
Existence and uniqueness theorem for Ricci flow on weighted graphs proved.
problem Existence and uniqueness of solutions to Ricci flow equations on weighted graphs.
method Continuous time normalized Ricci flow approach.
result Existence and uniqueness theorem for solutions to Ricci flow on weighted graphs.
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily modified to handle graphs with weighted vertices. We present formulas that simp…
Random weights in GNNs match learned weights in performance.
problem Feature rank collapse in GNNs.
method Replacing learned weights with random weights.
result Random weights achieve comparable performance to learned weights, reducing training time and memory usage.
The paper extends RDPG model to handle weighted graphs, enabling better analysis of network data.
problem Modeling networks with weighted edges to capture heterogeneous weight distributions.
method Proposes a nonparametric W-RDPG model with latent positions and moment-generating functions.
result Establishes statistical guarantees for estimating nodal latent positions and sampling graphs.
Recent advancements in deep neural networks for graph-structured data have led to state-of-the-art performance on recommender system benchmarks. In this work, we present a Graph Convolutional Network (GCN) algorithm SWAG (Sample Weight and AGgregate), which combines efficient random walks and graph convolutions on weig…
ARGEW improves node embeddings for weighted homophilous graphs by emphasizing strong edge weights.
problem Lack of accurate node embeddings for weighted homophilous graphs.
method ARGEW (Augmentation of Random walks by Graph Edge Weights) augments random walks by emphasizing nodes with larger edge weights.
result ARGEW produces embeddings where node pairs with strong edge weights have closer embeddings.
New method estimates Nishimori temperature for node classification in weighted graphs.
problem Estimating Nishimori temperature for Bayesian inference.
method Spectral method using eigenvalues of Bethe Hessian matrix.
result Spectral method outperforms existing approaches in node classification.
Formula for sl2 weight system on complete bipartite graphs.
problem Computing values of sl2 weight system for chord diagrams. method Chmutov-Varchenko recurrence relation, Hopf algebra projections.
result Computed values for chord diagrams with complete bipartite intersection graphs.
In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a more convenient manner. Since the weighted Laplacian strategy inherits the virtu…
Constructs a 4-invariant for graphs at c = 3/8.
problem No specific problem stated; focuses on construction.
method Constructs a 4-invariant that extends a specialization of the sl(2)-weight system at c = 3/8, satisfying a deletion-contraction relation.
result Satisfies a simple deletion-contraction relation.
Online CPD for weighted and directed graphs using RDPG model.
problem Monitoring and detecting changes in weighted and directed graph data.
method Spectral embeddings of RDPG models for online updates and error-rate control.
result A lightweight online CPD algorithm with improved detection resolution and delay.
Flow preserves curvature sharpness on weighted graphs.
problem Curvature flow on weighted graphs.
method Adapting Bakry-Émery calculus for Markovian preservation and analyzing limits.
result Flow limits to curvature sharp weighted graphs.
New graph kernel for weighted directed networks using functor homology.
problem Studying weighted directed networks with functor homology.
method Proposes a new homological method to define graph kernels for weighted directed graphs.
result Defined a new graph kernel for weighted directed graphs.
Extends graph encoder embedding to weighted graphs and matrices.
problem Classifying vertices in various graph types efficiently.
method Graph encoder embedding applied to weighted graphs, distance matrices, and kernel matrices.
result The method achieves asymptotic normality, enabling optimal classification.
We give a detailed explicit computation of weights of Kontsevich graphs which arise from connection and curvature terms within the globalization picture for the special case of symplectic manifolds. We will show how the weights for the curvature graphs can be explicitly expressed in terms of the hypergeometric function…
We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graph, and show that these weight systems are related to the weight systems induced by the Conway a…
Paper explores exact recovery of communities in weighted graphs using Gaussian and exponential distributions.
problem Exact recovery of communities in weighted graphs with Gaussian and exponential distributions.
method Introduces a new semi-metric to describe conditions for exact recovery and analyzes conditions for both complete and incomplete graphs.
result Necessary and sufficient conditions for exact recovery are asymptotically tight and applicable to both complete and incomplete graphs.
Bayesian SSR on graphs improves regression with noisy labels.
problem Estimating function values on graphs from noisy labeled data.
method Bayesian approach using graph Laplacian and Gaussian prior.
result Rates of contraction of posterior measure around ground truth.
Flow on weighted graphs sharpens Bakry-Émery curvature.
problem Sharp curvature in weighted graphs.
method Bakry-Émery curvature flow on mixed weighted graphs.
result Limits of curvature flow are curvature sharp.
Novel Haar-Laplacian for directed graphs enhances spectral graph applications.
problem Lack of suitable Laplacian for directed graphs in spectral graph theory.
method Inspired by Haar-like transformation, introduces a Hermitian matrix preserving direction and weight.
result HaarNet outperforms in weight prediction and denoising on directed graphs.
As a model problem for clustering, we consider the densest k-disjoint-clique problem of partitioning a weighted complete graph into k disjoint subgraphs such that the sum of the densities of these subgraphs is maximized. We establish that such subgraphs can be recovered from the solution of a particular semidefinite re…
Paper uses GNN and conformal prediction for accurate edge weight prediction.
problem Predicting edge weights on graphs for various applications.
method Graph Neural Network (GNN) with conformal prediction and error reweighting.
result Our method provides better coverage and efficiency than baselines.
We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph. This leads to a characterization of chordal graphs via deletions of a sequence of exposed edges from a complete graph. Most interesti…
We show that the adjacency matrices of the intersection graphs of chord diagrams satisfy the 2-term relations of Bar-Natan and Garoufalides [bg], and hence give rise to weight systems. Among these weight systems are those associated with the Conway and HOMFLYPT polynomials. We extend these ideas to looking at a space o…
Holonomy-preserving transformations help recover Alexander polynomials from graph zeta functions.
problem Recovering Alexander polynomials from graph zeta functions.
method Introducing holonomy to preserve zeta functions of matrix-weighted graphs and extending to group elements and quandles.
result Holonomy-preserving transformations correspond to transformations of group presentations and preserve the twisted Alexander polynomial.
Algorithms compute length spectra of torus graphs efficiently.
problem Computing length spectra of graphs embedded on a torus.
method Preprocessing and algorithms based on polyhedral norms.
result Efficient computation of length spectra and spectrum comparison.
Paper proposes an algorithm to reconstruct optimal model structure from graph adjacency matrix.
problem Optimal model structure reconstruction from weighted colored graph adjacency matrix.
method Uses prize-collecting Steiner tree algorithm to reconstruct minimum spanning tree.
result Demonstrates the effectiveness of the prize-collecting Steiner tree algorithm for model structure reconstruction.
Study identifies cancer genes through graph anomaly analysis of protein interactions.
problem Insufficient modeling of biological information in protein interaction networks for cancer gene identification.
method Proposes HIerarchical-Perspective Graph Neural Network (HIPGNN) to detect weight heterogeneity and spectral flattening in cancer gene nodes.
result HIPGNN detects weight heterogeneity and spectral flattening, leading to improved cancer gene identification.
The paper reformulates Bakry-Émery curvature on graphs using eigenvalues.
problem Analyzing curvature on weighted graphs.
method Reformulating curvature as the smallest eigenvalue of a rank one perturbation of the curvature matrix.
result The curvature function is analytic, strictly monotone increasing, and concave until a threshold, after which it is constant.
Utilizing a weight matrix we study surfaces of prescribed weighted mean curvature which yield a natural generalisation to critical points of anisotropic surface energies. We first derive a differential equation for the normal of immersions with prescribed weighted mean curvature, generalising a result of Clarenz and vo…
The paper calculates a specific weight system for chord diagrams with a particular graph structure.
problem Calculating a specific weight system for chord diagrams with a complete bipartite graph structure.
method Using a Lie algebra sl3 and its weight system, the authors derive a function on chord diagrams. result The authors compute the sl3 weight system for chord diagrams with a complete bipartite graph structure. New method calculates Ricci curvature from distances between weighted volumes.
problem Calculating Ricci curvature for weighted Riemannian manifolds.
method Asymptotic retrieval of generalized Ricci tensor from scaled metric derivatives of Wasserstein 1-distances.
result Limiting coarse curvature of random graphs converges to generalized Ricci tensor.
We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow …
We investigate the problem of sequentially predicting the binary labels on the nodes of an arbitrary weighted graph. We show that, under a suitable parametrization of the problem, the optimal number of prediction mistakes can be characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the g…
Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R^d. We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity. We prove that for unweighted kNN graphs, this distance converges …
We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero eigenvalue in the finite volume case and the first eigenvalue of the Dirichlet L…
Paper tackles ranking items with a semi-random comparison graph and a monotone adversary.
problem Ranking items based on pairwise comparisons from a semi-random comparison graph with a monotone adversary.
method Developed a weighted maximum likelihood estimator (MLE) and an SDP-based approach to reweight the semi-random graph.
result Achieves near-optimal sample complexity, up to a log^2(n) factor, for identifying the top-K preferred items.
Local graph clustering improves with noisy labels, enhancing accuracy and performance.
problem Local graph clustering with noisy labels for node information.
method Constructing a weighted graph with noisy labels and using diffusion-based clustering.
result Diffusion in the weighted graph yields more accurate recovery of target clusters.
A new kernel measures brain network similarities, improving disease classification.
problem Lack of edge weight information in existing graph kernels for brain connectivity networks.
method Ordinal pattern kernel for weighted brain connectivity networks.
result The ordinal pattern kernel achieves better classification performance than state-of-the-art graph kernels.
The paper solves curvature problems on graphs using a special flow.
problem Solving curvature problems on finite graphs.
method Defined the Calabi flow for a specific curvature type and established its global existence and convergence.
result The solution to the Calabi flow exists globally and converges under certain conditions.
Graph coloring involves assigning colors to the vertices of a graph such that two vertices linked by an edge receive different colors. Graph coloring problems are general models that are very useful to formulate many relevant applications and, however, are computationally difficult. In this work, a general population-b…
The paper studies Ricci flow on graphs with prescribed curvature.
problem Characterizing weight evolution on graphs with prescribed curvature.
method Ricci flow with Lin-Lu-Yau curvature prescription.
result Ricci flow converges to weights of prescribed curvature under certain conditions.