Mathematical software

LAMG
Referenced in 34 articles [sw06551]
Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver. Laplacian matrices of graphs arise ... presented, where $A$ is a graph Laplacian. LAMG’s run time and storage are empirically ... Laplacian systems is constructed, and an iterative solve phase using multigrid cycles. General graphs pose...

SpectralNet
Referenced in 6 articles [sw26162]
into the eigenspace of their associated graph Laplacian matrix and subsequently clusters them. We train...

SyncSpecCnn
Referenced in 5 articles [sw26163]
spectral domain spanned by graph laplacian eigenbases. Under this setting, our network, named SyncSpecCNN, strive ... scale analysis in different parts of the graph for a single shape...

MC73
Referenced in 7 articles [sw12394]
second smallest eigenvalue of the Laplacian of a graph, known as the Fiedler vector...

Laplacians.jl
Referenced in 2 articles [sw41227]
Laplacians.jl: Laplacians is a package containing graph algorithms, with an emphasis on tasks related ... solving systems of linear equations in graph Laplacians, low stretch spanning trees, sparsifiation, clustering, local...

SpectralNET
Referenced in 3 articles [sw26161]
each connected component of the graph, including graphs of degree distribution, clustering coefficient by degree ... adjacency, Laplacian, and normalized Laplacian eigenvectors. SpectralNET also displays several graph visualizations, including a linear ... provides an elegant view of global graph structure (Laplacian eigenvectors). CONCLUSION: SpectralNET provides an easily...

AGL-Score
Referenced in 2 articles [sw41015]
terms of graph invariants derived from graph Laplacian, its pseudo-inverse, and adjacency matrices. Additionally ... biomolecular macroscopic properties from the low-dimensional graph representation of biomolecular structures. The proposed...

NetLSD
Referenced in 5 articles [sw32341]
large graph collections. In this paper, we propose the Network Laplacian Spectral Descriptor (NetLSD ... size-invariant, scale-adaptive, and efficiently computable graph representation method that allows for straightforward comparisons ... graphs. NetLSD extracts a compact signature that inherits the formal properties of the Laplacian spectrum ... thus, it hears the shape of a graph. Our evaluation on a variety of real...

spectralGraphTopology
Referenced in 1 article [sw35465]
algorithms such as Combinatorial Graph Laplacian Learning (CGL), Spectral Graph Learning (SGL), Graph Estimation based ... Method of Multipliers (GLE-ADMM). In addition, graph learning has been widely employed for clustering ... provide an implementation of the Constrained Laplacian Rank (CLR) algorithm...

RGCNN
Referenced in 1 article [sw36662]
approximation. In particular, we update the graph Laplacian matrix that describes the connectivity of features ... which adaptively captures the structure of dynamic graphs. Further, we deploy a graph-signal smoothness...

tangle-network-particle-filter
Referenced in 1 article [sw38321]
associated matrix, the analog of a graph Laplacian. The utility of the framework is demonstrated...

CayleyNets
Referenced in 5 articles [sw38090]
sparsely-connected graphs, and can handle different constructions of Laplacian operators. Extensive experimental results show...

Xheal
Referenced in 9 articles [sw35976]
second smallest eigenvalue of the Laplacian which captures key properties such as mixing time, conductance ... self-healing algorithms “Forgiving tree” and “Forgiving graph” in that we are able to give...

PQSER
Referenced in 5 articles [sw22074]
whose interrelationship is defined by a bipartite graph. It has important applications in, e.g., archaeology ... Fiedler vector of the Laplacian matrix associated to the problem, which encodes...

HERMES
Referenced in 2 articles [sw41012]
earlier work introduced the persistent spectral graph (PSG) theory as a unified multiscale paradigm ... analysis. In PSG theory, families of persistent Laplacian matrices (PLMs) corresponding to various topological dimensions...

LAMG