paperKB
coga / coga-kb
Help
Sign in

Chunk #43 — Materials and Methods — Graph indexes — Efficiency

Source
Defecting or not defecting: how to "read" human behavior during cooperative games by EEG measurements.
Embedded
yes

Text

If there is no path from i to j, dij = ∞ and the couple (i,j) does not contribute to the graph efficiency. Large distances imply small efficiency, while short distances imply high efficiency, with the efficiency being maximal in a fully connected graph.