Compactified Horizontal Visibility Graph for the Language Network
This work addresses the analysis of language networks for researchers in computational linguistics, but it appears incremental as it builds on existing graph methods without clear broad impact.
The authors tackled the problem of analyzing language networks by proposing a compactified horizontal visibility graph, finding that these networks are scale-free and that high-degree nodes correspond to words that determine both text structure and informational structure.
A compactified horizontal visibility graph for the language network is proposed. It was found that the networks constructed in such way are scale free, and have a property that among the nodes with largest degrees there are words that determine not only a text structure communication, but also its informational structure.