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

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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2015-03
Hauptverfasser:	Kulig, Andrzej, Drozdz, Stanislaw, Kwapien, Jaroslaw, Oswiecimka, Pawel
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computation and Language Computer simulation Dependence Networks Physics - Physics and Society Shortest-path problems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!