Pith. sign in

REVIEW

STAND: A Spatio-Temporal Algorithm for Network Diffusion Simulation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1904.05998 v3 pith:PGPQ3ULM submitted 2019-04-12 cs.SI physics.soc-ph

classification cs.SIphysics.soc-ph
keywords diffusionnetworkprocessdifferentindividualtimealgorithmcontagions
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Information, ideas, and diseases, or more generally, contagions, spread over space and time through individual transmissions via social networks, as well as through external sources. A detailed picture of any diffusion process can be achieved only when both a good network structure and individual diffusion pathways are obtained. The advent of rich social, media and locational data allows us to study and model this diffusion process in more detail than previously possible. Nevertheless, how information, ideas or diseases are propagated through the network as an overall process is difficult to trace. This propagation is continuous over space and time, where individual transmissions occur at different rates via complex, latent connections. To tackle this challenge, a probabilistic spatiotemporal algorithm for network diffusion (STAND) is developed based on the survival model in this research. Both time and spatial distance are used as explanatory variables to simulate the diffusion process over two different network structures. The aim is to provide a more detailed measure of how different contagions are transmitted through various networks where nodes are geographic places at a large scale.

Discussion (0). Continue with ORCID to comment.

Pith tools