Abstract
We analyse the threshold network model in which a pair of vertices with random weights are connected by an edge when the summation of the weights exceeds a threshold. We prove some convergence theorems and central limit theorems on the vertex degree, degree correlation and the number of prescribed subgraphs. We also generalize some results in the spatially extended cases.
| Original language | English |
|---|---|
| Pages (from-to) | 6277-6291 |
| Number of pages | 15 |
| Journal | Journal of Physics A: Mathematical and General |
| Volume | 38 |
| Issue number | 28 |
| DOIs | |
| State | Published - Jul 15 2005 |
Fingerprint
Dive into the research topics of 'Rigorous results on the threshold network model'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver