Modeling the average shortest path length in growth of word-adjacency networks

Abstract

We investigate properties of evolving linguistic networks defined by the word-adjacency relation. Such networks belong to the category of networks with accelerated growth but their shortest path length appears to reveal the network size dependence of different functional form than the ones known so far. We thus compare the networks created from literary texts with their artificial substitutes based on different variants of the Dorogovtsev-Mendes model and observe that none of them is able to properly simulate the novel asymptotics of the shortest path length. Then, we identify the local chain-like linear growth induced by grammar and style as a missing element in this model and extend it by incorporating such effects. It is in this way that a satisfactory agreement with the empirical result is obtained.

Accepted for publication in Physical Review E

References in corpus (6)

• Preferential attachment in the growth of social networks: the case of Wikipedia
• Languages cool as they expand: Allometric scaling and the decreasing need for new words
• Network properties of written human language
• Life, Death and Preferential Attachment
• Network model of human language
• Accelerating networks

Cited by in corpus (5)

• Text authorship identified using the dynamics of word co-occurrence networks
• Complex systems approach to natural language
• Text characterization based on recurrence networks
• Diversity in Valuing Social Contact and Risk Tolerance Lead to the Emergence of Homophily in Populations Facing Infectious Threats
• Average shortest-path length in word-adjacency networks: Chinese versus English