Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/31283
DC FieldValueLanguage
dc.contributor.authorPapadopoulos, Fragkiskos-
dc.contributor.authorFlores, Marco Antonio Rodríguez-
dc.date.accessioned2024-02-15T08:43:02Z-
dc.date.available2024-02-15T08:43:02Z-
dc.date.issued2022-07-27-
dc.identifier.citationInternational School and Conference on Network Science , 2022, 25 – 29 July, Shanghaien_US
dc.identifier.urihttps://hdl.handle.net/20.500.14279/31283-
dc.description.abstractProximity networks are time-varying graphs representing the closeness among humans moving in a physical space. Understanding their properties is critical because they affect the behavior of disease and information spreading, as well as the formation and evolution of communities. Interestingly, a simple model of mobile agents, which assumes the agents perform random walks, reproduces a wide variety of these properties. However, until recently the mechanisms responsible for more complex social behavior remained elusive. Specifically, random walks cannot reproduce the recurrent formation of groups of the same people, which originate from human motion patterns that are far from random. We show that many of the properties of proximity networks, including the formation of recurrent groups (components), emerge naturally and simultaneously in a simple latent space model, called dynamic-S1. The dynamic-S1 does not model agent mobility, but captures their connectivity in each snapshot--each snapshot in the model is a realization of the S1 model of traditional complex networks, which is isomorphic to random hyperbolic graphs. By forgoing the motion component the model facilitates mathematical analysis, allowing us to prove the contact, inter-contact and weight distributions. We show that these distributions are power laws in the thermodynamic limit with exponents lying within the ranges observed in real systems. Furthermore, the behavior of compartmental epidemic spreading processes, such as SIS and SEIR, is remarkably similar in real and modeled networks. We have also shown that the time-aggregated representation of real human proximity networks can be meaningfully embedded into hyperbolic space, using methods developed for the S1 model. Using the resulting embeddings one can identify communities, facilitate greedy routing on the temporal network, and predict future links. Taken altogether, our results indicate that dynamic random hyperbolic graphs are adequate null models of human proximity networks.en_US
dc.formatpdfen_US
dc.language.isoenen_US
dc.rightsCC0 1.0 Universalen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.subjectProximity networksen_US
dc.subjectDynamic random hyperbolic graphsen_US
dc.titleModeling human proximity networks with random hyperbolic graphsen_US
dc.typeConference Papersen_US
dc.linkhttps://netsci2022.net/en_US
dc.collaborationCyprus University of Technologyen_US
dc.subject.categoryMathematicsen_US
dc.subject.categoryComputer and Information Sciencesen_US
dc.subject.categoryPhysical Sciencesen_US
dc.countryCyprusen_US
dc.subject.fieldNatural Sciencesen_US
dc.subject.fieldEngineering and Technologyen_US
dc.publicationPeer Revieweden_US
dc.relation.conferenceInternational School and Conference on Network Scienceen_US
cut.common.academicyear2021-2022en_US
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_c94f-
item.openairetypeconferenceObject-
item.languageiso639-1en-
crisitem.author.deptDepartment of Electrical Engineering, Computer Engineering and Informatics-
crisitem.author.facultyFaculty of Engineering and Technology-
crisitem.author.orcid0000-0002-4072-5781-
crisitem.author.parentorgFaculty of Engineering and Technology-
Appears in Collections:Δημοσιεύσεις σε συνέδρια /Conference papers or poster or presentation
CORE Recommender
Show simple item record

Page view(s)

61
Last Week
3
Last month
10
checked on May 11, 2024

Google ScholarTM

Check


This item is licensed under a Creative Commons License Creative Commons