Spectral Statistics of Directed Networks with Random Link Model Transpose-Asymmetry
Stochastic network influences complicate graph filter design by producing uncertainty in network iteration matrix eigenvalues, the points at which the graph filter response is defined. While joint statistics for the eigenvalues typically elude analysis, predictable spectral asymptotics can emerge for large scale networks. Previously published works successfully analyze large-scale networks described by undirected graphs and directed graphs with transpose-symmetric distributions, focusing on consensus acceleration filter design for time-invariant networks as an application. This work expands upon these results by enabling analysis of certain large-scale directed networks described by transpose-asymmetric distributions. Specifically, efficiently computable spectral density approximations are possible for transpose-asymmetric percolation network models with node-transitive symmetry group and normal mean matrix. Numerical simulations support the derived approximations and application to consensus filters.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Scalable Graph Embeddings via Sparse Transpose Proximities
Graph embedding learns low-dimensional representations for nodes in a graph and effectively preserves the graph structure. Recently, a significant amount of progress has been made toward this emerging research area. Howe…
Graph EmbeddingTRansPose: Large-Scale Multispectral Dataset for Transparent Object
Transparent objects are encountered frequently in our daily lives, yet recognizing them poses challenges for conventional vision sensors due to their unique material properties, not being well perceived from RGB or depth…
ObjectTransparent objectsTwo-Sample Tests for Large Random Graphs Using Network Statistics
We consider a two-sample hypothesis testing problem, where the distributions are defined on the space of undirected graphs, and one has access to only one observation from each model. A motivating example for this proble…
Two-sample testingVocal Bursts Valence PredictionRandomized spectral co-clustering for large-scale directed networks
Directed networks are broadly used to represent asymmetric relationships among units. Co-clustering aims to cluster the senders and receivers of directed networks simultaneously. In particular, the well-known spectral cl…
ClusteringMagNet: A Neural Network for Directed Graphs
The prevalence of graph-based data has spurred the rapid development of graph neural networks (GNNs) and related machine learning algorithms. Yet, despite the many datasets naturally modeled as directed graphs, including…
Link PredictionNode Classification