review-article

Free access

Elements of the theory of dynamic networks

Authors:

Othon Michail,

Paul G. SpirakisAuthors Info & Claims

Communications of the ACM, Volume 61, Issue 2

Page 72

https://doi.org/10.1145/3156693

Published: 23 January 2018 Publication History

All formats PDF

Abstract

The challenge of computing in a highly dynamic environment.

References

[1]

Akrida, E.C., Gasieniec, L.G, Mertzios, G.B. and Spirakis, P.G. Ephemeral networks with random availability of links: The case of fast networks. J. Parallel Distrib. Comput. 87 (2016), 109--120.

Digital Library

Google Scholar

[2]

Alistarh, D. and Gelashvili, R. Polylogarithmic-time leader election in population protocols. In Proceedings of ICALP, 2015, 479--491.

Digital Library

Google Scholar

[3]

Angluin, D. Local and global properties in networks of processors. In Proceedings of STOC, 1980, 82--93.

Digital Library

Google Scholar

[4]

Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J. and Peralta, R. Computation in networks of passively mobile finite-state sensors. In Proceedings of PODC, 2004, 290--299. Also in Distributed Computing, 2006.

Digital Library

Google Scholar

[5]

Angluin, D., Aspnes, J. and Eisenstat, D. Fast computation by population protocols with a leader. Distributed Computing 21, 3 (2008), 183--199.

Digital Library

Google Scholar

[6]

Angluin, D., Aspnes, J., Eisenstat, D. and Ruppert, E. The computational power of population protocols. Distributed Computing 20, 4 (2007), 279--304.

Digital Library

Google Scholar

[7]

Aspnes, J. and Ruppert, E. An introduction to population protocols. In Middleware for Network Eccentric and Mobile Applications, 2009, 97--120.

Google Scholar

[8]

Avin, C., Koucký, M. and Lotker, Z. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In Proceedings of ICALP, 2008, 121--132.

Digital Library

Google Scholar

[9]

Berman, K.A. Vulnerability of scheduled networks and a generalization of Menger's theorem. Networks 28, 3 (1996), 125--134.

Crossref

Google Scholar

[10]

Cardelli, L. Morphisms of reaction networks that couple structure to function. BMC Systems Biology 8, 1 (2014), 84.

Crossref

Google Scholar

[11]

Casteigts. A., Flocchini, P., Quattrociocchi, W. and Santoro, N. Time-varying graphs and dynamic networks. IJPEDS 27, 5 (2012), 387--4082.

Digital Library

Google Scholar

[12]

Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A. and Spirakis, P.G. Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412, 46 (2011), 6469--6483.

Digital Library

Google Scholar

[13]

Chen, H.-L., Cummings, R., Doty, D. and Soloveichik, D. Speed faults in computation by chemical reaction networks. In Proceedings of DISC, 2014, 16--30. Also in Distributed Computing, 2015.

Google Scholar

[14]

Clementi, A. E., Macci, C., Monti, A., Pasquale, F. and Silvestri, R. Flooding time in edge-markovian dynamic graphs. In Proceedings of PODC, 2008, 213--222.

Digital Library

Google Scholar

[15]

Czyzowicz, J. et al. On convergence and threshold properties of discrete lotka-volterra population protocols. In Proceedings of ICALP, 2015, 393--405.

Google Scholar

[16]

Doty, D. Theory of algorithmic self-assembly. Commun. ACM 55, 12 (Dec. 2012), 88.

Digital Library

Google Scholar

[17]

Doty, D. Timing in chemical reaction networks. In Proceedings of SODA, 2014, 772--784.

Digital Library

Google Scholar

[18]

Doty, D. and Soloveichik, D. Stable leader election in population protocols requires linear time. In Proceedings of DISC, 2015, 602--616.

Digital Library

Google Scholar

[19]

Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z. and Viola, E. On the complexity of information spreading in dynamic networks. In Proceedings of SODA, 2013, 717--736.

Digital Library

Google Scholar

[20]

Erlebach, T., Hoffmann, M. and Kammer, F. On temporal graph exploration. In Proceedings of ICALP, 2015, 444--455.

Google Scholar

[21]

Fischer, M.J., Lynch, N.A. and Paterson, M.S. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2 (1985) 374--382.

Digital Library

Google Scholar

[22]

Flocchini, P., Mans, B. and Santoro, N. On the exploration of time-varying networks. Theoretical Computer Science 469 (2013), 53--68.

Digital Library

Google Scholar

[23]

Guerraoui, R. and Ruppert, E. Names trump malice: Tiny mobile agents can tolerate byzantine failures. In Proceedings of ICALP, 2009, 484--495.

Digital Library

Google Scholar

[24]

Kempe, D., Kleinberg, J. and Kumar, A. Connectivity and inference problems for temporal networks. In Proceedings of STOC, 2000, 504--513.

Digital Library

Google Scholar

[25]

Kuhn, F., Lynch, N. and Oshman, R. Distributed computation in dynamic networks. In Proceedings of STOC, 2010, 513--522.

Digital Library

Google Scholar

[26]

Kuhn, F. and Oshman, R. Dynamic networks: models and algorithms. SIGACT News, 2011, 42:82--96.

Digital Library

Google Scholar

[27]

Lamport, L. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (July 1978), 558--565.

Digital Library

Google Scholar

[28]

Mertzios, G.B., Michail, O., Chatzigiannakis, I. and Spirakis, P.G. Temporal network optimization subject to connectivity constraints. In Proceedings of ICALP, 2013, 657--668.

Digital Library

Google Scholar

[29]

Michail, O. Terminating distributed construction of shapes and patterns in a fair solution of automata. In Proceedings of PODC, 2015, 37--46. Also in Distributed Computing, 2017

Digital Library

Google Scholar

[30]

Michail, O. An introduction to temporal graphs: An algorithmic perspective. Internet Mathematics 12, 4 (2016), 239--280.

Crossref

Google Scholar

[31]

Michail, O., Chatzigiannakis, I. and Spirakis, P.G. Mediated population protocols. Theoretical Computer Science 412, 22 (2011), 2434--2450.

Digital Library

Google Scholar

[32]

Michail, O., Chatzigiannakis, I. and Spirakis, P.G. New Models for Population Protocols. N.A. Lynch, ed. Morgan & Claypool, 2011.

Google Scholar

[33]

Michail, O., Chatzigiannakis, I. and Spirakis, P.G. Causality, influence, and computation in possibly disconnected synchronous dynamic networks. J. Parallel Distrib. Comput. 74, 1 (2014), 2016--2026.

Digital Library

Google Scholar

[34]

Michail, O. and Spirakis, P.G. How many cooks spoil the soup? In Proceedings of SIROCCO, 2016, 3--18.

Google Scholar

[35]

Michail, O. and Spirakis, P.G. Simple and efficient local codes for distributed stable network construction. Distributed Computing 29, 3 (2016), 207--237.

Digital Library

Google Scholar

[36]

Michail, O. and Spirakis, P.G. Traveling salesman problems in temporal graphs. Theoretical Computer Science 634, 2016, 1--23.

Digital Library

Google Scholar

[37]

Mone, G. The new smart cities. Commun. ACM 58, 7 (July 2015), 20--21.

Digital Library

Google Scholar

[38]

O'Dell, R. and Wattenhofer, R. Information dissemination in highly dynamic graphs. In Proceedings of DIALM-POMC, 2005, 104--10.

Digital Library

Google Scholar

[39]

Rubenstein, M., Cornejo, A. and Nagpal, R. Programmable self-assembly in a thousand-robot swarm. Science 345, 6198 (2014), 795--799.

Crossref

Google Scholar

Cited By

View all

Mertzios GMolter HRenken MSpirakis PZschoche P(2025)The complexity of transitively orienting temporal graphsJournal of Computer and System Sciences10.1016/j.jcss.2025.103630150(103630)Online publication date: Jun-2025
https://doi.org/10.1016/j.jcss.2025.103630
Mertzios GMichail OSkretas GSpirakis PTheofilatos M(2025)The complexity of growing a graphJournal of Computer and System Sciences10.1016/j.jcss.2024.103587147(103587)Online publication date: Feb-2025
https://doi.org/10.1016/j.jcss.2024.103587
Ekle OEberle W(2024)Anomaly Detection in Dynamic Graphs: A Comprehensive SurveyACM Transactions on Knowledge Discovery from Data10.1145/366990618:8(1-44)Online publication date: 29-May-2024
https://dl.acm.org/doi/10.1145/3669906
Show More Cited By

Index Terms

Elements of the theory of dynamic networks
1. Networks
  1. Network properties
    1. Network dynamics
    2. Network reliability
  2. Network protocols
    1. Network protocol design

Recommendations

Weighted overconstrained least-squares mixed finite elements for static and dynamic problems in quasi-incompressible elasticity

The main goal of this contribution is the improvement of the approximation quality of least-squares mixed finite elements for static and dynamic problems in quasi-incompressible elasticity. Compared with other variational approaches as for example the ...
The Enriched Crouzeix---Raviart Elements are Equivalent to the Raviart---Thomas Elements

For both the Poisson model problem and the Stokes problem in any dimension, this paper proves that the enriched Crouzeix---Raviart elements are actually identical to the first order Raviart---Thomas elements in the sense that they produce the same ...
Mortar Boundary Elements

We establish a mortar boundary element scheme for hypersingular boundary integral equations representing elliptic boundary value problems in three dimensions. We prove almost quasi-optimal convergence of the scheme in broken Sobolev norms of order $1/2$...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 61, Issue 2

February 2018

94 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/3181977

Editor:
Andrew A. Chien
Association for Computing Machinery, New York, NY

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 January 2018

Published in CACM Volume 61, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Review-article
Popular
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

54
Total Citations
View Citations
5,151
Total Downloads

Downloads (Last 12 months)450
Downloads (Last 6 weeks)57

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mertzios GMolter HRenken MSpirakis PZschoche P(2025)The complexity of transitively orienting temporal graphsJournal of Computer and System Sciences10.1016/j.jcss.2025.103630150(103630)Online publication date: Jun-2025
https://doi.org/10.1016/j.jcss.2025.103630
Mertzios GMichail OSkretas GSpirakis PTheofilatos M(2025)The complexity of growing a graphJournal of Computer and System Sciences10.1016/j.jcss.2024.103587147(103587)Online publication date: Feb-2025
https://doi.org/10.1016/j.jcss.2024.103587
Ekle OEberle W(2024)Anomaly Detection in Dynamic Graphs: A Comprehensive SurveyACM Transactions on Knowledge Discovery from Data10.1145/366990618:8(1-44)Online publication date: 29-May-2024
https://dl.acm.org/doi/10.1145/3669906
Abrahão FWehmuth KZenil HZiviani A(2024)On Sequential Structures in Incompressible Multidimensional NetworksParallel Processing Letters10.1142/S012962642450011734:03n04Online publication date: 20-Nov-2024
https://doi.org/10.1142/S0129626424500117
Safdari HDe Bacco C(2024)Community detection and anomaly prediction in dynamic networksCommunications Physics10.1038/s42005-024-01889-y7:1Online publication date: 5-Dec-2024
https://doi.org/10.1038/s42005-024-01889-y
Klobas NMertzios GMolter HSpirakis P(2024)The complexity of computing optimum labelings for temporal connectivityJournal of Computer and System Sciences10.1016/j.jcss.2024.103564146:COnline publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1016/j.jcss.2024.103564
Erlebach TMorawietz NSpooner JWolf P(2024)A cop and robber game on edge-periodic temporal graphsJournal of Computer and System Sciences10.1016/j.jcss.2024.103534144:COnline publication date: 18-Jul-2024
https://dl.acm.org/doi/10.1016/j.jcss.2024.103534
Mertzios GNikoletseas SRaptopoulos CSpirakis P(2024)The Threshold of Existence of -Temporal Cliques in Random Simple Temporal GraphsAlgorithmics of Wireless Networks10.1007/978-3-031-74580-5_10(131-143)Online publication date: 5-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-74580-5_10
Yu EFu YZhou JSun HChen D(2023)Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional NetworksApplied Sciences10.3390/app1312727213:12(7272)Online publication date: 18-Jun-2023
https://doi.org/10.3390/app13127272
Di Luna GViglietta GOshman RNolin AHalldorsson MBalliu A(2023)Brief Announcement: Efficient Computation in Congested Anonymous Dynamic NetworksProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594590(176-179)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594590
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Weighted overconstrained least-squares mixed finite elements for static and dynamic problems in quasi-incompressible elasticity

The Enriched Crouzeix---Raviart Elements are Equivalent to the Raviart---Thomas Elements

Mortar Boundary Elements

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Digital Edition

Magazine Site

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations