Related papers: A Cheeger Inequality for Small Set Expansion
In a seminal paper, Choquet introduced an integral formula to extend a monotone increasing setfunction on a sigma-algebra to a (nonlinear) functional on bounded measurable functions. The most important special case is when the setfunction…
Given an open and bounded set $\Omega\subset\mathbb{R}^N$, we consider the problem of minimizing the ratio between the $s-$perimeter and the $N-$dimensional Lebesgue measure among subsets of $\Omega$. This is the nonlocal version of the…
We revisit the asymptotic analysis of probabilistic construction of adjacency matrices of expander graphs proposed in [4]. With better bounds we derived a new reduced sample complexity for the number of nonzeros per column of these…
In this paper we discuss, in terms of quivers with relations, sufficient and necessary conditions for an algebra to be a quasitilted algebra. We start with an algebra with global dimension two and we give a sufficient condition for it to be…
We revisit the probabilistic construction of sparse random matrices where each column has a fixed number of nonzeros whose row indices are drawn uniformly at random. These matrices have a one-to-one correspondence with the adjacency…
Starting with an operator in the universal enveloping algebra of a semi-simple, complex Lie group the nearest neighbor statistics of the spectra of this operator along a sequence of representations are discussed. After a short introduction…
Szemer\'edi's regularity lemma is a powerful tool in graph theory. It states that for every large enough graph, there exists a partition of the edge set with bounded size such that most induced subgraphs are quasirandom. When the graph is a…
In this paper we show that the equivalences between certain properties of closed subanalytic sets proved by E. Bierstone and P. Milman in \cite{[BM-1]} hold for closed sets definable in quasianalytic o-minimal structures. In particular we…
The purpose of this paper is to analyze the isoperimetric inequality for symmetric log-convex probability measures on the line. Using geometric arguments we first re-prove that extremal sets in the isoperimetric inequality are intervals or…
We study the interplay between notions of quasirandomness for additive sets and for hypergraphs. In particular, we show a strong connection between the notions of Gowers uniformity in the additive setting and discrepancy-type measures of…
We prove a general version of the amenability conjecture in the unified setting of a Gromov hyperbolic group G acting properly cocompactly either on its Cayley graph, or on a CAT(-1)-space. Namely, for any subgroup H of G, we show that H is…
We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…
Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…
We introduce a new concept, which we call partition expanders. The basic idea is to study quantitative properties of graphs in a slightly different way than it is in the standard definition of expanders. While in the definition of expanders…
We establish a dilation-theoretic characterization of the Choquet order on the space of measures on a compact convex set using ideas from the theory of operator algebras. This yields an extension of Cartier's dilation theorem to the…
We use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott's Graph model, equality is computable relative to the complement function. However, the converse is not true.…
Several algebraic properties of a binomial edge ideal $J_G$ can be interpreted in terms of combinatorial properties of its associated graph $G$. In particular, the so-called cut sets of a graph $G$, special sets of vertices that disconnect…
In [25], T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps, with a focus on the $\mathbf n$-$t$-quasi-greedy property that is based on them. Building upon this foundation, our…
We consider the problem of testing small set expansion for general graphs. A graph $G$ is a $(k,\phi)$-expander if every subset of volume at most $k$ has conductance at least $\phi$. Small set expansion has recently received significant…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…