Random projections help in representing sparse graphs efficiently.
problem Efficiently representing sparse graphs of varying sizes and vertex sets.
method Random projection of adjacency matrices to retain graph functionality and properties.
result Random projections can accurately represent graphs of different sizes and vertex sets in the same space.
New matrix reveals cluster info in sparse directed graphs.
problem Analyzing cluster information in directed graphs.
method Proposed complex non-backtracking matrix integrating Hermitian adjacency matrix and non-backtracking matrix properties.
result The complex non-backtracking matrix holds cluster information, especially for sparse directed graphs.
Proposes CAL to learn causal adjacency for better spatiotemporal prediction.
problem Suboptimal performance in spatiotemporal prediction due to out-of-distribution data.
method Causal Adjacency Learning (CAL) method to discover causal relations over graphs.
result Calculated causal adjacency matrix enhances prediction performance on out-of-distribution test data.
Proposes a new graph representation method using tensor products.
problem Dynamic graph representation and theoretical properties.
method Bind-and-sum approach in hyperdimensional computing (HDC), tensor product as binding operation.
result Memory vs. size analysis of graph representation size scaling.
New centrality-based graph shift operators improve graph neural networks.
problem Improving graph neural networks by enhancing graph shift operators.
method Proposed Centrality Graph Shift Operators (CGSOs) using global centrality metrics.
result CGSOs lead to improved performance in graph neural networks on real-world datasets.
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…
Bayesian graph learning improves graph representation accuracy.
problem Inaccurate graph construction from noisy data.
method Non-parametric Bayesian graph model for posterior inference of graph adjacency matrices.
result Model scales well to large graphs and improves node classification, link prediction, and recommendation tasks.
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency structure on the half-edges around each vertex, and an embedding of a *-graph is…
Graph energy helps detect communities in networks better than traditional methods.
problem Detecting communities in sparse networks where traditional methods fail.
method Using graph energy based on the full spectrum of adjacency matrices.
result The difference in graph energy between a planted partition model and an Erdős--Rényi network has a distinct transition at the detectability threshold.
In the paper, we consider the problem of link prediction in time-evolving graphs. We assume that certain graph features, such as the node degree, follow a vector autoregressive (VAR) model and we propose to use this information to improve the accuracy of prediction. Our strategy involves a joint optimization procedure …
We found a way to code meanders and show they are idempotent.
problem Understanding and coding meandric permutations.
method We established a bijection between meanders and Gauss diagrams, and used this to construct matrices that are idempotent.
result Meandric permutations are idempotent over the field GF(2).
Efficiently learns DAG structures without cycles.
problem Learning DAG structures efficiently with constraints.
method Proposes DAG-NoCurl, a two-step algorithm to find and project acyclic graphs.
result Significantly improves efficiency over existing methods, often by more than one order of magnitude.
The study examines convergence of stochastic processes on large graphs and adjacency matrices.
problem Analyzing convergence of stochastic processes on large graphs and adjacency matrices.
method Introduced new metrics on the space of measure-valued graphons and used them to show convergence of random trajectories to deterministic curves.
result The Metropolis chain converges to a deterministic gradient flow curve on the space of graphons under certain conditions.
Quantum GBS boosts asset clustering for robust statistical arbitrage portfolios.
problem Identifying co-moving assets from correlation matrices for statistical arbitrage.
method Mapping S&P 500 correlation data to GBS-compatible adjacency matrices, benchmarking classical and quantum clustering algorithms.
result Quantum GBS generates superior alpha during high volatility periods, persisting under low-loss conditions.
New method handles structural uncertainty in graphs better than existing models.
problem Handling heterophily and structural noise in semi-supervised learning on graphs.
method Sparse signed message passing network that models a posterior distribution over signed adjacency matrices.
result Our method outperforms strong baseline models on heterophilic benchmarks under both synthetic and real-world structural noise.
Graph neural networks have become increasingly popular in recent years due to their ability to naturally encode relational input data and their ability to scale to large graphs by operating on a sparse representation of graph adjacency matrices. As we look to scale up these models using custom hardware, a natural assum…
The random dot product graph (RDPG) is an independent-edge random graph that is analytically tractable and, simultaneously, either encompasses or can successfully approximate a wide range of random graphs, from relatively simple stochastic block models to complex latent position graphs. In this survey paper, we describ…
The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision. We propose a solution to this problem via a graph matching matched filter: centering and padding…
We present an alternate formulation of the partial assignment problem as matching random clique complexes, that are higher-order analogues of random graphs, designed to provide a set of invariants that better detect higher-order structure. The proposed method creates random clique adjacency matrices for each k-skeleton…
We define an equivalence relation on graphs with signed edges, such that the associated adjacency matrices of two equivalent graphs are congruent over Z. We show that signed graphs whose eigenvalues are larger than −2 are equivalent to one of the simply laced Dynkin diagrams: An, Dn, E6, $E_…
π-GNN learns soft permutations for graph representations, improving graph classification and regression.
problem Limitations of MPNNs in graph neural networks.
method Proposes π-GNN, which learns a soft permutation matrix for each graph, projecting graphs into a common vector space.
result π-GNN achieves performance competitive with state-of-the-art models on graph classification and regression tasks.
We investigate the high-dimensional regression problem using adjacency matrices of unbalanced expander graphs. In this frame, we prove that the ℓ2-prediction error and the ℓ1-risk of the lasso and the Dantzig selector are optimal up to an explicit multiplicative constant. Thus we can estimate a high-dim…
Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a method to jointly embed multiple undirected graphs. Given a set of graphs, the jo…
EPINE enhances network embedding by improving adjacency matrix-based high-order proximity.
problem Inaccurate and poorly designed calculation of high-order proximity in network embedding.
method EPINE redefines high-order proximity intuitively and proposes a scalable algorithm for accurate calculation.
result EPINE outperforms existing methods in network reconstruction, link prediction, and node classification.
Graphs represent knot adjacency for n crossings.
problem Understanding adjacency relationships between knots.
method Defined a new graph Γn to represent n-adjacency. result Proved several results about the new graph Γn. In statistical relational learning, knowledge graph completion deals with automatically understanding the structure of large knowledge graphs---labeled directed graphs---and predicting missing relationships---labeled edges. State-of-the-art embedding models propose different trade-offs between modeling expressiveness, …
The paper tackles learning varying DAG structures based on contextual features.
problem Learning a single DAG for the entire population from observational data.
method A neural network that maps contextual features to a weighted adjacency matrix of a DAG, with a projection layer to ensure acyclicity.
result The new approach can recover context-specific DAGs where existing methods fail.
Paper introduces a taxonomy of reduction matrices for more efficient graph coarsening.
problem Efficiently reducing graph size while preserving important information.
method Introduces a more general notion of reduction matrix, not necessarily the pseudo-inverse of the lifting matrix.
result Reducing the Restricted Spectral Approximation (RSA) by modifying the reduction matrix.
Two spectral clustering methods for multi-layer networks are analyzed and compared.
problem Community detection in multi-layer networks.
method Sum and debiased sum of squared adjacency matrices for spectral clustering.
result Debiased sum of squared adjacency matrices outperforms sum of adjacency matrices.
AEGCN uses autoencoder constraints to improve graph node classification.
problem Node classification on graph domains with reduced information loss.
method Autoencoder-constrained graph convolutional network (AEGCN).
result Adding autoencoder constraints significantly improves graph convolutional network performance.
Graph Laplacians computed from weighted adjacency matrices are widely used to identify geometric structure in data, and clusters in particular; their spectral properties play a central role in a number of unsupervised and semi-supervised learning algorithms. When suitably scaled, graph Laplacians approach limiting cont…
New method improves DAG learning by using large coefficients for higher-order terms.
problem Recovering DAG structures from observational data is challenging due to combinatorial optimization.
method Proposes truncated matrix power iteration to approximate DAG constraints efficiently.
result Empirically outperforms previous methods by a factor of 3 or more in structural Hamming distance.
Two spectral algorithms for community detection in graphs with covariates are compared.
problem Detecting community structure in graphs with covariates.
method Two model-based spectral algorithms are presented and compared.
result The second algorithm often better estimates block assignments by accounting for vertex covariates.
Sketch-GNN reduces GNN training time and memory usage to sublinear scales.
problem Training GNNs on large graphs is computationally expensive and memory-intensive.
method Develops a sketch-based algorithm that trains GNNs on compact sketches of graph adjacency and node embeddings.
result Training time and memory usage grow sublinearly with respect to graph size.
Develops SymGCP for tensor decompositions with general symmetry.
problem Handling symmetry in tensor decompositions for better model accuracy.
method Introduces SymGCP, a generalized CP decomposition that accounts for any subset of tensor modes' symmetry.
result SymGCP enables efficient and scalable tensor decomposition with improved model robustness and accuracy.
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.
Discrete analogues of classical spectral geometric inequalities and extremal eigenvalue problems on graphs.
problem Extremal eigenvalue problems on graphs
method Developing nodal domain methods for adjacency matrices
result Establishing sharp extremal characterizations across diverse graph classes
The paper introduces a penalized matrix estimation procedure aiming at solutions which are sparse and low-rank at the same time. Such structures arise in the context of social networks or protein interactions where underlying graphs have adjacency matrices which are block-diagonal in the appropriate basis. We introduce…
We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links. We then introduce a combinatorial notion of adjacency for bipartite graph links…
Many modern datasets can be represented as graphs and hence spectral decompositions such as graph principal component analysis (PCA) can be useful. Distinct from previous graph decomposition approaches based on subspace projection of a single topological feature, e.g., the Fiedler vector of centered graph adjacency mat…
The inverse covariance matrix provides considerable insight for understanding statistical models in the multivariate setting. In particular, when the distribution over variables is assumed to be multivariate normal, the sparsity pattern in the inverse covariance matrix, commonly referred to as the precision matrix, cor…
Enhances graph neural networks with random walks to improve performance.
problem Limited input to graph neural networks, especially for molecular data.
method Random walk data processing to enrich graph neural network input.
result Shallow network outperforms deep GNNs using only node features.
Deep learning models have achieved huge success in numerous fields, such as computer vision and natural language processing. However, unlike such fields, it is hard to apply traditional deep learning models on the graph data due to the 'node-orderless' property. Normally, adjacency matrices will cast an artificial and …
Improved spectral clustering via Gromov-Wasserstein Learning.
problem Optimizing graph partitioning performance.
method Bridge spectral clustering and GWL, using heat kernel for stable node correspondences.
result Improved graph partitioning results without compromising theoretical guarantees.
New methods estimate mixed memberships in multi-layer networks.
problem Complex community structure in multi-layer networks.
method Spectral methods using eigen-decomposition of aggregate matrices.
result Theoretical guarantees and empirical validation for mixed membership estimation.
A scalable method to learn causal graphs from large data.
problem Learning causal graphs from large scale data is challenging.
method Differentiable Adjacency Test (DAT) to evaluate adjacency in causal graphs.
result DAT-Graph can learn graphs of 1000 variables with state-of-the-art accuracy.
New invariant CWR for alternating links is stronger than existing invariants.
problem Developing a stronger invariant for alternating links.
method Introducing CWR invariant as an array of two-variable polynomials. result The CWR invariant is stronger than classical invariants like HOMFLYPT and Kauffman polynomials. Paper proposes DAG-DB for learning discrete DAGs via backpropagation.
problem Learning Directed Acyclic Graphs (DAGs) from data.
method DAG-DB uses Discrete Backpropagation with I-MLE and Straight-Through Estimation.
result DAG-DB learns DAGs effectively using probabilistic sampling and backpropagation.