Related papers: Optimal Trickle-Down Theorems for Path Complexes v…

We study the {\em robust proper learning} of univariate log-concave distributions (over continuous and discrete domains). Given a set of samples drawn from an unknown target distribution, we want to compute a log-concave hypothesis…

We prove a sufficient condition for a finite clique complex to collapse to a $k$-dimensional complex, and use this to exhibit thresholds for $(k+1)$-collapsibility in a sparse random clique complex. In particular, if every strongly…

We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best…

We consider the transfer operators of non-uniformly expanding maps for potentials of various regularity, and show that a specific property of potentials ("flatness") implies a Ruelle-Perron-Frobenius Theorem and a decay of the transfer…

We study the problem of sampling from a distribution $\mu$ with density $\propto e^{-V}$ for some potential function $V:\mathbb R^d\to \mathbb R$ with query access to $V$ and $\nabla V$. We start with the following standard assumptions: (1)…

Based on a geometric interpretation of Brotbek's symmetric differential forms, for the intersection family $\mathcal{X}$ of generalized Fermat-type hypersurfaces in $\mathbb{P}_{\mathbb{K}}^N$ defined over any field $\mathbb K$, we…

In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal…

We report on some recent developments in the search for optimal network topologies. First we review some basic concepts on spectral graph theory, including adjacency and Laplacian matrices, and paying special attention to the topological…

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…

Given a directed graph $G$ on $n$ vertices with a special vertex $s$, the directed minimum degree spanning tree problem requires computing a incoming spanning tree rooted at $s$ whose maximum tree in-degree is the smallest among all such…

Let U(N) denote the maximal length of arithmetic progressions in a random uniform subset of {0,1}^N. By an application of the Chen-Stein method, we show that U(N)- 2 log(N)/log(2) converges in law to an extreme type (asymmetric)…

In large-data applications, such as the inference process of diffusion models, it is desirable to design sampling algorithms with a high degree of parallelization. In this work, we study the adaptive complexity of sampling, which is the…

We consider the branch-length estimation problem on a bifurcating tree: a character evolves along the edges of a binary tree according to a two-state symmetric Markov process, and we seek to recover the edge transition probabilities from…

We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…

We present ${\rm poly\log\log n}$-round randomized distributed algorithms to compute vertex splittings, a partition of the vertices of a graph into $k$ parts such that a node of degree $d(u)$ has $\approx d(u)/k$ neighbors in each part. Our…

This paper gives a new approach for the maximum likelihood estimation of the joint of the location and scale of the Cauchy distribution. We regard the joint as a single complex parameter and derive a new form of the likelihood equation of a…

One of the central objects in the theory of optimal transport is the Brenier map: the unique monotone transformation which pushes forward an absolutely continuous probability law onto any other given law. A line of recent work has analyzed…

In high-contrast composites, the electric (or stress) field may exhibit significant amplification in the narrow region between inclusions. The behavior of the solution depends on the distance $\epsilon$ between the inclusions, which tends…

We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…