For binary node metadata, the attainable range of network assortativity is shown to be constrained by the degree sequence and class sizes, with explicit combinatorial bounds in three configuration spaces.
The obtained bounds require only the degree sequence and the proportion of metadata to be set and so are suitable for the metadata-graph space
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Network constraints on the mixing patterns of binary node metadata
For binary node metadata, the attainable range of network assortativity is shown to be constrained by the degree sequence and class sizes, with explicit combinatorial bounds in three configuration spaces.