Communication cost of consensus for nodes with limited memory

Motivated by applications in wireless networks and the Internet of Things, we consider a model of n nodes trying to reach consensus with high probability on their majority bit. Each node i is assigned a bit at time 0 and is a finite automaton with m bits of memory (i.e.,$2m$states) and a Poisson clock. When the clock of i rings, i can choose to communicate and is then matched to a uniformly chosen node j. The nodes j and i may update their states based on the state of the other node. Previous work has focused on minimizing the time to consensus and the probability of error, while our goal is minimizing the number of communications. We show that, when$m>3⁡log⁡log⁡log(n)$, consensus can be reached with linear communication cost, but this is impossible if$m. A key step is to distinguish when nodes can become aware of knowing the majority bit and stop communicating. We show that this is impossible if their memory is too low.

Authors:
; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10137950
Journal Name:
Proceedings of the National Academy of Sciences
Volume:
117
Issue:
11
Page Range or eLocation-ID:
p. 5624-5630
ISSN:
0027-8424
Publisher:
Proceedings of the National Academy of Sciences
National Science Foundation
##### More Like this
1. Abstract

Sequence mappability is an important task in genome resequencing. In the (km)-mappability problem, for a given sequenceTof lengthn, the goal is to compute a table whoseith entry is the number of indices$$j \ne i$$$j\ne i$such that the length-msubstrings ofTstarting at positionsiandjhave at mostkmismatches. Previous works on this problem focused on heuristics computing a rough approximation of the result or on the case of$$k=1$$$k=1$. We present several efficient algorithms for the general case of the problem. Our main result is an algorithm that, for$$k=O(1)$$$k=O\left(1\right)$, works in$$O(n)$$$O\left(n\right)$space and, with high probability, in$$O(n \cdot \min \{m^k,\log ^k n\})$$$O\left(n·min\left\{{m}^{k},{log}^{k}n\right\}\right)$time. Our algorithm requires a careful adaptation of thek-errata trees of Cole et al. [STOC 2004] to avoid multiple counting of pairs of substrings. Our technique can also be applied to solve the all-pairs Hamming distance problem introduced by Crochemore et al. [WABI 2017]. We further develop$$O(n^2)$$$O\left({n}^{2}\right)$-time algorithms to computeall(km)-mappability tables for a fixedmand all$$k\in \{0,\ldots ,m\}$$$k\in \left\{0,\dots ,m\right\}$or a fixedkand all$$m\in \{k,\ldots ,n\}$$$m\in \left\{k,\dots ,n\right\}$. Finally, we show that, for$$k,m = \Theta (\log n)$$$k,m=\Theta \left(logn\right)$, the (km)-mappability problem cannot be solved in strongly subquadratic time unless the Strong Exponential Time Hypothesis fails. This is an improved and extended version of a paper presented at SPIRE 2018.

2. Abstract

We continue the program of proving circuit lower bounds via circuit satisfiability algorithms. So far, this program has yielded several concrete results, proving that functions in$\mathsf {Quasi}\text {-}\mathsf {NP} = \mathsf {NTIME}[n^{(\log n)^{O(1)}}]$$\mathrm{Quasi}-\mathrm{NP}=\mathrm{NTIME}\left[{n}^{{\left(\mathrm{log}n\right)}^{O\left(1\right)}}\right]$and other complexity classes do not have small circuits (in the worst case and/or on average) from various circuit classes$\mathcal { C}$$C$, by showing that$\mathcal { C}$$C$admits non-trivial satisfiability and/or#SAT algorithms which beat exhaustive search by a minor amount. In this paper, we present a new strong lower bound consequence of having a non-trivial#SAT algorithm for a circuit class${\mathcal C}$$C$. Say that a symmetric Boolean functionf(x1,…,xn) issparseif it outputs 1 onO(1) values of${\sum }_{i} x_{i}$${\sum }_{i}{x}_{i}$. We show that for every sparsef, and for all “typical”$\mathcal { C}$$C$, faster#SAT algorithms for$\mathcal { C}$$C$circuits imply lower bounds against the circuit class$f \circ \mathcal { C}$$f\circ C$, which may bestrongerthan$\mathcal { C}$$C$itself. In particular:

#SAT algorithms fornk-size$\mathcal { C}$$C$-circuits running in 2n/nktime (for allk) implyNEXPdoes not have$(f \circ \mathcal { C})$$\left(f\circ C\right)$-circuits of polynomial size.

#SAT algorithms for$2^{n^{{\varepsilon }}}$${2}^{{n}^{\epsilon }}$-size$\mathcal { C}$$C$-circuits running in$2^{n-n^{{\varepsilon }}}$${2}^{n-{n}^{\epsilon }}$time (for someε> 0) implyQuasi-NPdoes not have$(f \circ \mathcal { C})$$\left(f\circ C\right)$-circuits of polynomial size.

Applying#SAT algorithms from the literature, one immediate corollary of our results is thatQuasi-NPdoes not haveEMAJACC0THRcircuits of polynomialmore »

3. Abstract

The bimodal absorption system imaging campaign (BASIC) aims to characterize the galaxy environments of a sample of 36 Hi-selected partial Lyman limit systems (pLLSs) and Lyman limit systems (LLSs) in 23 QSO fields atz≲ 1. These pLLSs/LLSs provide a unique sample of absorbers with unbiased and well-constrained metallicities, allowing us to explore the origins of metal-rich and low-metallicity circumgalactic medium (CGM) atz< 1. Here we present Keck/KCWI and Very Large Telescope/MUSE observations of 11 of these QSO fields (19 pLLSs) that we combine with Hubble Space Telescope/Advanced Camera for Surveys imaging to identify and characterize the absorber-associated galaxies at 0.16 ≲z≲ 0.84. We find 23 unique absorber-associated galaxies, with an average of one associated galaxy per absorber. For seven absorbers, all with <10% solar metallicities, we find no associated galaxies with$logM⋆≳9.0$withinρ/Rvirand ∣Δv∣/vesc≤ 1.5 with respect to the absorber. We do not find any strong correlations between the metallicities or Hicolumn densities of the gas and most of the galaxy properties, except for the stellar mass of the galaxies: the low-metallicity ([X/H] ≤ −1.4) systems have a probability of$0.39−0.15+0.16$for having a host galaxy with$logM⋆≥9.0$withinρ/Rvir≤ 1.5, while the higher metallicity absorbers havemore »

4. The product selectivity of many heterogeneous electrocatalytic processes is profoundly affected by the liquid side of the electrocatalytic interface. The electrocatalytic reduction of CO to hydrocarbons on Cu electrodes is a prototypical example of such a process. However, probing the interactions of surface-bound intermediates with their liquid reaction environment poses a formidable experimental challenge. As a result, the molecular origins of the dependence of the product selectivity on the characteristics of the electrolyte are still poorly understood. Herein, we examined the chemical and electrostatic interactions of surface-adsorbed CO with its liquid reaction environment. Using a series of quaternary alkyl ammonium cations ($methyl4N+$,$ethyl4N+$,$propyl4N+$, and$butyl4N+$), we systematically tuned the properties of this environment. With differential electrochemical mass spectrometry (DEMS), we show that ethylene is produced in the presence of$methyl4N+$and$ethyl4N+$cations, whereas this product is not synthesized in$propyl4N+$- and$butyl4N+$-containing electrolytes. Surface-enhanced infrared absorption spectroscopymore »

5. Abstract

We present a chemodynamical study of the Grus I ultra-faint dwarf galaxy (UFD) from medium-resolution (R∼ 11,000) Magellan/IMACS spectra of its individual member stars. We identify eight confirmed members of Grus I, based on their low metallicities and coherent radial velocities, and four candidate members for which only velocities are derived. In contrast to previous work, we find that Grus I has a very low mean metallicity of 〈[Fe/H]〉 = −2.62 ± 0.11 dex, making it one of the most metal-poor UFDs. Grus I has a systemic radial velocity of −143.5 ± 1.2 km s−1and a velocity dispersion of$σrv=2.5−0.8+1.3$km s−1, which results in a dynamical mass of$M1/2(rh)=8−4+12×105$Mand a mass-to-light ratio ofM/LV=$440−250+650$M/L. Under the assumption of dynamical equilibrium, our analysis confirms that Grus I is a dark-matter-dominated UFD (M/L> 80M/L). However, we do not resolve a metallicity dispersion (σ[Fe/H]< 0.44 dex). Our results indicate that Grus I is a fairly typical UFD with parameters that agree with mass–metallicity and metallicity-luminosity trends for faint galaxies. This agreement suggests that Grus I has not lost an especially significant amount of mass from tidal encounters with the Milky Way, in linemore »