Pith. sign in

REVIEW 1 cited by

Edge coherence in multiplex networks

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

arxiv 2202.09326 v1 pith:3IFOGTJK submitted 2022-02-18 stat.ME math.STstat.OTstat.TH

Edge coherence in multiplex networks

classification stat.ME math.STstat.OTstat.TH
keywords networkscoherenceedgelinearstochasticcorrelateddefineddependence
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper introduces a nonparametric framework for the setting where multiple networks are observed on the same set of nodes, also known as multiplex networks. Our objective is to provide a simple parameterization which explicitly captures linear dependence between the different layers of networks. For non-Euclidean observations, such as shapes and graphs, the notion of "linear" must be defined appropriately. Taking inspiration from the representation of stochastic processes and the analogy of the multivariate spectral representation of a stochastic process with joint exchangeability of Bernoulli arrays, we introduce the notion of edge coherence as a measure of linear dependence in the graph limit space. Edge coherence is defined for pairs of edges from any two network layers and is the key novel parameter. We illustrate the utility of our approach by eliciting simple models such as a correlated stochastic blockmodel and a correlated inhomogeneous graph limit model.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Decorated graphons for temporal network estimation

    stat.ME 2026-07 conditional novelty 6.0

    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.