A biological solution to a fundamental distributed computing problem, Science, vol.331, issue.6014, pp.183-185, 2011. ,
Computation in networks of passively mobile finite-state sensors. Distributed computing, vol.18, pp.235-253, 2006. ,
and René Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, vol.18, 2006. ,
, For example, their eigenvector computation algorithm has distinct averaging and orthogonalization phases
A simple population protocol for fast robust approximate majority, Preliminary version in DISC'07), vol.21, pp.87-102, 2008. ,
Time-space Trade-offs in Population Protocols, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '17, pp.2560-2579, 2017. ,
Self-stabilizing population protocols, ACM Transactions on Autonomous and Adaptive Systems (TAAS), vol.3, issue.4, p.13, 2008. ,
Space-Optimal Majority in Population Protocols, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings, pp.2221-2239, 2018. ,
Exact recovery in the stochastic block model, IEEE Trans. on Information Theory, vol.62, issue.1, pp.471-487, 2014. ,
Explicit construction of linear sized tolerant networks, Discrete Mathematics, vol.72, issue.1, pp.15-19, 1988. ,
Reversible markov chains and random walks on graphs, 1995. ,
Stabilizing consensus in mobile networks, Proceedings of Distributed Computing in Sensor Systems (DCOSS'06), vol.4026, pp.37-50, 2006. ,
Polylogarithmic-time leader election in population protocols, Proceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming, vol.9135, pp.479-491, 2015. ,
Fast and Exact Majority in Population Protocols, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, 2015. ,
Interacting particle systems as stochastic social dynamics, Bernoulli, vol.19, issue.4, pp.1122-1149, 2013. ,
An introduction to population protocols, Bulletin of the EATCS, vol.93, pp.98-117, 2007. ,
Distributed computing: fundamentals, simulations, and advanced topics, vol.19, 2004. ,
A self-stabilizing transformer for population protocols with covering, Theoretical Computer Science, vol.412, issue.33, pp.4247-4259, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00531379
Ignore or comply?: On breaking symmetry in consensus, Proceedings of the 36th ACM Symposium on Principles of Distributed Computing, PODC'17, pp.335-344, 2017. ,
Average whenever you meet: Opportunistic protocols for community detection, 26th Annual European Symposium on Algorithms, ESA 2018, vol.7, pp.1-7, 2018. ,
Plurality consensus in the gossip model, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'15), pp.371-390, 2015. ,
Stabilizing consensus with many opinions, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'16, 2016. ,
, Simple dynamics for plurality consensus. Distributed Computing (Ext. Abs. in ACM SPAA'14), vol.30, pp.293-306, 2017.
Find your place: Simple distributed algorithms for community detection, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'17), pp.940-959, 2017. ,
Friend or foe? population protocols can perform community detection, 2017. ,
Randomized gossip algorithms, IEEE Transactions on Information Theory, pp.2508-2530, 2006. ,
Interval consensus: From quantized gossip to voting, Proceedings of the 34th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '09, pp.3661-3664, 2009. ,
The Distributed Multiple Voting Problem, IEEE Journal of Selected Topics in Signal Processing, vol.5, issue.4, pp.791-804, 2011. ,
Rumor spreading in random evolving graphs. Random Struct, Algorithms, vol.48, issue.2, pp.290-312, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-00922696
The cell cycle switch computes approximate majority, Scientific Reports, vol.2, 2012. ,
A markov chain algorithm for compression in self-organizing particle systems, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC '16, pp.279-288 ,
The power of two choices in distributed voting, Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP'14), vol.8573, pp.435-446, 2014. ,
Fast consensus for voting on general expander graphs, Distributed Computing: 29th International Symposium, (DISC '15), pp.248-262, 2015. ,
A tight analysis of the parallel undecided-state dynamics with two colors, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-02002476
Brief announcement: On the parallel undecided-state dynamics with two colors, 31st International Symposium on Distributed Computing, vol.47, pp.1-47, 2017. ,
Natural algorithms and influence systems, Commun. ACM, vol.55, issue.12, pp.101-110, 2012. ,
Distributed community detection in dynamic graphs, Theor. Comput. Sci, vol.584, pp.19-41, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-02002648
An exponential separation between randomized and deterministic complexity in the LOCAL model, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS, pp.615-624, 2016. ,
Chemical Reaction Network Designs for Asynchronous Logic Circuits, pp.67-81, 2016. ,
Almost tight bounds for rumour spreading with conductance, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp.399-408, 2010. ,
Rumor spreading in social networks, Theoretical Computer Science, vol.412, issue.24, pp.2602-2610, 2011. ,
Phase transition of the 2-choices dynamics on core-periphery networks, Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '18, pp.777-785, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02002658
Distributed Community Detection via Metastability of the 2-Choices Dynamics, AAAI 2019 -Thirty-Third AAAI Conference Association for the Advancement of Artificial Intelligence, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02002462
, Graph partitioning via adaptive spectral techniques. Combinatorics, Probability and Computing, vol.19, pp.227-284, 2010.
Fast plurality consensus in regular expanders, DISC, 2017. ,
Programmability of chemical reaction networks, Algorithmic Bioprocesses, pp.543-584, 2009. ,
Brief announcement: Amoebot -a new model for programmable matter, Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'14), pp.220-222, 2014. ,
Reaching a consensus, Journal of the American Statistical Association, vol.69, issue.345, pp.118-121, 1974. ,
Othon Michail, Paul G Spirakis, and Michail Theofilatos, Exact size counting in uniform population protocols in nearly logarithmic time, 2018. ,
The solution of some random NP-hard problems in polynomial expected time, Journal of Algorithms, vol.10, issue.4, pp.451-489, 1989. ,
Epidemic algorithms for replicated database maintenance, Proceedings of the 6th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'12), pp.1-12, 1987. ,
Stabilizing consensus with the power of two choices, Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'11), pp.149-158, 2011. ,
On self-stabilizing synchronous actions despite byzantine attacks, Proceedings of the International Symposium on Distributed Computing (DISC'07), pp.193-207, 2007. ,
Self-stabilizing systems in spite of distributed control, Communications of the ACM, vol.17, issue.11, pp.643-644, 1974. ,
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications, Physical Review E, vol.84, issue.6, p.66106, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00661643
When consensus meets self-stabilization, J. Comput. Syst. Sci, vol.76, issue.8, pp.884-900, 2010. ,
Self-stabilization, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00627780
Self-Stabilization, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00627780
Timing in chemical reaction networks, Proceedings of 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'14), pp.772-784, 2014. ,
Convergence speed of binary interval consensus, SIAM Journal on Control and Optimization, vol.50, issue.3, pp.1087-1109, 2012. ,
Brief announcement: Rapid asynchronous plurality consensus, Proceedings of the 36th Annnual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, (PODC'17) (full version at ArXive, pp.363-365, 2017. ,
Breathe before speaking: Efficient information dissemination despite noisy, limited and anonymous communication, Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC '14), pp.114-123, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01672280
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication, Distributed Computing, pp.1-17, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01672280
Social influence and opinions, The Journal of Mathematical Sociology, vol.15, issue.3-4, pp.193-206, 1990. ,
Theoretical distributed computing meets biology: A review, International Conference on Distributed Computing and Internet Technology, pp.1-18, 2013. ,
Towards a complexity theory for local distributed computing, Journal of the ACM (JACM), vol.60, issue.5, p.35, 2013. ,
Noisy rumor spreading and plurality consensus, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC'16), pp.127-136, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01423686
Information flow, opinion polling and collective intelligence in house-hunting social insects, Philosophical Transactions of the Royal Society of London B: Biological Sciences, vol.357, pp.1567-1583, 1427. ,
Tight bounds for rumor spreading in graphs of a given conductance, Symposium on Theoretical Aspects of Computer Science (STACS'11), pp.57-68, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-00573638
Nearly-tight analysis for 2-choice and 3-majority consensus dynamics, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (PODC'18), pp.305-313, 2018. ,
Opinion dynamics driven by various ways of averaging, Comput. Econ, vol.25, issue.4, pp.381-405, 2005. ,
Distributed Probabilistic Polling and Applications to Proportionate Agreement. Information and Computation, vol.171, pp.248-268, 2001. ,
The metropolis algorithm for graph bisection, Discrete Applied Mathematics, vol.82, issue.1, pp.155-175, 1998. ,
Understanding science through the computational lens, Journal of Computer Science and Technology, vol.26, issue.4, pp.569-577, 2011. ,
Gossip-based computation of aggregate information, Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), pp.482-491, 2003. ,
Spectral redemption in clustering sparse networks, Proceedings of the National Academy of Sciences, vol.110, issue.52, pp.20935-20940, 2013. ,
On Coalescence Time in Graphs: When is Coalescing As Fast As Meeting?, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '19, pp.956-965, 2019. ,
Best-of-three voting on dense graphs, The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '19, pp.115-121, 2019. ,
, A Kinetic View of Statistical Physics, 2010.
Randomized rumor spreading, Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science (FOCS'00), pp.565-574, 2000. ,
Random walks on graphs: A survey, Combinatorics, Paul erdos is eighty, vol.2, issue.1, pp.1-46, 1993. ,
Multiway spectral partitioning and higher-order cheeger inequalities, Journal of the ACM (JACM), issue.6, p.37, 2014. ,
Interacting particle systems, vol.276, 2012. ,
Advanced modularity-specialized label propagation algorithm for detecting communities in networks, Physica A: Statistical Mechanics and its Applications, vol.389, issue.7, pp.1493-1500, 2010. ,
Markov chains and mixing times, 2009. ,
Spectral partitioning of random graphs, Proc. of the 42nd IEEE Symp. on Foundations of Computer Science (FOCS'01), pp.529-537, 2001. ,
Determining majority in networks with local interactions and very small local memory, Automata, Languages, and Programming -41st International Colloquium, ICALP 2014, pp.871-882, 2014. ,
Determining majority in networks with local interactions and very small local memory, Distributed Computing (Ext.Abs. in ICALP'14, p.30, 2016. ,
Reconstruction and estimation in the planted partition model. Probability Theory and Related Fields, vol.162, pp.431-461, 2014. ,
Majority dynamics and aggregation of information in social networks, Autonomous Agents and Multi-Agent Systems, vol.28, issue.3, pp.408-429, 2014. ,
Reaching consensus on social networks, Proceedings of the 2nd Innovations in Computer Science (ITCS'10), pp.214-229, 2010. ,
Eigenvector computation and community detection in asynchronous gossip models, 2018. ,
Distributed information processing in biological and computational systems, Communications of the ACM, vol.58, issue.1, pp.94-102, 2015. ,
Simplified neuron model as a principal component analyzer, Journal of mathematical biology, vol.15, issue.3, pp.267-273, 1982. ,
Convergence speed in distributed consensus and averaging, SIAM Journal on Control and Optimization, vol.48, issue.1, pp.33-55, 2009. ,
, Distributed computing. SIAM Monographs on discrete mathematics and applications, vol.5, 2000.
Reaching agreement in the presence of faults, Journal of the ACM, vol.27, issue.2, pp.228-234, 1980. ,
Randomized byzantine generals, Proceedings of the 24th Annual Symposium on Foundations of Computer Science (SFCS'83), pp.403-409, 1983. ,
, Molecular Computing, pp.299-316, 2016.
On the Necessary Memory to Compute the Plurality in Multi-Agent Systems, CIAC'19 -11th International Conference on Algorithms and Complexity, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02002448
Gossip algorithms, 2009. ,
Distributed Voting/Ranking with Optimal Number of States per Node, IEEE Transactions on Signal and Information Processing over Networks, issue.99, pp.1-1, 2015. ,
User-friendly tail bounds for sums of random matrices, Foundations of computational mathematics, vol.12, issue.4, pp.389-434, 2012. ,
Simultaneous reversible Markov chains, Combinatorics: Paul Erdós Is Eighty, vol.1, pp.433-451, 1993. ,
A New Kind of Science, Wolfram media Champaign, vol.5, 2002. ,
Distributed average consensus with least-mean-square deviation, Journal of Parallel and Distributed Computing, vol.67, issue.1, pp.33-46, 2007. ,