6533b82dfe1ef96bd1291eac
RESEARCH PRODUCT
Transience versus recurrence for scale-free spatial networks
Peter GracarMarkus HeydenreichPeter MörtersChristian Mönchsubject
Class (set theory)Theoretical computer scienceScale (ratio)Computer scienceBoolean model010102 general mathematicsLocal area networkDegree distributionPreferential attachment01 natural sciencesConnection (mathematics)010104 statistics & probability0101 mathematicsCluster analysisdescription
Weight-dependent random connection graphs are a class of local network models that combine scale-free degree distribution, small-world properties and clustering. In this paper we discuss recurrence or transience of these graphs, features that are relevant for the performance of search and information diffusion algorithms on the network.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2020-01-01 |