On the von Neumann Entropy of Graphs¶
Passerini, F., & Severini, S. (2019). On the von Neumann Entropy of Graphs. Journal of Complex Networks.
Cited by¶
1 citation across 1 artifact.
Domain-specific¶
- Network Entropy
- Von Neumann approaches construct a density matrix from a Laplacian or a graph-associated process.
Supported in partVerified against the publisher's abstract
The abstract establishes that von Neumann entropy of graphs has variants based on the graph Laplacian and normalized graph Laplacian, but it does not mention constructing a density matrix.
“Two variants of the von Neumann entropy exist based on the graph Laplacian and normalized graph Laplacian, respectively.”
- Von Neumann approaches construct a density matrix from a Laplacian or a graph-associated process.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:ad5a2e0b2e16 · see in the full table