Proposes MGMN for end-to-end graph similarity learning.
problem Lack of cross-level interactions in graph similarity learning.
method Multi-level graph matching network (MGMN) combining node-graph matching and siamese graph neural networks.
result MGMN outperforms state-of-the-art models on graph-graph classification and regression tasks.
We introduce a novel approach to graph-level representation learning, which is to embed an entire graph into a vector space where the embeddings of two graphs preserve their graph-graph proximity. Our approach, UGRAPHEMB, is a general framework that provides a novel means to performing graph-level embedding in a comple…
When each data point is a large graph, graph statistics such as densities of certain subgraphs (motifs) can be used as feature vectors for machine learning. While intuitive, motif counts are expensive to compute and difficult to work with theoretically. Via graphon theory, we give an explicit quantitative bound for the…
We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a cor…
Develops neural network for directed hypergraphs for node classification.
problem Irregular data structure, particularly directed graphs.
method Directed hypergraph neural network and semi-supervised learning method.
result Novel directed hypergraph neural network achieves highest accuracies on node classification tasks.
Proposes methods to recover labels from shuffled networks using graph averages.
problem Recovering labels from a shuffled network using graph averages.
method Cluster networks into classes, then match the new graph to cluster-averages, minimizing the graph matching objective function.
result Higher fidelity matching performance when clustering networks into different classes.
Biological and cellular systems are often modeled as graphs in which vertices represent objects of interest (genes, proteins, drugs) and edges represent relational ties among these objects (binds-to, interacts-with, regulates). This approach has been highly successful owing to the theory, methodology and software that …
Deep learning predicts drug side-effects from molecular graphs.
problem Predicting drug side-effects from molecular structures.
method Recurrent Graph Neural Networks for multi-class multi-label graph-focused classification.
result Improved classification capability compared to previous methods.
This paper improves node classification using graph structure and side information.
problem Improving node classification in semi-supervised scenarios.
method Combines graph convolutional networks with extracted side information.
result The proposed model achieves higher prediction accuracy.
A new GNM model outperforms MLP for tabular data.
problem Learning with tabular data.
method Proposes Graph Neural Machine (GNM) replacing MLP's graph representation with a nearly complete graph and using synchronous message passing.
result GNM outperforms MLP in classification and regression tasks.
Graphs possess exotic features like variable size and absence of natural ordering of the nodes that make them difficult to analyze and compare. To circumvent this problem and learn on graphs, graph feature representation is required. A good graph representation must satisfy the preservation of structural information, w…
WGNN learns graph representations from incomplete attribute data.
problem Missing node attributes in graphs.
method WGNN learns node representations from decomposed attribute matrices and uses Wasserstein space for message passing.
result WGNN outperforms existing methods in node classification tasks with missing attribute data.
Unsupervised method learns hierarchical graph representations without labels.
problem Lack of hierarchical graph representations and need for labeled data in GNNs.
method Maximizes mutual information between local and global graph representations.
result Comparable performance to supervised methods on graph classification benchmarks.
A framework for federated graph classification over non-IID graphs.
problem Training graph mining models collaboratively across different domains with non-IID graphs.
method Graph Clusters Federated Learning (GCFL) framework, dynamically finding clusters based on GNN gradients, and a gradient sequence-based clustering mechanism (GCFL+).
result Demonstrated effectiveness of GCFL+ in reducing structure and feature heterogeneity among graphs.
Paper proposes KE-GCN for better graph embedding.
problem Efficiently leveraging complex graphs with heterogeneous entities and relations.
method Combines GCNs and knowledge embedding methods.
result Advantages in knowledge graph alignment and entity classification.
Develops method to create non-Abelian Ricci-flat graphs via bundles.
problem Creating non-Abelian Ricci-flat graphs.
method Develops systematic way via graph bundles with constraints.
result Non-trivial graph bundles are not isomorphic to product of base and fiber.
The paper refines Steinerberger curvature for block graphs and bridges.
problem Understanding curvature in graph theory.
method Formulas and relations for curvature in block graphs and graph bridges.
result Self-centered Bonnet-Myers sharp graphs are antipodal.
Unified framework for graph coarsening using node features and graph matrices.
problem Dimensionality reduction of large graphs while preserving node features.
method Optimization-based framework that unifies graph learning and dimensionality reduction.
result The learned coarsened graph is ε-similar to the original graph, where ε is a small positive number.
The aim of this work is studying translating graphs by mean curvature flow in $\Real^3$. We prove non-existence of complete translating graphs over bounded domains in $\Real^2$. Furthermore, we show that there are only three types of complete translating graphs in $\Real^3$; entire graphs, graphs between two vertical p…
New bound for group action length without diameter restriction.
problem Bounding minimal translation length for Artin groups.
method Graph theoretic properties of biconnected graphs.
result Upper bound of 2 for minimal translation length holds without diameter restriction.
We define and study the statistical models in exponential family form whose sufficient statistics are the degree distributions and the bi-degree distributions of undirected labelled simple graphs. Graphs that are constrained by the joint degree distributions are called dK-graphs in the computer science literature and…
CTGCN learns dynamic graph embeddings preserving both local and global graph structure.
problem Learning node representations for evolving graphs while preserving both local and global graph structure.
method CTGCN uses k-core based temporal graph convolutional network to learn dynamic graph embeddings.
result CTGCN outperforms existing methods in link prediction and structural role classification.
Graph-Dictionary model for sparse multivariate signal representation.
problem Capturing complex relational information in multivariate signals.
method Graph dictionaries and bilinear primal-dual splitting algorithm.
result Graph-dictionary model outperforms baselines in signal reconstruction and classification.
Proposes RBGP framework for efficient block sparse neural networks.
problem Efficiently exploit structured sparsity patterns for sparse neural networks on GPU.
method Uses Ramanujan Bipartite Graph Product to generate structured multi-level block sparse neural networks.
result Achieves 5-9x and 2-5x runtime gains over unstructured and block sparsity patterns respectively, while maintaining accuracy.
Graph kernels have attracted a lot of attention during the last decade, and have evolved into a rapidly developing branch of learning on structured data. During the past 20 years, the considerable research activity that occurred in the field resulted in the development of dozens of graph kernels, each focusing on speci…
The paper describes the K-theory of C∗-algebras of locally finite graphs.
problem Computing the K-theory of C∗-algebras of locally finite graphs. method Using a directed graph representation and Cuntz-Krieger algebra, the paper computes the K-theory of C∗(Γ). result The K-theory of C∗(Γ) is determined by the graph's genus, number of ends, and dead-ends. TD-GEN generates graphs using tree decomposition, improving efficiency and performance.
problem Efficiently generating graphs with statistical properties.
method Tree decomposition, permutation invariant tree generation, incremental graph generation.
result Improved graph generation efficiency and performance.
Study evaluates neural networks based on random graph structures and finds key performance indicators.
problem Understanding and optimizing neural network architectures using graph theory.
method Evaluation of neural networks with random graph structures, focusing on structural and numerical properties.
result A new numerical graph characteristic selects a set of quasi-1-dimensional graphs that perform well.
A framework for hypothesis testing on attributed graphs using sampling.
problem Statistical testing on graph data, especially large attributed graphs.
method Sampling-based framework with PHASE and PHASEopt for accurate and efficient hypothesis testing.
result PHASE and PHASEopt improve accuracy and efficiency of hypothesis testing in attributed graphs.
New research finds six bipartite intrinsically knotted graphs with 23 edges.
problem Identifying intrinsically knotted bipartite graphs with 23 edges.
method Analyzing embeddings and graph minors to find minimal intrinsically knotted graphs.
result No minor minimal intrinsically knotted bipartite graph exists with 23 edges.
New optimization algorithms on orthogonal group for machine learning.
problem Efficient optimization on the orthogonal group for machine learning tasks.
method Stochastic geometric algorithms on Lie groups.
result Strong performance on diverse machine learning tasks.
The paper solves graph realization problems for Reeb graphs of Morse functions.
problem Realizing graphs as Reeb graphs with specific preimage configurations.
method Constructing Morse functions with prescribed preimages.
result Solved realization problems for certain types of graphs.
Financial transactions can be considered edges in a heterogeneous graph between entities sending money and entities receiving money. For financial institutions, such a graph is likely large (with millions or billions of edges) while also sparsely connected. It becomes challenging to apply machine learning to such large…
The paper characterizes discrete Morse functions on knot diagrams and generalizes a clock theorem.
problem Characterizing discrete Morse functions on knot diagrams and generalizing a clock theorem.
method Using matchings on the Tait graph, the paper constructs discrete Morse functions and counts them with a formula involving the graph Laplacian. It also proves a bijection between these functions and certain rooted spanning forests.
result The paper provides a closed formula for counting discrete Morse functions and generalizes a clock theorem.
We investigate properties that intuitively ought to be satisfied by graph clustering quality functions, that is, functions that assign a score to a clustering of a graph. Graph clustering, also known as network community detection, is often performed by optimizing such a function. Two axioms tailored for graph clusteri…
Graph neural networks are vulnerable to adversarial attacks by manipulating graph structure.
problem Vulnerability of Graph Neural Networks to adversarial attacks.
method Categorization and review of existing attacks and defenses.
result Developed a repository for empirical studies on graph adversarial attacks and defenses.
Graph neural networks improve with edge similarity constraints in RNA structure analysis.
problem Lack of edge similarity constraints in graph neural networks.
method Introduced a graph neural network layer that leverages prior information about edge similarities.
result Edge similarity constraints do not enhance performance in graph neural networks.
Paper introduces HGSL for heterogeneous graphs, improving edge type and weight recovery.
problem Learning structure in heterogeneous graphs with multiple node and edge types.
method Proposes H2MN model for DGPs and derives alternating optimization method.
result Demonstrates superior performance on synthetic and real-world datasets.
HGT models heterogeneous graphs with dedicated node and edge representations.
problem Infeasibility of existing GNNs for heterogeneous graphs.
method Node- and edge-type dependent parameters, relative temporal encoding, heterogeneous mini-batch graph sampling.
result HGT outperforms state-of-the-art GNNs by 9%--21% on various downstream tasks.
Graph neural networks (GNNs), consisting of a cascade of layers applying a graph convolution followed by a pointwise nonlinearity, have become a powerful architecture to process signals supported on graphs. Graph convolutions (and thus, GNNs), rely heavily on knowledge of the graph for operation. However, in many pract…
The paper explores graphons of line graphs from sparse finite graphs.
problem Estimating graph limits from sparse finite graphs.
method Mapping finite graphs to their line graphs and analyzing graphs with the square-degree property.
result Graphons of line graphs can distinguish between sparse graphs like star graphs and superlinear preferential attachment graphs.
SymPE breaks symmetries in equivariant networks, improving performance across various tasks.
problem Equivariant networks cannot break symmetries, leading to poor performance in tasks with symmetrical inputs.
method Novel equivariant conditional distributions and randomized canonicalization.
result SymPE significantly improves performance of group-equivariant and graph neural networks.
EvoNet predicts the evolution of dynamic graphs using a graph neural network and recurrent architecture.
problem Predicting the evolution of dynamic graphs is challenging and underexplored.
method EvoNet uses a graph neural network and recurrent architecture to predict the evolution of dynamic graphs.
result EvoNet effectively predicts the evolution of dynamic graphs on both artificial and real-world datasets.
Graph neural networks detect anomalies in object-centric business processes.
problem Detecting anomalies in graph-like business processes.
method Graph convolutional autoencoder architecture for anomaly detection.
result Promising performance in detecting anomalies at the activity type and attributes level.
Graph transformation framework improves graph neural network performance.
problem Data quality issues in graph neural networks.
method Test-time graph transformation framework (GTrans).
result Significant performance improvements (up to 3.8%) across various datasets.
Enhances Ponzi scheme detection on Ethereum using time-aware metapaths.
problem Lack of temporal information in heterogeneous transaction graphs.
method Time-aware Metapath Feature Augmentation (TMFAug) module.
result Significant performance improvements in Ponzi scheme detection.
TGNs learn from dynamic graphs efficiently and outperform previous methods.
problem Learning from graphs that evolve over time.
method Temporal Graph Networks (TGNs) combining memory and graph operators.
result Significantly outperforms previous approaches on dynamic graphs.
AGG-UCB uses neural networks to optimize group behaviors in contextual bandits.
problem Optimizing group behaviors in contextual bandits with mutual impacts.
method Introduces Arm Group Graph (AGG) and AGG-UCB algorithm using neural networks and graph neural networks.
result Achieves near-optimal regret bound with over-parameterized neural networks.