Pith. sign in

REVIEW 1 cited by

How directed is a directed network?

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 2001.05173 v1 pith:Z5O2OPLR submitted 2020-01-15 physics.soc-ph

classification physics.soc-ph
keywords trophicdirectedlevelsnetworknetworkspropertiescoherencecycle
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The trophic levels of nodes in directed networks can reveal their functional properties. Moreover, the trophic coherence of a network, defined in terms of trophic levels, is related to properties such as cycle structure, stability and percolation. The standard definition of trophic levels, however, borrowed from ecology, suffers from drawbacks such as requiring source nodes, which limit its applicability. Here we propose a simple new definition of trophic level that can be computed on any directed network. We demonstrate how the method can identify node function in examples including ecosystems, supply chain networks, gene expression, and global language networks. We also explore how trophic levels and coherence relate to other topological properties, such as non-normality and cycle structure, and show that our method reveals the extent to which the edges in a directed network are aligned in a global direction.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Graph Hierarchy: A novel approach to understanding hierarchical structures in complex networks

    physics.soc-ph 2019-08 conditional novelty 6.0 of 10

    Hierarchical levels, defined as the minimum-norm least-squares solution of a graph Laplacian equation, extend trophic analysis to arbitrary simple directed graphs and yield metrics that track SIS epidemic incidence.

Pith tools