Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

k-connectivity threshold for superpositions of Bernoulli random graphs (2503.16925v1)

Published 21 Mar 2025 in math.PR

Abstract: Let $G_1,\dots, G_m$ be independent identically distributed Bernoulli random subgraphs of the complete graph ${\cal K}n$ having vertex sets of random sizes $X_1,\dots, X_m\in {0,1,2,\dots}$ and random edge densities $Q_1,\dots, Q_m\in [0,1]$. Assuming that each $G_i$ has a vertex of degree $1$ with positive probability, we establish the $k$-connectivity threshold as $n,m\to+\infty$ for the union $\cup{i=1}mG_i$ defined on the vertex set of ${\cal K}_n$.

Summary

We haven't generated a summary for this paper yet.