no code implementations • 1 Feb 2021 • Suryanarayana Sankagiri, Shreyas Gandlur, Bruce Hajek
We analyze the performance of the longest-chain protocol under the assumption that the communication delays are random, independent, and identically distributed.
Cryptography and Security Distributed, Parallel, and Cluster Computing
no code implementations • 21 Jan 2018 • Bruce Hajek, Suryanarayana Sankagiri
A variation of the preferential attachment random graph model of Barab\'asi and Albert is defined that incorporates planted communities.
no code implementations • 21 Jan 2018 • Bruce Hajek, Suryanarayana Sankagiri
Two precursors to the message passing algorithm are analyzed: the first is a degree thresholding (DT) algorithm and the second is an algorithm based on the arrival times of the children (C) of a given vertex, where the children of a given vertex are the vertices that attached to it.
