Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 361-377 |
| Number of pages | 17 |
| Journal | Methodology and Computing in Applied Probability |
| Volume | 12 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2010 |
Keywords
- Complex networks
- Random graphs
- Threshold network models
Fingerprint
Dive into the research topics of 'Statistical properties of a generalized threshold network model'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver