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...
Saved in:
Main Author: | Chan, Luo Xi |
---|---|
Other Authors: | Nicolas Privault |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/175628 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Fast detection of dense subgraphs with iterative shrinking and expansion
by: Liu, H., et al.
Published: (2014) -
gSWORD: GPU-accelerated sampling for subgraph counting
by: YE, Chang, et al.
Published: (2024) -
APPLICATION OF MULTIVARIATE CENTRAL LIMIT THEOREM IN FINGERPRINT DISTRIBUTION AND CENTRED SUBGRAPH COUNT
by: LI SHANG
Published: (2023) -
Random subgraph counts and u-statistics: Multivariate normal approximation via exchangeable pairs and embedding
by: Reinert, G., et al.
Published: (2014) -
FERRARI: an efficient framework for visual exploratory subgraph search in graph databases
by: Wang, Chaohui, et al.
Published: (2022)