skip to main content


Title: 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.,2mstates) 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, whenm>3logloglog(n), consensus can be reached with linear communication cost, but this is impossible ifm<logloglog(n). 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.

 
more » « less
Award ID(s):
1705007
NSF-PAR ID:
10137950
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
Proceedings of the National Academy of Sciences
Date Published:
Journal Name:
Proceedings of the National Academy of Sciences
Volume:
117
Issue:
11
ISSN:
0027-8424
Page Range / eLocation ID:
p. 5624-5630
Format(s):
Medium: X
Sponsoring Org:
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$$jisuch 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(1), works in$$O(n)$$O(n)space and, with high probability, in$$O(n \cdot \min \{m^k,\log ^k n\})$$O(n·min{mk,logkn})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(n2)-time algorithms to computeall(km)-mappability tables for a fixedmand all$$k\in \{0,\ldots ,m\}$$k{0,,m}or a fixedkand all$$m\in \{k,\ldots ,n\}$$m{k,,n}. Finally, we show that, for$$k,m = \Theta (\log n)$$k,m=Θ(logn), 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.

     
    more » « less
  2. Abstract

    We present a Keck/MOSFIRE rest-optical composite spectrum of 16 typical gravitationally lensed star-forming dwarf galaxies at 1.7 ≲z≲ 2.6 (zmean= 2.30), all chosen independent of emission-line strength. These galaxies have a median stellar mass oflog(M*/M)med=8.290.43+0.51and a median star formation rate ofSFRHαmed=2.251.26+2.15Myr1. We measure the faint electron-temperature-sensitive [Oiii]λ4363 emission line at 2.5σ(4.1σ) significance when considering a bootstrapped (statistical-only) uncertainty spectrum. This yields a direct-method oxygen abundance of12+log(O/H)direct=7.880.22+0.25(0.150.06+0.12Z). We investigate the applicability at highzof locally calibrated oxygen-based strong-line metallicity relations, finding that the local reference calibrations of Bian et al. best reproduce (≲0.12 dex) our composite metallicity at fixed strong-line ratio. At fixedM*, our composite is well represented by thez∼ 2.3 direct-method stellar mass—gas-phase metallicity relation (MZR) of Sanders et al. When comparing to predicted MZRs from the IllustrisTNG and FIRE simulations, having recalculated our stellar masses with more realistic nonparametric star formation histories(log(M*/M)med=8.920.22+0.31), we find excellent agreement with the FIRE MZR. Our composite is consistent with no metallicity evolution, at fixedM*and SFR, of the locally defined fundamental metallicity relation. We measure the doublet ratio [Oii]λ3729/[Oii]λ3726 = 1.56 ± 0.32 (1.51 ± 0.12) and a corresponding electron density ofne=10+215cm3(ne=10+74cm3) when considering the bootstrapped (statistical-only) error spectrum. This result suggests that lower-mass galaxies have lower densities than higher-mass galaxies atz∼ 2.

     
    more » « less
  3. Abstract

    We analyze pre-explosion near- and mid-infrared (IR) imaging of the site of SN 2023ixf in the nearby spiral galaxy M101 and characterize the candidate progenitor star. The star displays compelling evidence of variability with a possible period of ≈1000 days and an amplitude of Δm≈ 0.6 mag in extensive monitoring with the Spitzer Space Telescope since 2004, likely indicative of radial pulsations. Variability consistent with this period is also seen in the near-IRJandKsbands between 2010 and 2023, up to just 10 days before the explosion. Beyond the periodic variability, we do not find evidence for any IR-bright pre-supernova outbursts in this time period. The IR brightness (MKs=10.7mag) and color (JKs= 1.6 mag) of the star suggest a luminous and dusty red supergiant. Modeling of the phase-averaged spectral energy distribution (SED) yields constraints on the stellar temperature (Teff=35001400+800K) and luminosity (logL/L=5.1±0.2). This places the candidate among the most luminous Type II supernova progenitors with direct imaging constraints, with the caveat that many of these rely only on optical measurements. Comparison with stellar evolution models gives an initial mass ofMinit= 17 ± 4M. We estimate the pre-supernova mass-loss rate of the star between 3 and 19 yr before explosion from the SED modeling atṀ3×105to 3 × 10−4Myr−1for an assumed wind velocity ofvw= 10 km s−1, perhaps pointing to enhanced mass loss in a pulsation-driven wind.

     
    more » « less
  4. Abstract

    We investigate how cosmic web structures affect galaxy quenching in the IllustrisTNG (TNG100) cosmological simulations by reconstructing the cosmic web within each snapshot using the DisPerSE framework. We measure the comoving distance from each galaxy with stellar masslog(M*/M)8to the nearest node (dnode) and the nearest filament spine (dfil) to study the dependence of both the median specific star formation rate (〈sSFR〉) and the median gas fraction (〈fgas〉) on these distances. We find that the 〈sSFR〉 of galaxies is only dependent on the cosmic web environment atz< 2, with the dependence increasing with time. Atz≤ 0.5,8log(M*/M)<9galaxies are quenched atdnode≲ 1 Mpc, and have significantly suppressed star formation atdfil≲ 1 Mpc, trends driven mostly by satellite galaxies. Atz≤ 1, in contrast to the monotonic drop in 〈sSFR〉 oflog(M*/M)<10galaxies with decreasingdnodeanddfil,log(M*/M)10galaxies—both centrals and satellites—experience an upturn in 〈sSFR〉 atdnode≲ 0.2 Mpc. Much of this cosmic web dependence of star formation activity can be explained by an evolution in 〈fgas〉. Our results suggest that in the past ∼10 Gyr, low-mass satellites are quenched by rapid gas stripping in dense environments near nodes and gradual gas starvation in intermediate-density environments near filaments. At earlier times, cosmic web structures efficiently channeled cold gas into most galaxies. State-of-the-art ongoing spectroscopic surveys such as the Sloan Digital Sky Survey and DESI, as well as those planned with the Subaru Prime Focus Spectrograph, JWST, and Roman, are required to test our predictions against observations.

     
    more » « less
  5. 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)}}]$Quasi-NP=NTIME[n(logn)O(1)]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}$Cadmits 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}$ixi. We show that for every sparsef, and for all “typical”$\mathcal { C}$C, faster#SAT algorithms for$\mathcal { C}$Ccircuits imply lower bounds against the circuit class$f \circ \mathcal { C}$fC, which may bestrongerthan$\mathcal { C}$Citself. In particular:

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

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

    Applying#SAT algorithms from the literature, one immediate corollary of our results is thatQuasi-NPdoes not haveEMAJACC0THRcircuits of polynomial size, whereEMAJis the “exact majority” function, improving previous lower bounds againstACC0[Williams JACM’14] andACC0THR[Williams STOC’14], [Murray-Williams STOC’18]. This is the first nontrivial lower bound against such a circuit class.

     
    more » « less