{"id":282682,"date":"2021-06-24T14:19:16","date_gmt":"2021-06-24T11:19:16","guid":{"rendered":"https:\/\/en.buradabiliyorum.com\/designing-temporal-networks-that-synchronize-under-resource-constraints\/"},"modified":"2021-06-24T14:19:16","modified_gmt":"2021-06-24T11:19:16","slug":"designing-temporal-networks-that-synchronize-under-resource-constraints","status":"publish","type":"post","link":"https:\/\/buradabiliyorum.com\/en\/designing-temporal-networks-that-synchronize-under-resource-constraints\/","title":{"rendered":"#Designing temporal networks that synchronize under resource constraints"},"content":{"rendered":"

“#Designing temporal networks that synchronize under resource constraints<\/strong>”<\/p>\n

\n
\n
\n
\"Designing
\n Designing temporal networks that synchronize better than optimal static networks. a Evolution of the nonzero Laplacian eigenvalues described in Eq. (5), which are split into two degenerate groups. b Temporal network constructed from the Laplacian eigenvalues in a. The weight of each edge is represented by its thickness. In addition, edges whose weight is larger than 1n1n are colored orange, whereas those with weight less than 1n1n are colored cyan. For this network diagram, we set n\u2009=\u200911 and m\u2009=\u20095, and the corresponding weighted adjacency matrix is given by Eq. (9). Visually, we can see that different parts of the network are being strengthened in an alternating fashion. From: Designing temporal networks that synchronize under resource constraints
\n <\/figcaption><\/figure>\n<\/div>\n<\/div>\n

Synchronization is critical for the function of many distributed systems\u2014whether it’s computers or power grids or neuronal populations\u2014but doing it using the least amount of energy and resources possible can be a daunting task.<\/p>\n

In a paper published in Nature Communications<\/i> in June 2021, incoming SFI Postdoctoral Fellow Yuanzhao Zhang and former SFI external faculty member Steve Strogatz report using temporal network models to show that allowing connection patterns to change over time makes it possible to synchronize a system more efficiently.<\/p>\n

“This was a fun project started by accident,” says Zhang. “I was researching circadian clocks and came across an interesting paper about the energy cost of synchronizing them. It piqued my curiosity, so I wanted to figure out the best way to synchronize a generic networked system using the least amount of resources.”<\/p>\n

The researchers’ temporal network design is “open loop,” so it’s versatile and expected to work for a wide range of systems.\n <\/p>\n\n

\n

Exploring partial synchronization in networked systems\n <\/p><\/div>\n

\n
\n More information:<\/strong>
\n Yuanzhao Zhang et al, Designing temporal networks that synchronize under resource constraints, Nature Communications<\/i> (2021). DOI: 10.1038\/s41467-021-23446-9<\/a><\/p><\/div>\n
\n Provided by
\n Santa Fe Institute
\n
\n <\/svg><\/a><\/p><\/div>\n

<\/p>\n

\n

Citation<\/strong>:
\n Designing temporal networks that synchronize under resource constraints (2021, June 24)
\n retrieved 24 June 2021
\n from https:\/\/techxplore.com\/news<\/a>\/2021-06-temporal-networks-synchronize-resource-constraints.html<\/p>\n

This document is subject to copyright. Apart from any fair dealing for the purpose of private study or research, no
\n part may be reproduced without the written permission. The content is provided for information purposes only.<\/p><\/div>\n<\/p><\/div>\n