抄録
The threshold network model is a type of finite random graph. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of weights belong to given Borel sets. We extend several known limit theorems for the number of prescribed subgraphs and prove a uniform strong law of large numbers. We also prove two limit theorems for the local and global clustering coefficients.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 361-377 |
| ページ数 | 17 |
| ジャーナル | Methodology and Computing in Applied Probability |
| 巻 | 12 |
| 号 | 3 |
| DOI | |
| 出版ステータス | Published - 2010 |
| 外部発表 | はい |
ASJC Scopus subject areas
- 統計学および確率
- 数学 (全般)