arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1309.4258math.PR
收藏

N交互随机图模型中度和权的无标度性

Scale-free property for degrees and weights in an N-interactions random graph model

István Fazekas, Bettina Porvázsnyik

摘要:

定义了一种通用的随机图演化机制。进化是优先附着模型和N个顶点(N>=3)相互作用的组合。图中的一个顶点由它的度和权来刻画。给定顶点的权重是顶点的交互作用的数量。研究了图的渐近性态。证明了度和权的无标度性质。结果表明,(2,\infty)中的任何指数都可以实现。证明是基于离散时间鞅理论。

英文摘要:

A general random graph evolution mechanism is defined. The evolution is a combination of the preferential attachment model and the interaction of N vertices (N>=3). A vertex in the graph is characterized by its degree and its weight. The weight of a given vertex is the number of the interactions of the vertex. The asymptotic behaviour of the graph is studied. Scale-free properties both for the degrees and the weights are proved. It turns out that any exponent in (2,\infty) can be achieved. The proofs are based on discrete time martingale theory.

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

↑