论文标题
上帝（$ \ equiv elohim $），第一个小世界网络
God ($\equiv Elohim$), the first small world network
论文作者
论文摘要
在本文中，文学文本中单词的网络映射方法扩展到“文本因素”：网络节点被定义为“概念”'；链接是“社区联系”。此后，通过网络的现代统计物理方法研究了文本网络属性，从而将网络拓扑和代数属性与文学文本内容联系起来。作为一个实用的例证，圣经中的创世纪的第一章被映射到10个节点网络中，就像在卡巴拉方法中一样，提到了上帝（$ \ equiv equiv elohim $）。从其邻接矩阵和相应的拉普拉斯矩阵开始研究网络的特征。特别检查了节点的三胞胎，以强调每个代理的“文本（社区）连接”，“散发”，通过所谓的聚类系数和重叠索引，在其中测量不同节点之间的“语义流”。可以得出结论，该图是一个小世界网络，是弱差异的，因为其平均局部聚类系数显着高于同一顶点集构建的随机图。
In this paper, the approach of network mapping of words in literary texts is extended to ''textual factors'': the network nodes are defined as ''concepts''; the links are ''community connexions''. Thereafter, the text network properties are investigated along modern statistical physics approaches of networks, thereby relating network topology and algebraic properties, to literary texts contents. As a practical illustration, the first chapter of the Genesis in the Bible is mapped into a 10 node network, as in the Kabbalah approach, mentioning God ($\equiv Elohim$). The characteristics of the network are studied starting from its adjacency matrix, and the corresponding Laplacian matrix. Triplets of nodes are particularly examined in order to emphasize the ''textual (community) connexions'' of each agent "emanation", through the so called clustering coefficients and the overlap index, whence measuring the ''semantic flow'' between the different nodes. It is concluded that this graph is a small-world network, weakly dis-assortative, because its average local clustering coefficient is significantly higher than a random graph constructed on the same vertex set.
