RECORD
Finite connected components in infinite directed and multiplex networks with arbitrary degree distributions
Combinatorics · Submitted 13 Sep 2017
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim If first partial moments of the degree distribution are finite, the size distribution for two-layer connected components in multiplex networks exhibits exponent $-\frac{3}{2}$ in the critical regime, whereas the size distribution of weakly connected components in directed networks exhibits two critical exponents, $-\frac{1}{2}$ and $-\frac{3}{2}$.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
This work presents exact expressions for size distributions of weak/multilayer connected components in two generalisations of the configuration model: networks with directed edges and multiplex networks with arbitrary number of layers. The expressions are computable in a polynomial time, and, under some restrictions, are tractable from the asymptotic theory point of view. If first partial moments of the degree distribution are finite, the size distribution for two-layer connected components in multiplex networks exhibits exponent $-\frac{3}{2}$ in the critical regime, whereas the size distribution of weakly connected components in directed networks exhibits two critical exponents, $-\frac{1}{2}$ and $-\frac{3}{2}$.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | This work presents exact expressions for size distributions of weak/multilayer connected components in two generalisations of the configuration model: networks with directed edges and multiplex networks with arbitrary number of layers. | contribution 1.00 | 0.95 | 0.38 | asserted 1.00 |
| s1 | The expressions are computable in a polynomial time, and, under some restrictions, are tractable from the asymptotic theory point of view. | method 0.36 | 0.82 | 0.07 | asserted 0.96 |
| s2 | If first partial moments of the degree distribution are finite, the size distribution for two-layer connected components in multiplex networks exhibits exponent $-\frac{3}{2}$ in the critical regime, whereas the size distribution of weakly connected components in directed networks exhibits two critical exponents, $-\frac{1}{2}$ and $-\frac{3}{2}$. | result 1.00 | 0.89 | 0.64 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
This work presents exact expressions for size distributions of weak/multilayer connected components in two generalisations of the configuration model: networks with directed edges and multiplex networks with arbitrary number of layers. The expressions are computable in a polynomial time, and, under some restrictions, are tractable from the asymptotic theory point of view. If first partial moments of the degree distribution are finite, the size distribution for two-layer connected components in multiplex networks exhibits exponent $-\frac{3}{2}$ in the critical regime, whereas the size distribution of weakly connected components in directed networks exhibits two critical exponents, $-\frac{1}{2}$ and $-\frac{3}{2}$.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.