Threshold functions in random subgraph counting in the random-connection model
Random-connection model serves as a prominent graph model other than the Erdős-Rényi model and the random geometric graph. The majority of the properties in the random-connection model has yet to be found. This thesis follows on from previous research on the normal approximation of subgraph counts a...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
Nanyang Technological University
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/175628 |