The importance of being correlated: Implications of dependence in joint spectral inference across multiple networks
Spectral inference on multiple networks is a rapidly-developing subfield of graph statistics.
Recent work has demonstrated that joint, or simultaneous, spectral embedding of multiple …
Recent work has demonstrated that joint, or simultaneous, spectral embedding of multiple …
Nonparametric two-sample hypothesis testing for random graphs with negative and repeated eigenvalues
We propose a nonparametric two-sample test statistic for low-rank, conditionally
independent edge random graphs whose edge probability matrices have negative …
independent edge random graphs whose edge probability matrices have negative …
Matchability of heterogeneous networks pairs
V Lyzinski, DL Sussman - Information and Inference: A Journal of …, 2020 - academic.oup.com
We consider the problem of graph matchability in non-identically distributed networks. In a
general class of edge-independent networks, we demonstrate that graph matchability can …
general class of edge-independent networks, we demonstrate that graph matchability can …
Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding
T Qi, V Lyzinski - arXiv preprint arXiv:2312.11054, 2023 - arxiv.org
In this paper, we explore the capability of both the Adjacency Spectral Embedding (ASE)
and the Graph Encoder Embedding (GEE) for capturing an embedded pseudo-clique …
and the Graph Encoder Embedding (GEE) for capturing an embedded pseudo-clique …
Consistent polynomial-time unseeded graph matching for Lipschitz graphons
Y Zhang - arXiv preprint arXiv:1807.11027, 2018 - arxiv.org
We propose a consistent polynomial-time method for the unseeded node matching problem
for networks with smooth underlying structures. Despite widely conjectured by the research …
for networks with smooth underlying structures. Despite widely conjectured by the research …
Maximum likelihood estimation and graph matching in errorfully observed networks
Given a pair of graphs with the same number of vertices, the inexact graph matching
problem consists in finding a correspondence between the vertices of these graphs that …
problem consists in finding a correspondence between the vertices of these graphs that …
Statistical Inference across Multiple Networks: Advancements in Multiplex Graph Matching and Joint Spectral Network Embeddings
K Pantazis - 2022 - search.proquest.com
Networks are commonly used to model and study complex systems that arise in a variety of
scientific domains. One important network data modality is multiplex networks which are …
scientific domains. One important network data modality is multiplex networks which are …