2019
DOI: 10.1093/comnet/cnz027
|View full text |Cite
|
Sign up to set email alerts
|

Rock–paper–scissors dynamics from random walks on temporal multiplex networks

Abstract: We study diffusion on a multilayer network where the contact dynamics between the nodes is governed by a random process and where the waiting time distribution differs for edges from different layers. We study the impact on a random walk of the competition that naturally emerges between the edges of the different layers. In opposition to previous studies which have imposed a priori inter-layer competition, the competition is here induced by the heterogeneity of the activity on the different layers. We first st… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 29 publications
(35 reference statements)
0
4
0
Order By: Relevance
“…These methods are mostly based on random walks (Gueuning et al. 2019 ) or centrality measures in a network with the advantage of low computational cost. The use of graph theory in numerical simulation problems such as the Cuthill–McKee algorithm (Cuthill and McKee 1969 ) already occurs, for example, for sorting multidimensional grid points in a more efficient way (in terms of reducing the matrix band).…”
Section: State-observation Localization Based On Graph Clustering Methodsmentioning
confidence: 99%
“…These methods are mostly based on random walks (Gueuning et al. 2019 ) or centrality measures in a network with the advantage of low computational cost. The use of graph theory in numerical simulation problems such as the Cuthill–McKee algorithm (Cuthill and McKee 1969 ) already occurs, for example, for sorting multidimensional grid points in a more efficient way (in terms of reducing the matrix band).…”
Section: State-observation Localization Based On Graph Clustering Methodsmentioning
confidence: 99%
“…5a) to simulate the virus spread in social networks. In general, multi-layer networks (De Domenico et al 2016) are widely used to study graph diffusion problems (Gueuning et al 2019). Recently, multilayer modelling has also been applied to COVID-19 spread simulation (Scabini et al 2021) where each layer refers to a potential contamination community, such as school, workplace or transport.…”
Section: Multi-layer Modelling Of Scale-free Networkmentioning
confidence: 99%
“…5(a)), for simulating the virus spread in social networks. In general, multi-layer (also known as "multiplex") networks [15] are widely used to study graph diffusion problems [24] and to define generalized versions of Pagerank [16]. Recently, multi-layer modelling has also been applied to COVID-19 spread simulation [49] where each layer refers to a potential contamination community, such as school, workplace or transport.…”
Section: Multi-layer Modelling Of Scale-free Networkmentioning
confidence: 99%