2020
DOI: 10.1137/18m1201019
|View full text |Cite
|
Sign up to set email alerts
|

Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

1
152
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 185 publications
(179 citation statements)
references
References 84 publications
1
152
0
Order By: Relevance
“…Different generalizations of the Laplacian operator have been proposed so far in the literature to include higher orders of interactions: from the simplest versions for uniform hypergraphs [45,46], to those more complicated associated with simplicial complexes [47][48][49] and Hodge Laplacians [25,50], to mention a few. Let us notice that these Laplacians describe the hierarchy among building blocks of the topology, and different orders are associated with Laplacian matrices of different sizes, where the order zero is the traditional node point of view; the first order represents the edge perspective where the Laplacian size is equal to the number of pairwise connections, and each entry is associated with edge adjacency; the second-order Laplacian has a different size again, being based on the existing triangles, and so on.…”
Section: Multiorder Laplacianmentioning
confidence: 99%
See 1 more Smart Citation
“…Different generalizations of the Laplacian operator have been proposed so far in the literature to include higher orders of interactions: from the simplest versions for uniform hypergraphs [45,46], to those more complicated associated with simplicial complexes [47][48][49] and Hodge Laplacians [25,50], to mention a few. Let us notice that these Laplacians describe the hierarchy among building blocks of the topology, and different orders are associated with Laplacian matrices of different sizes, where the order zero is the traditional node point of view; the first order represents the edge perspective where the Laplacian size is equal to the number of pairwise connections, and each entry is associated with edge adjacency; the second-order Laplacian has a different size again, being based on the existing triangles, and so on.…”
Section: Multiorder Laplacianmentioning
confidence: 99%
“…A stream of research has recently focused on correctly characterizing the structure of systems with higher-order interactions [14][15][16][17][18][19][20]. Interestingly, considering this additional level of complexity sometimes leads to changes in the emerging dynamics of complex systems, including social contagions [21,22], activity-driven models [23], diffusion [24,25], random walks [26,27], and evolutionary games [28].…”
Section: Introductionmentioning
confidence: 99%
“…For instance scientific authors naturally team up in larger groups to complement the expertise of different members 22 , neurons send and receive stimuli from multiple adjacent partners at the same time 21 , 23 , and the stability of large ecosystems relies on mutual and cooperative partnerships often involving three or more species 24 , 25 . Besides, higher-order interactions were shown to significantly modify the collective behavior of many dynamical processes, from diffusion 26 , 27 and synchronization 28 30 to spreading 31 , 32 , social dynamics 33 , 34 and games 35 . For a thorough introduction on the structure and dynamics of these higher-order systems, we refer the interested reader to the comprehensive overview provided in Ref 19 .…”
Section: Introductionmentioning
confidence: 99%
“…This has profound consequences for network models of relational data— a cornerstone in the interdisciplinary study of complex systems. For example, higher-order dependencies have been shown to either speed up or slow down dynamical processes [8, 9, 10], change node rankings [11, 12, 13], and alter community structures [12, 14, 15, 16, 17, 18].…”
mentioning
confidence: 99%