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

部分复制随机图的大规模行为

Large-scale behavior of the partial duplication random graph

Felix Hermann, Peter Pfaffelhuber

AI总结:

本文研究部分复制随机图在大规模下的行为,刻画了孤立顶点频率、k-团数量、平均度与传递性比率的渐近性质,并显式描述了初始顶点度数的演化分布。

摘要:

以下随机图模型是为蛋白质-蛋白质相互作用网络的演化而引入的:设 $\mathcal G = (G_n)_{n=n_0, n_0+1,...}$ 是一列随机图,其中 $G_n = (V_n, E_n)$ 是一个具有 $|V_n|=n$ 个顶点的图,$n=n_0,n_0+1,...$。在状态 $G_n = (V_n, E_n)$ 下,从 $V_n$ 中均匀随机地选择一个顶点 $v\in V_n$,并对其进行部分复制。在这一事件发生时,会创建一个新顶点 $v'\notin V_n$,并且每条边 $\{v,w\} \in E_n$ 以概率 $p$ 被复制,即 $E_{n+1}$ 以概率 $p$ 包含边 $\{v',w\}$,且与所有其他边相互独立。在该图中,我们研究大 $n$ 情形下的若干方面。(i) 若 $p\leq p^* \approx 0.567143$,即 $pe^p=1$ 的唯一解,则孤立顶点的频率收敛于 1。(ii) $k$-团的数量 $C_k$ 的行为类似于 $n^{kp^{k-1}}$,其含义是:若初始图至少有一个 $k$-团,则 $n^{-kp^{k-1}}C_k$ 收敛于一个非平凡极限。特别地,顶点的平均度(等于边数——或 2-团数——除以图的规模)收敛于 0 当且仅当 $p<0.5$,并且我们得到该随机图的传递性比率具有 $n^{-2p(1-p)}$ 的数量级。(iii) 初始图中顶点度数的演化可以被显式地描述。在此,我们得到了完整分布以及收敛性结果。

英文摘要:

The following random graph model was introduced for the evolution of protein-protein interaction networks: Let $\mathcal G = (G_n)_{n=n_0, n_0+1,...}$ be a sequence of random graphs, where $G_n = (V_n, E_n)$ is a graph with $|V_n|=n$ vertices, $n=n_0,n_0+1,...$ In state $G_n = (V_n, E_n)$, a vertex $v\in V_n$ is chosen from $V_n$ uniformly at random and is partially duplicated. Upon such an event, a new vertex $v'\notin V_n$ is created and every edge $\{v,w\} \in E_n$ is copied with probability~$p$, i.e.\ $E_{n+1}$ has an edge $\{v',w\}$ with probability~$p$, independently of all other edges. Within this graph, we study several aspects for large~$n$. (i) The frequency of isolated vertices converges to~1 if $p\leq p^* \approx 0.567143$, the unique solution of $pe^p=1$. (ii) The number $C_k$ of $k$-cliques behaves like $n^{kp^{k-1}}$ in the sense that $n^{-kp^{k-1}}C_k$ converges against a non-trivial limit, if the starting graph has at least one $k$-clique. In particular, the average degree of a vertex (which equals the number of edges -- or 2-cliques -- divided by the size of the graph) converges to $0$ iff $p<0.5$ and we obtain that the transitivity ratio of the random graph is of the order $n^{-2p(1-p)}$. (iii) The evolution of the degrees of the vertices in the initial graph can be described explicitly. Here, we obtain the full distribution as well as convergence results.

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

↑