Heterogeneous network with distance dependent connectivity

dc.creatorMedo, Matus
dc.creatorSmrek, Jan
dc.date2008-02-11
dc.date2008-06-06
dc.date.accessioned2026-07-07T09:45:46Z
dc.date.available2026-07-07T09:45:46Z
dc.descriptionWe investigate a network model based on an infinite regular square lattice embedded in the Euclidean plane where the node connection probability is given by the geometrical distance of nodes. We show that the degree distribution in the basic model is sharply peaked around its mean value. Since the model was originally developed to mimic the social network of acquaintances, to broaden the degree distribution we propose its generalization. We show that when heterogeneity is introduced to the model, it is possible to obtain fat tails of the degree distribution. Meanwhile, the small-world phenomenon present in the basic model is not affected. To support our claims, both analytical and numerical results are obtained.
dc.description6 pages, 4 figures, minor clarifications and references added
dc.identifierhttps://arxiv.org/abs/0802.1431
dc.identifierhttp://arxiv.org/abs/0802.1431
dc.identifierEuropean Physical Journal B 63, 273-278 (2008)
dc.identifierdoi:10.1140/epjb/e2008-00236-4
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163306
dc.subjectPhysics and Society
dc.titleHeterogeneous network with distance dependent connectivity
dc.typetext

Files

Collections