Introduction by OpenMethods Editor (Gimena Del Rio): Know Your Implementation: Subgraphs in Literary Networks, by Frank Fischer, Christopher Kittel and Peer Trilcke shows how the online tool ezlinavis can give account of detached subgraphs while working with network analysis of literary texts. For this specific case, Goethe’s Faust, Part One (1808) was analyzed and visualized with ezlinavis, and average distances were calculated giving some new results to this research in relation to Faust as protagonist.
If we still want network metrics to be meaningful when it comes to determining who the central character of a play could be, we better rely on a different option. For practical reasons, the distance between two unconnected nodes is sometimes declared as length of the longest existing path, plus one. If we use this method to assume an (artificial) distance for every pair of nodes (…) Faust is back! Shortest average distance!