{"paper":{"title":"On connectivity in a general random intersection graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.PR","physics.soc-ph"],"primary_cat":"cs.DM","authors_text":"Jun Zhao","submitted_at":"2015-08-17T00:56:55Z","abstract_excerpt":"There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graph $\\mathbb{G}(n,\\overrightarrow{a}, \\overrightarrow{K_n},P_n)$ defined on a set $\\mathcal{V}_n$ comprising $n$ vertices, where $\\overrightarrow{a}$ is a probability vector $(a_1,a_2,\\ldots,a_m)$ and $\\overrightarrow{K_n}$ is $(K_{1,n},K_{2,n},\\ldots,K_{m,n})$. This graph has been studied in the literature including a most recent work by Ya\\u{g}an [arXiv:1508.02407]. Suppose there is a pool $\\mathcal{P}_n$ consisting of $P_n$ distinct objects. The $n$ ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03890","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}