Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Darcy Camargo"'
Publikováno v:
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques. 58
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b10a71fffa396b0a6beae53f2bcb643
https://doi.org/10.1214/21-aihp1210
https://doi.org/10.1214/21-aihp1210
Publikováno v:
Lecture Notes in Networks and Systems ISBN: 9783030801250
Intelligent Computing
Intelligent Computing, 284, Springer International Publishing, pp.927-939, 2021, Lecture Notes in Networks and Systems, ⟨10.1007/978-3-030-80126-7_65⟩
Intelligent Computing
Intelligent Computing, 284, Springer International Publishing, pp.927-939, 2021, Lecture Notes in Networks and Systems, ⟨10.1007/978-3-030-80126-7_65⟩
Voting algorithms have been widely used as consensus protocols in the realization of fault-tolerant systems. These algorithms are best suited for distributed systems of nodes with low computational power or heterogeneous networks, where different nod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::350e691396721dd29e14a022abae4a1d
https://doi.org/10.1007/978-3-030-80126-7_65
https://doi.org/10.1007/978-3-030-80126-7_65
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030630881
Proceedings of the Future Technologies Conference (FTC) 2020, Volume 2
Proceedings of the Future Technologies Conference (FTC) 2020, Volume 2, 1289, Springer International Publishing, pp.360-378, 2021, Advances in Intelligent Systems and Computing, ⟨10.1007/978-3-030-63089-8_24⟩
Proceedings of the Future Technologies Conference (FTC) 2020, Volume 2
Proceedings of the Future Technologies Conference (FTC) 2020, Volume 2, 1289, Springer International Publishing, pp.360-378, 2021, Advances in Intelligent Systems and Computing, ⟨10.1007/978-3-030-63089-8_24⟩
The fast probabilistic consensus (FPC) is a voting consensus protocol that is robust and efficient in Byzantine infrastructure. We propose an adaption of the FPC to a setting where the voting power is proportional to the nodes reputations. We model t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6dba2a266efec40a8c3a16778c6b0eb2
https://doi.org/10.1007/978-3-030-63089-8_24
https://doi.org/10.1007/978-3-030-63089-8_24
Autor:
Darcy Camargo, Serguei Popov
Publikováno v:
Stochastic Processes and their Applications. 128:2750-2778
We base ourselves on the construction of the two-dimensional random interlacements (Comets et al., 2016) to define the one-dimensional version of the process. For this, we consider simple random walks conditioned on never hitting the origin. We compa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c05f4836849d39b9da1859b29f5aa0b
https://doi.org/10.1016/j.spa.2017.10.001
https://doi.org/10.1016/j.spa.2017.10.001
Autor:
Darcy Camargo, Serguei Popov
Publikováno v:
Journal of Statistical Physics. 166:1558-1571
We study a model of rumor propagation in discrete time where each site in the graph has initially a distinct information; we are interested in the number of "conversations" before the entire graph knows all informations. This problem can be described
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78cf7af9d79122b3727bc7b9b503b022
https://doi.org/10.1007/s10955-017-1731-0
https://doi.org/10.1007/s10955-017-1731-0