Scholarlink

Let \(G_1,\dots , G_m\) be independent identically distributed Bernoulli random subgraphs of the complete graph \(\mathcal{K}_n\) having random vertex sets and random edge densities. Assuming that each \(G_i\) has a vertex of degree 1 with positive probability, we establish the k-connectivity threshold as \(n,m\rightarrow +\infty \) for the union \(\cup _{i=1}^mG_i\) defined on the vertex set of \(\mathcal{K}_n\) .

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

k-Connectivity Threshold for Superpositions of Bernoulli Random Graphs

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Daumilas Ardickas,
  • Mindaugas Bloznelis,
  • Rimantas Vaicekauskas

摘要

Let \(G_1,\dots , G_m\) be independent identically distributed Bernoulli random subgraphs of the complete graph \(\mathcal{K}_n\) having random vertex sets and random edge densities. Assuming that each \(G_i\) has a vertex of degree 1 with positive probability, we establish the k-connectivity threshold as \(n,m\rightarrow +\infty \) for the union \(\cup _{i=1}^mG_i\) defined on the vertex set of \(\mathcal{K}_n\) .