arXiv subjects

Amit Levi

Publications and source records attributed to Amit Levi.

At least 37 records · Page 2Linked to original sources

arXiv2021

Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning

We give a nearly-optimal algorithm for testing uniformity of distributions supported on $\{-1,1\}^n$, which makes $\tilde O (\sqrt{n}/\varepsilon^2)$ queries to a subcube conditional sampling oracle (Bhattacharyya and Chakraborty (2018)). The key technical component is a natural notion of random restriction for distributions on $\{-1,1\}^n$, and a quantitative analysis of how such a restriction affects the mean vector of the distribution. Along the way, we consider the problem of mean testing with independent samples and provide a nearly-optimal algorithm.

cs.DS↗

arXiv2020

Erasure-Resilient Sublinear-Time Graph Algorithms

We investigate sublinear-time algorithms that take partially erased graphs represented by adjacency lists as input. Our algorithms make degree and neighbor queries to the input graph and work with a specified fraction of adversarial erasures in adjacency entries. We focus on two computational tasks: testing if a graph is connected or $\varepsilon$-far from connected and estimating the average degree. For testing connectedness, we discover a threshold phenomenon: when the fraction of erasures is less than $\varepsilon$, this property can be tested efficiently (in time independent of the size of the graph); when the fraction of erasures is at least $\varepsilon,$ then a number of queries linear in the size of the graph representation is required. Our erasure-resilient algorithm (for the special case with no erasures) is an improvement over the previously known algorithm for connectedness in the standard property testing model and has optimal dependence on the proximity parameter $\varepsilon$. For estimating the average degree, our results provide an "interpolation" between the query complexity for this computational task in the model with no erasures in two different settings: with only degree queries, investigated by Feige (SIAM J. Comput. `06), and with degree queries and neighbor queries, investigated by Goldreich and Ron (Random Struct. Algorithms `08) and Eden et al. (ICALP `17). We conclude with a discussion of our model and open questions raised by our work.

cs.DS↗

arXiv2020

Learning and Testing Junta Distributions with Subcube Conditioning

We study the problems of learning and testing junta distributions on $\{-1,1\}^n$ with respect to the uniform distribution, where a distribution $p$ is a $k$-junta if its probability mass function $p(x)$ depends on a subset of at most $k$ variables. The main contribution is an algorithm for finding relevant coordinates in a $k$-junta distribution with subcube conditioning [BC18, CCKLW20]. We give two applications: 1. An algorithm for learning $k$-junta distributions with $\tilde{O}(k/ε^2) \log n + O(2^k/ε^2)$ subcube conditioning queries, and 2. An algorithm for testing $k$-junta distributions with $\tilde{O}((k + \sqrt{n})/ε^2)$ subcube conditioning queries. All our algorithms are optimal up to poly-logarithmic factors. Our results show that subcube conditioning, as a natural model for accessing high-dimensional distributions, enables significant savings in learning and testing junta distributions compared to the standard sampling model. This addresses an open question posed by Aliakbarpour, Blais, and Rubinfeld [ABR17].

cs.DS↗

arXiv2019

Hard properties with (very) short PCPPs and their applications

We show that there exist properties that are maximally hard for testing, while still admitting PCPPs with a proof size very close to linear. Specifically, for every fixed $\ell$, we construct a property $\mathcal{P}^{(\ell)}\subseteq\{0,1\}^n$ satisfying the following: Any testing algorithm for $\mathcal{P}^{(\ell)}$ requires $Ω(n)$ many queries, and yet $\mathcal{P}^{(\ell)}$ has a constant query PCPP whose proof size is $O(n\cdot \log^{(\ell)}n)$, where $\log^{(\ell)}$ denotes the $\ell$ times iterated log function (e.g., $\log^{(2)}n = \log \log n$). The best previously known upper bound on the PCPP proof size for a maximally hard to test property was $O(n \cdot \mathrm{poly}\log{n})$. As an immediate application, we obtain stronger separations between the standard testing model and both the tolerant testing model and the erasure-resilient testing model: for every fixed $\ell$, we construct a property that has a constant-query tester, but requires $Ω(n/\log^{(\ell)}(n))$ queries for every tolerant or erasure-resilient tester.

cs.CC↗

arXiv2019

The Equation of State of MH-III: a possible deep CH$_4$ reservoir in Titan, Super-Titan exoplanets and moons

We investigate the thermal equation of state, bulk modulus, thermal expansion coefficient, and heat capacity of MH-III (CH$_4$ filled-ice Ih), needed for the study of CH$_4$ transport and outgassing for the case of Titan and super-Titans. We employ density functional theory and ab initio molecular dynamics simulations in the generalized-gradient approximation with a van der Waals functional. We examine the finite temperature range of $300$K-$500$K and pressures between $2$GPa-$7$GPa. We find that in this P-T range MH-III is less dense than liquid water. There is uncertainty in the normalized moment of inertia (MOI) of Titan; it is estimated to be in the range of $0.33-0.34$. If Titan's MOI is $0.34$, MH-III is not stable at present in Titan's interior, yielding an easier path for the outgassing of CH$_4$. However, for an MOI of $0.33$, MH-III is thermodynamically stable at the bottom of a ice-rock internal layer capable of storing CH$_4$. For rock mass fractions $\lessapprox 0.2$ upwelling melt is likely hot enough to dissociate MH-III along its path. For super-Titans considering a mixture of MH-III and ice VII, melt is always positively buoyant if the H$_2$O:CH$_4$ mole fraction is $>5.5$. Our thermal evolution model shows that MH-III may be present today in Titan's core, confined to a thin ($\approx 10$km) outer shell. We find that the heat capacity of MH-III is higher than measured values for pure water-ice, larger than heat capacity often adopted for ice-rock mixtures with implications for internal heating.

astro-ph.EP↗

arXiv2019

Nearly optimal edge estimation with independent set queries

We study the problem of estimating the number of edges of an unknown, undirected graph $G=([n],E)$ with access to an independent set oracle. When queried about a subset $S\subseteq [n]$ of vertices the independent set oracle answers whether $S$ is an independent set in $G$ or not. Our first main result is an algorithm that computes a $(1+ε)$-approximation of the number of edges $m$ of the graph using $\min(\sqrt{m},n / \sqrt{m})\cdot\textrm{poly}(\log n,1/ε)$ independent set queries. This improves the upper bound of $\min(\sqrt{m},n^2/m)\cdot\textrm{poly}(\log n,1/ε)$ by Beame et al. \cite{BHRRS18}. Our second main result shows that ${\min(\sqrt{m},n/\sqrt{m}))/\textrm{polylog}(n)}$ independent set queries are necessary, thus establishing that our algorithm is optimal up to a factor of $\textrm{poly}(\log n, 1/ε)$.

cs.DS↗

arXiv2019

Growth Model Interpretation of Planet Size Distribution

The radii and orbital periods of 4000+ confirmed/candidate exoplanets have been precisely measured by the Kepler mission. The radii show a bimodal distribution, with two peaks corresponding to smaller planets (likely rocky) and larger intermediate-size planets, respectively. While only the masses of the planets orbiting the brightest stars can be determined by ground-based spectroscopic observations, these observations allow calculation of their average densities placing constraints on the bulk compositions and internal structures. Yet an important question about the composition of planets ranging from 2 to 4 Earth radii still remains. They may either have a rocky core enveloped in a H2-He gaseous envelope (gas dwarfs) or contain a significant amount of multi-component, H2O-dominated ices/fluids (water worlds). Planets in the mass range of 10-15 Earth masses, if half-ice and half-rock by mass, have radii of 2.5 Earth radii, which exactly match the second peak of the exoplanet radius bimodal distribution. Any planet in the 2-4 Earth radii range requires a gas envelope of at most a few mass percentage points, regardless of the core composition. To resolve the ambiguity of internal compositions, we use a growth model and conduct Monte Carlo simulations to demonstrate that many intermediate-size planets are water worlds.

astro-ph.EP↗

arXiv2019

Habitable zone predictions and how to test them

The habitable zone (HZ) is the region around a star(s) where standing bodies of water could exist on the surface of a rocky planet. The classical HZ definition makes a number of assumptions common to the Earth, including assuming that the most important greenhouse gases for habitable planets are CO2 and H2O, habitable planets orbit main-sequence stars, and that the carbonate-silicate cycle is a universal process on potentially habitable planets. Here, we discuss these and other predictions for the habitable zone and the observations that are needed to test them. We also, for the first time, argue why A-stars may be interesting HZ prospects. Instead of relying on unverified extrapolations from our Earth, we argue that future habitability studies require first principles approaches where temporal, spatial, physical, chemical, and biological systems are dynamically coupled. We also suggest that next-generation missions are only the beginning of a much more data-filled era in the not-too-distant future, when possibly hundreds to thousands of HZ planets will yield the statistical data we need to go beyond just finding habitable zone planets to actually determining which ones are most likely to exhibit life.

astro-ph.EP↗

arXiv2019

The continued importance of habitability studies

This is a white paper in response to the National Academy of Sciences "Exoplanet Science Strategy" call. We summarize recent advances in theoretical habitability studies and argue that such studies will remain important for guiding and interpreting observations. Interactions between 1-D and 3-D climate modelers will be necessary to resolve recent discrepancies in model results and improve habitability studies. Observational capabilities will also need improvement. Although basic observations can be performed with present capabilities, technological advances will be necessary to improve climate models to the level needed for planetary habitability studies.

astro-ph.EP↗

arXiv2018

Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices

We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle the case where the minimization is done over a sphere. The analysis of our algorithms is obtained by combining results from graph limit theory, along with a novel spectral decomposition of matrices. Specifically, we prove that a matrix $A$ can be decomposed into a structured part and a pseudorandom part, where the structured part is a block matrix with a polylogarithmic number of blocks, such that in each block all the entries are the same, and the pseudorandom part has a small spectral norm, achieving better error bound than the existing decomposition theorem of Frieze and Kannan (FOCS'96). As an additional application of the decomposition theorem, we give a sublinear-time approximation algorithm for computing the top singular values of a matrix.

cs.DS↗

arXiv2018

The Ice Cap Zone: A Unique Habitable Zone for Ocean Worlds

Traditional definitions of the habitable zone assume that habitable planets contain a carbonate-silicate cycle that regulates CO2 between the atmosphere, surface, and the interior. Such theories have been used to cast doubt on the habitability of ocean worlds. However, Levi et al (2017) have recently proposed a mechanism by which CO2 is mobilized between the atmosphere and the interior of an ocean world. At high enough CO2 pressures, sea ice can become enriched in CO2 clathrates and sink after a threshold density is achieved. The presence of subpolar sea ice is of great importance for habitability in ocean worlds. It may moderate the climate and is fundamental in current theories of life formation in diluted environments. Here, we model the Levi et al. mechanism and use latitudinally-dependent non-grey energy balance and single-column radiative-convective climate models and find that this mechanism may be sustained on ocean worlds that rotate at least 3 times faster than the Earth. We calculate the circumstellar region in which this cycle may operate for G-M-stars (Teff = 2,600 to 5,800 K), extending from about 1.23 to 1.65, 0.69 to 0.954, 0.38 to 0.528 AU, 0.219 to 0.308 AU, 0.146 to 0.206 AU, and 0.0428 to 0.0617 AU for G2, K2, M0, M3, M5, and M8 stars, respectively. However, unless planets are very young and not tidally locked, our mechanism would be unlikely to apply to stars cooler than a ~M3. We predict C/O ratios for our atmospheres (about 0.5) that can be verified by the JWST mission.

astro-ph.EP↗

arXiv2018

Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs

We introduce a new model for testing graph properties which we call the \emph{rejection sampling model}. We show that testing bipartiteness of $n$-nodes graphs using rejection sampling queries requires complexity $\widetildeΩ(n^2)$. Via reductions from the rejection sampling model, we give three new lower bounds for tolerant testing of Boolean functions of the form $f\colon\{0,1\}^n\to \{0,1\}$: $\bullet$Tolerant $k$-junta testing with \emph{non-adaptive} queries requires $\widetildeΩ(k^2)$ queries. $\bullet$Tolerant unateness testing requires $\widetildeΩ(n)$ queries. $\bullet$Tolerant unateness testing with \emph{non-adaptive} queries requires $\widetildeΩ(n^{3/2})$ queries. Given the $\widetilde{O}(k^{3/2})$-query non-adaptive junta tester of Blais \cite{B08}, we conclude that non-adaptive tolerant junta testing requires more queries than non-tolerant junta testing. In addition, given the $\widetilde{O}(n^{3/4})$-query unateness tester of Chen, Waingarten, and Xie \cite{CWX17b} and the $\widetilde{O}(n)$-query non-adaptive unateness tester of Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova, and Seshadhri \cite{BCPRS17}, we conclude that tolerant unateness testing requires more queries than non-tolerant unateness testing, in both adaptive and non-adaptive settings. These lower bounds provide the first separation between tolerant and non-tolerant testing for a natural property of Boolean functions.

cs.CC↗

arXiv2018

A New Desalination Pump Help Define the pH of Ocean Worlds

We study ocean exoplanets, for which the global surface ocean is separated from the rocky interior by a high-pressure ice mantle. We describe a mechanism that can pump salts out of the ocean, resulting in oceans of very low salinity. Here we focus on the H2O-NaCl system, though we discuss the application of this pump to other salts as well. We find our ocean worlds to be acidic, with a pH in the range of 2-4. We discuss and compare between the conditions found within our studied oceans and the conditions in which polyextremophiles were discovered. This work focuses on exoplanets in the super-Earth mass range (2 M_Earth), with water composing at least a few percent of their mass. Although, the principal of the desalination pump may extend beyond this mass range.

astro-ph.EP↗

arXiv2017

H-Atmospheres of Icy Super-Earths Formed in situ in the Outer Solar System: An Application to a Possible Planet Nine

We examine the possibility that icy super-Earth mass planets, formed over long time scales (0.1--1~Gyr) at large distances ($\sim$ 200--1000~AU) from their host stars, will develop massive H-rich atmospheres. Within the interior of these planets, high pressure converts CH$_4$ into ethane, butane, or diamond and releases H$_2$. Using simplified models which capture the basic physics of the internal structure, we show that the physical properties of the atmosphere depend on the outflux of H$_2$ from the mantle. When this outflux is $\lesssim 10^{10}$ [molec cm$^{-2}$ s$^{-1}$], the outgassed atmosphere has base pressure $\lesssim$ 1 bar. Larger outflows result in a substantial atmosphere where the base pressure may approach $10^3 - 10^4$ bar. For any pressure, the mean density of these planets, 2.4--3 [g cm$^{-3}$], is much larger than the mean density of Uranus and Neptune, 1.3--1.6 [g cm$^{-3}$]. Thus, observations can distinguish between a Planet Nine with a primordial H/He-rich atmosphere accreted from the protosolar nebula and one with an atmosphere outgassed from the core.

astro-ph.EP↗

arXiv2016

Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism

A function $f\colon \{-1,1\}^n \to \{-1,1\}$ is a $k$-junta if it depends on at most $k$ of its variables. We consider the problem of tolerant testing of $k$-juntas, where the testing algorithm must accept any function that is $ε$-close to some $k$-junta and reject any function that is $ε'$-far from every $k'$-junta for some $ε'= O(ε)$ and $k' = O(k)$. Our first result is an algorithm that solves this problem with query complexity polynomial in $k$ and $1/ε$. This result is obtained via a new polynomial-time approximation algorithm for submodular function minimization (SFM) under large cardinality constraints, which holds even when only given an approximate oracle access to the function. Our second result considers the case where $k'=k$. We show how to obtain a smooth tradeoff between the amount of tolerance and the query complexity in this setting. Specifically, we design an algorithm that given $ρ\in(0,1/2)$ accepts any function that is $\frac{ερ}{16}$-close to some $k$-junta and rejects any function that is $ε$-far from every $k$-junta. The query complexity of the algorithm is $O\big( \frac{k\log k}{ερ(1-ρ)^k} \big)$. Finally, we show how to apply the second result to the problem of tolerant isomorphism testing between two unknown Boolean functions $f$ and $g$. We give an algorithm for this problem whose query complexity only depends on the (unknown) smallest $k$ such that either $f$ or $g$ is close to being a $k$-junta.

cs.DS↗

arXiv2016

The Abundance of Atmospheric CO2 in Ocean Exoplanets: A Novel CO2 Deposition Mechanism

We consider super-Earth sized planets which have a water mass fraction that is large enough to form an external mantle composed of high pressure water ice polymorphs and that lack a substantial H/He atmosphere. We consider such planets in their habitable zone so that their outermost condensed mantle is a global deep liquid ocean. For these ocean planets we investigate potential internal reservoirs of CO2; the amount of CO2 dissolved in the ocean for the various saturation conditions encountered, and the ocean-atmosphere exchange flux of CO2. We find that in steady state the abundance of CO2 in the atmosphere has two possible states. When the wind-driven circulation is the dominant CO2 exchange mechanism, an atmosphere of tens of bars of CO2 results, where the exact value depends on the subtropical ocean surface temperature and the deep ocean temperature. When sea-ice formation, acting on these planets as a CO2 deposition mechanism, is the dominant exchange mechanism, an atmosphere of a few bars of CO2 is established. The exact value depends on the subpolar surface temperature. Our results suggest the possibility of a negative feedback mechanism, unique to water planets, where a reduction in the subpolar temperature drives more CO2 into the atmosphere to increase the greenhouse effect.

astro-ph.EP↗

arXiv2015

Approximately Counting Triangles in Sublinear Time

We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a {\em sublinear-time\/} algorithm for approximating the number of triangles in a graph, where the algorithm is given query access to the graph. The allowed queries are degree queries, vertex-pair queries and neighbor queries. We show that for any given approximation parameter $0<ε<1$, the algorithm provides an estimate $\widehat{t}$ such that with high constant probability, $(1-ε)\cdot t< \widehat{t}<(1+ε)\cdot t$, where $t$ is the number of triangles in the graph $G$. The expected query complexity of the algorithm is $\!\left(\frac{n}{t^{1/3}} + \min\left\{m, \frac{m^{3/2}}{t}\right\}\right)\cdot {\rm poly}(\log n, 1/ε)$, where $n$ is the number of vertices in the graph and $m$ is the number of edges, and the expected running time is $\!\left(\frac{n}{t^{1/3}} + \frac{m^{3/2}}{t}\right)\cdot {\rm poly}(\log n, 1/ε)$. We also prove that $Ω\!\left(\frac{n}{t^{1/3}} + \min\left\{m, \frac{m^{3/2}}{t}\right\}\right)$ queries are necessary, thus establishing that the query complexity of this algorithm is optimal up to polylogarithmic factors in $n$ (and the dependence on $1/ε$).

cs.DS↗

arXiv2015

On the Converse of Talagrand's Influence Inequality

In 1994, Talagrand showed a generalization of the celebrated KKL theorem. In this work, we prove that the converse of this generalization also holds. Namely, for any sequence of numbers $0 0$, it is possible to find a roughly balanced Boolean function $f$ such that $\textrm{Inf}_j[f] < a_j$ for every $1 \le j \le n$.

cs.DM↗