Report
Poisson approximation of counts of subgraphs in random intersection graphs
| العنوان: | Poisson approximation of counts of subgraphs in random intersection graphs |
|---|---|
| المؤلفون: | Rybarczyk, Katarzyna, Stark, Dudley |
| سنة النشر: | 2016 |
| المجموعة: | Mathematics |
| مصطلحات موضوعية: | Mathematics - Combinatorics, 05C80 |
| الوصف: | Random intersection graphs are characterized by three parameters: $n$, $m$ and $p$, where $n$ is the number of vertices, $m$ is the number of objects, and $p$ is the probability that a given object is associated with a given vertex. Two vertices in a random intersection graph are adjacent if and only if they have an associated object in common. When $m=\lfloor n^\alpha\rfloor$ for constant $\alpha$, we provide a condition, called {\em strictly $\alpha$-balanced}, for the Poisson convergence of the number of induced copies of a fixed subgraph. Comment: 17 pages, submitted version |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/1609.01699 |
| رقم الانضمام: | edsarx.1609.01699 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |