REVIEW 3 cited by
Multilayer random dot product graphs: Estimation and online change point detection
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We study the multilayer random dot product graph (MRDPG) model, an extension of the random dot product graph to multilayer networks. To estimate the edge probabilities, we deploy a tensor-based methodology and demonstrate its superiority over existing approaches. Moving to dynamic MRDPGs, we formulate and analyse an online change point detection framework. At every time point, we observe a realization from an MRDPG. Across layers, we assume fixed shared common node sets and latent positions but allow for different connectivity matrices. We propose efficient tensor algorithms under both fixed and random latent position cases to minimize the detection delay while controlling false alarms. Notably, in the random latent position case, we devise a novel nonparametric change point detection algorithm based on density kernel estimation that is applicable to a wide range of scenarios, including stochastic block models as special cases. Our theoretical findings are supported by extensive numerical experiments, with the code available online https://github.com/MountLee/MRDPG.
Forward citations
Cited by 3 Pith papers
-
Monitoring for a Phase Transition in a Time Series of Wigner Matrices
A self-normalized detector based on the largest eigenvalues of deformed Wigner matrices detects online, with controlled false alarm rate, the moment a latent signal crosses the detectability threshold.
-
Change Point Localization and Inference in Dynamic Multilayer Networks
A seeded binary segmentation plus tensor PCA refinement consistently localizes change points in dynamic multilayer random dot product graphs and yields limiting distributions for confidence intervals.
-
Decorated graphons for temporal network estimation
Dynamic networks can be modeled as decorated graphons whose edge labels are binary time-series laws, estimated by two-stage blockwise least squares with rates depending on the number of time steps and edge-estimator quality.
Discussion (0). Continue with ORCID to comment.