The Small World of Ancient Chinese Characters
Date Issued
2004
Date
2004
Author(s)
Lee, Po-Han
DOI
en-US
Abstract
Abstract
In recent years, small world theory, as proposed by D. J. Watts and S. H. Strogatz in 1998 based on an idea of Stanley Milgram's in the 1967, has been used as a way to identify and map certain abstract classes of networks in relatively simple network-systems, such as the Internet, human relationships, neuronal systems, disease metastasis, and so on. However, despite its success in mapping the relationships which govern specific aspects of complex systems, it is not always able to successfully predict the behavior of either very complex systems or simple networks with isolated (i.e. disconnected) nodes. A solution to what is known as the reliability problem can be found by tracking how efficiently a particular network exchanges information and how linked vertices share such information. Through this simple measure of efficiency, small world networks can be seen as both globally and locally efficient. Thus, putting aside its provocative metaphorical meaning as represented by the coinage six degrees of separation, small world, in its most important sense, represents a concrete model of network activity capable of explaining both weighted and unweighted networks. This work tackles one such system: ancient Chinese characters. Our study of Chu characters and Oracle bone inscriptions demonstrates that the underlying general principle of their construction corresponding to small world efficiency. By relying on the analysis of a connection graph, small world also offers important insights into the general characteristics and real combination of the roots of ancient Chinese characters. In fact, the evolution of the connection matrix of the root table helps explain the development of the characters themselves and allows us to construct the probable features of characters that have been discovered. Comparing Chu characters (circa 481 B.C. - 221 A.C.) with Oracle bone inscriptions systems (circa 1200 --1050 B.C.), the three hundred fifty five of these roots have been found to be identical. By constructing a shared root matrix it is important to see that the two different character systems enjoy a high degree of correlation with similar embedded properties.
By employing a connective matrix based on root tables for Chu and Oracle bones, root networks have been constructed to determine how such network system evolved over time, and the extant models have also been used to determine whether or not these models correspond to ancient Chinese networks. By combining the nonlinear weight of degree of nodes and with the use of a new model of modifying initial conditions, we can achieve a comprehensive model of ancient Chinese characters. For completeness and in pursuance with a suggestion from the thesis committee, a publication list of the author's previous work on chaotic systems and random number generators which is not directly related to this thesis is also included as Appendix G.
Subjects
小世界
楚字
無尺度的網路
非線性優先連結
Chu characters
Oracle bone inscriptions
Small world
Scale free networks
Nonlinear preferential attachment
SDGs
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-93-D88222001-1.pdf
Size
23.53 KB
Format
Adobe PDF
Checksum
(MD5):956a1f990b241a4ba94a0776baf351c5