dorsal/arxiv
View SchemaAverage shortest-path length in word-adjacency networks: Chinese versus English
| Authors | Jakub Dec, Michał Dolina, Stanisław Drożdż, Jarosław Kwapień, Jin Liu, Tomasz Stanisz |
|---|---|
| Categories | |
| ArXiv ID | 2601.06361vv1 |
| URL | https://arxiv.org/abs/2601.06361 |
| DOI | 10.1103/v3mp-7dwg |
| Journal | Physical Review E 112, 064318 (2025) |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Complex networks provide powerful tools for analyzing and understanding the intricate structures present in various systems, including natural language. Here, we analyze topology of growing word-adjacency networks constructed from Chinese and English literary works written in different periods. Unconventionally, instead of considering dictionary words only, we also include punctuation marks as if they were ordinary words. Our approach is based on two arguments: (1) punctuation carries genuine information related to emotional state, allows for logical grouping of content, provides a pause in reading, and facilitates understanding by avoiding ambiguity, and (2) our previous works have shown that punctuation marks behave like words in a Zipfian analysis and, if considered together with regular words, can improve authorship attribution in stylometric studies. We focus on a functional dependence of the average shortest path length $L(N)$ on a network size $N$ for different epochs and individual novels in their original language as well as for translations of selected novels into the other language. We approximate the empirical results with a growing network model and obtain satisfactory agreement between the two. We also observe that $L(N)$ behaves asymptotically similar for both languages if punctuation marks are included but becomes sizably larger for Chinese if punctuation marks are neglected.
{
"annotation_id": "8d7f8c18-ede1-43b3-8702-0ffd9ddfbe12",
"date_created": "2026-02-17T05:53:07.565000Z",
"date_modified": "2026-02-17T05:53:07.565000Z",
"file_hash": "293ec104399d5a08dee993f60f3fb905116edc95c338414cf5972729ed83d998",
"private": false,
"record": {
"abstract": "Complex networks provide powerful tools for analyzing and understanding the intricate structures present in various systems, including natural language. Here, we analyze topology of growing word-adjacency networks constructed from Chinese and English literary works written in different periods. Unconventionally, instead of considering dictionary words only, we also include punctuation marks as if they were ordinary words. Our approach is based on two arguments: (1) punctuation carries genuine information related to emotional state, allows for logical grouping of content, provides a pause in reading, and facilitates understanding by avoiding ambiguity, and (2) our previous works have shown that punctuation marks behave like words in a Zipfian analysis and, if considered together with regular words, can improve authorship attribution in stylometric studies. We focus on a functional dependence of the average shortest path length $L(N)$ on a network size $N$ for different epochs and individual novels in their original language as well as for translations of selected novels into the other language. We approximate the empirical results with a growing network model and obtain satisfactory agreement between the two. We also observe that $L(N)$ behaves asymptotically similar for both languages if punctuation marks are included but becomes sizably larger for Chinese if punctuation marks are neglected.",
"arxiv_id": "2601.06361",
"authors": [
"Jakub Dec",
"Micha\u0142 Dolina",
"Stanis\u0142aw Dro\u017cd\u017c",
"Jaros\u0142aw Kwapie\u0144",
"Jin Liu",
"Tomasz Stanisz"
],
"categories": [
"cs.CL"
],
"doi": "10.1103/v3mp-7dwg",
"journal_ref": "Physical Review E 112, 064318 (2025)",
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Average shortest-path length in word-adjacency networks: Chinese versus English",
"url": "https://arxiv.org/abs/2601.06361",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "e40268ae-f67c-4f0b-943f-295d5ad216d0",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}