arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0912.2807physics.soc-phphysics.gen-ph
收藏

网络的$p$次聚类系数$C_{p}$和邻接矩阵:基于字符串的公式化

$p$-th Clustering coefficients $C_{p}$ and Adjacent Matrix for Networks: Formulation based on String

Norihito Toyota

摘要:

六度分离现象是一个古老而有趣的问题。考虑了反映三角形结构的聚类系数,并将其推广到1 ~ 6个分离度的正方形,提出了\cite{Newm21}。最近,Aoyama \cite{Aoyama}使用一种通用的形式主义“弦形式主义”,对无环网络中的这个问题进行了一些考虑。在这篇文章中,我们描述了青山提出的字符串制定和相邻矩阵之间的关系。因此,我们提供了由\cite{Aoyama}提出的分析网络的弦公式的重新公式化。在此基础上,引入了一系列广义$q$ - $th$聚类系数.在此基础上,给出了图与公式之间的有效规则。接下来,我们将该公式应用于一些受试者,以主要检查与以前研究的一致性。通过评估典型网络的聚类系数,我们证实了我们的配方的有效性。最后,我们把它应用到两个分离度的问题上。

英文摘要:

The phenomenon of six degrees of separation is an old but interesting problem. The considerations of the clustering coefficient reflecting triangular structures and its extension to square one to six degrees of separation have been made\cite{Newm21}. Recently, Aoyama\cite{Aoyama} has given some considerations to this problem in networks without loops, using a sort of general formalism, "string formalism". In this article, we describe relations between the string formulation proposed by Aoyama and an adjacent matrix. Thus we provided a reformulation of the string formulation proposed by \cite{Aoyama} to analyze networks. According to it, we introduced a series of generalized $q$-$th$ clustering coefficients. The available rules between diagrams of graphs and formulae are also given based on the formulation. Next we apply the formulation to some subjects in order to mainly check consistency with former studies. By evaluating the clustering coefficient for typical networks studied well earlier, we confirm a validity of our formulation. Lastly we applied it to the subject of two degrees of separation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑