2015
DOI: 10.1007/978-3-319-16619-3_4
|View full text |Cite
|
Sign up to set email alerts
|

Network Dynamics as an Inverse Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 100 publications
(257 reference statements)
0
9
0
Order By: Relevance
“…Other properties such as edge weights, connectivity pattern or degree sequence are indistinguishable and cannot be reconstructed ( proposition 2b in electronic supplementary material 5). This is a consequence of the assumed prior knowledge of the coupling functions, because only the adjacency pattern is invariant to the transformations in G indistinguishability will appear if the temporal data are not informative enough in the sense that different interaction matrices produce the same node trajectories (figure 2b); see, for example, [37,38] and references therein. Equation (1.4) shows that indistinguishability due to uninformative data appears when v 1 À v 2 [ ker M i and ker M i contains a subspace different from 0.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Other properties such as edge weights, connectivity pattern or degree sequence are indistinguishable and cannot be reconstructed ( proposition 2b in electronic supplementary material 5). This is a consequence of the assumed prior knowledge of the coupling functions, because only the adjacency pattern is invariant to the transformations in G indistinguishability will appear if the temporal data are not informative enough in the sense that different interaction matrices produce the same node trajectories (figure 2b); see, for example, [37,38] and references therein. Equation (1.4) shows that indistinguishability due to uninformative data appears when v 1 À v 2 [ ker M i and ker M i contains a subspace different from 0.…”
Section: Introductionmentioning
confidence: 99%
“…This is a consequence of the assumed prior knowledge of the coupling functions, because only the adjacency pattern is invariant to the transformations in G Ã i , but other properties of A are not. Second, even if the coupling functions are exactly known, indistinguishability will appear if the temporal data are not informative enough in the sense that different interaction matrices produce the same node trajectories (figure 2b); see, for example, [37,38] and references therein. Equation (1.4) shows that indistinguishability due to uninformative data appears when v 1 À v 2 [ ker M i and ker M i contains a subspace different from 0.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Designing a network often means to engineer network static structures for particular function. And thanks to the intricate relation existing between the function and structure in networks, very disparate networks may yield identical dynamics [24]. This phenomenon has been reported in networks of spiking neurons [25][26][27] and gene regulatory networks [28,29].…”
Section: Introductionmentioning
confidence: 86%
“…As an example, we rewire networks of Kuramoto [86] and Kuramoto-like [87] oscillators with random network topologies into different networks that display the same collective dynamics. Parts of the results of this chapter were published in [24].…”
Section: Chapter Parametrization Of Network Dynamicsmentioning
confidence: 99%