2014
DOI: 10.1063/1.4858457
|View full text |Cite
|
Sign up to set email alerts
|

Cross-linked structure of network evolution

Abstract: We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In th… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
94
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
8
2

Relationship

6
4

Authors

Journals

citations
Cited by 81 publications
(97 citation statements)
references
References 42 publications
1
94
0
Order By: Relevance
“…Finally, the application of concepts from algebraic topology (Fig. 3) attempts to discern non-random structure in networks by going beyond dyadic relations (two nodes linked by an edge) and considering non-dyadic, higher order relations among network nodes 63–65 , a goal that is complementary to that motivating the use of graphs in which edges can link any number of nodes, or so-called hypergraphs 66 . This approach can identify non-random structure in structural connectivity of cortical microcircuits 67 , such as unexpectedly high numbers of directed ‘all-to-all’ connected cliques of neurons, or cavities in which edges are conspicuously absent 68 .…”
Section: Network Analysis and Modelingmentioning
confidence: 99%
“…Finally, the application of concepts from algebraic topology (Fig. 3) attempts to discern non-random structure in networks by going beyond dyadic relations (two nodes linked by an edge) and considering non-dyadic, higher order relations among network nodes 63–65 , a goal that is complementary to that motivating the use of graphs in which edges can link any number of nodes, or so-called hypergraphs 66 . This approach can identify non-random structure in structural connectivity of cortical microcircuits 67 , such as unexpectedly high numbers of directed ‘all-to-all’ connected cliques of neurons, or cavities in which edges are conspicuously absent 68 .…”
Section: Network Analysis and Modelingmentioning
confidence: 99%
“…Degree and path length, along with other local and global network measures, are useful for characterizing networks at their most extreme topological scales: at the level of a network’s most commonly studied fundamental units (its nodes; although see Giusti et al, 2016 and Bassett et al, 2014 for alternatives) and the level of the network as a collective. Between these two scales lies a mesoscale, an intermediate scale at which a network can be characterized not in terms of local and global properties, but also in terms of differently sized clusters of nodes that adopt different types of configurations.…”
Section: Multi-scale Network Analysismentioning
confidence: 99%
“…These reconfigurations are more broadly characteristic of a flexible brain network organization [85,86], and individual differences in this flexibility of modular architecture predicts future learning rate [1]. Interestingly, this flexibility is produced by sets of edges that change in strength with one another instead of independently of one another [87], collectively linking a relatively stable core of regions that are thought to be necessary for task performance and a relatively flexible periphery of regions thought to be only supportive of task performance [88]. …”
Section: Reconfiguration Of Network Modules During Learningmentioning
confidence: 99%