Skip to main navigation Skip to search Skip to main content

Adjacency spectra of Chinese character co-occurrence networks in different historical periods

  • Wei Liang*
  • , Guanrong Chen
  • , Zihan Zhang
  • *Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

The spectrum of a network provides important information about its global structure. For Chinese character co-occurrence networks constructed from articles published in 11 different historical periods in China, the spectra and eigenvectors of their adjacency matrices are studied. It is found that the middle part of the spectral distribution can be fitted by a line with slope −0.01 in each incorporated network, whereas two segments with the same slope −0.02 are needed for other single networks. If the eigenvalues, λi, are listed in decreasing order, then the formers depend on their ranks, i, in the form of λ∝ −β log i, where 1.70 ≤ β ≤ 9.69. In the spectral density ρ(λ), there is a triangle-like shape in each of the incorporated networks, while the ρ(λ) values are nearly symmetrical in each single network. These and other results indicate that the spectra and eigenvectors can provide useful insight into the structural properties of Chinese linguistic networks.
Original languageEnglish
Article number122541
JournalPhysica A: Statistical Mechanics and its Applications
Volume536
Online published4 Sept 2019
DOIs
Publication statusPublished - 15 Dec 2019

Research Keywords

  • Adjacency matrix
  • Chinese language
  • Co-occurrence network
  • Spectral analysis

Fingerprint

Dive into the research topics of 'Adjacency spectra of Chinese character co-occurrence networks in different historical periods'. Together they form a unique fingerprint.

Cite this