Generation of complex bipartite graphs by using a preferential rewiring process
Generation of complex bipartite graphs by using a preferential rewiring process
复制标题
DOI：
10.1103/physreve.72.036120
复制
发表时间：
2005-09-01
影响因子：
2.4
通讯作者：
Horiguchi, T
中科院分区：
文献类型：
--
作者：
Ohkubo, J;Tanaka, K;Horiguchi, T
从统计物理的角度研究复杂二部图在计算机科学、社会学等领域具有重要意义。我们提出了一个模型来生成复杂的二分图没有增长，二分图被假定为有两组固定数量的节点和固定数量的边缘之间的节点属于不同的节点集。在这个模型中，基本成分是一个优先重布线过程和适应度分布函数。通过使用优先重布线过程，我们确认，一个二分图达到一个稳定状态后，足够长的时间已经过去了。我们发现，所得到的二分图具有无标度的性质时，适当的适应度分布。事实证明，凝聚的边缘发生在某些健身分布的情况下。
It is important in computer science, sociology, and so on to investigate complex bipartite graphs from a viewpoint of statistical physics. We propose a model to generate complex bipartite graphs without growing; the bipartite graphs are assumed to have two sets of the fixed numbers of nodes and a fixed number of edges between nodes belonging to different sets of nodes. In this model, essential ingredients are a preferential rewiring process and a fitness distribution function. By using the preferential rewiring process, we confirm that a bipartite graph reaches a stationary state after a sufficiently long time has passed. We find that the obtained bipartite graph has a scale-free-like property when a suitable fitness distribution is used. It turns out that a condensation of edges takes place in the cases of certain fitness distributions.