Related papers: Separation profiles, isoperimetry, growth and comp…
We study the isoperimetric subgraphs of the giant component $\textbf{C}_n$ of supercritical bond percolation on the square lattice. These are subgraphs of $\textbf{C}_n$ having minimal edge boundary to volume ratio. In contrast to the work…
We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…
We study distance preservers, hopsets, and shortcut sets in $n$-node, $m$-edge directed graphs, and show improved bounds and new reductions for various settings of these problems. Our first set of results is about exact and approximate…
Let G be a subgraph-closed graph class with bounded maximum degree. We show that if G has balanced separators whose size is smaller than linear by a polynomial factor, then G has subexponential expansion. This gives a partial converse to a…
We use techniques from algebraic and extremal combinatorics to derive upper bounds on the number of independent sets in several (hyper)graphs arising from finite geometry. In this way, we obtain asymptotically sharp upper bounds for partial…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
A few years ago various disparities for Laplacians on graphs and manifolds were discovered. The corresponding results are mostly related to volume growth in the context of unbounded geometry. Indeed, these disparities can now be resolved by…
This paper significantly strengthens directed low-diameter decompositions in several ways. We define and give the first results for separated low-diameter decompositions in directed graphs, tighten and generalize probabilistic guarantees,…
We give effective proofs of residual finiteness and conjugacy separability for finitely generated nilpotent groups. In particular, we give precise asymptotic bounds for a function introduced by Bou-Rabee that measures how large the…
We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…
Subgraph counting is a fundamental and well-studied problem whose computational complexity is well understood. Quite surprisingly, the hypergraph version of subgraph counting has been almost ignored. In this work, we address this gap by…
The asymptotic dimension of metric spaces is an important notion in geometric group theory introduced by Gromov. The metric spaces considered in this paper are the ones whose underlying spaces are the vertex-sets of graphs and whose metrics…
We consider the question of which semigroups can occur as the semigroup $S_R(\nu)$ of positive values of a rank 1 valuation dominating a Noetherian local ring $R$. We give a number of bounds of polynomial type on the growth of…
In Part I we construct the upper bound, in the spirit of $\Gamma$- $\limsup$, achieved by multidimensional profiles, for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking…
We study the problem of graph clustering where the goal is to partition a graph into clusters, i.e. disjoint subsets of vertices, such that each cluster is well connected internally while sparsely connected to the rest of the graph. In…
Benjamini, Finucane and the first author have shown that if (G_n,S_n) is a sequence of Cayley graphs such that |S_n^n|=O(n^D|S_n|), then the sequence (G_n,d_{S_n}/n) is relatively compact for the Gromov-Hausdorff topology and every cluster…
We present a self-contained separation framework for P vs NP developed entirely within ZFC. The approach consists of: (i) a deterministic, radius-1 compilation from uniform polynomial-time Turing computation to local sum-of-squares (SoS)…
The motivating question for this work is a long standing open problem, posed by Nisan (1991), regarding the relative powers of algebraic branching programs (ABPs) and formulas in the non-commutative setting. Even though the general question…