Related papers: Pl\"unnecke inequalities for measure graphs with a…

Almost forty years ago, Connes, Feldman and Weiss proved that for measurable equivalence relations the notions of amenability and hyperfiniteness coincide. In this paper we define the uniform version of amenability and hyperfiniteness for…

We study generalizations of Reifenberg's Theorem for measures in $\mathbb R^n$ under assumptions on the Jones' $\beta$-numbers, which appropriately measure how close the support is to being contained in a subspace. Our main results, which…

Rank-one symmetric spaces carry a solvable group model which have a generalization to a larger class of Lie groups that are one-dimensional extensions of nilpotent groups. By examining some metric properties of these symmetric spaces, we…

Exhibiting a new type of measure concentration, we prove uniform concentration bounds for measurable Lipschitz functions on product spaces, where Lipschitz is taken with respect to the metric induced by a weighted covering of the index set…

We prove new concentration estimates for random variables that are functionals of a Poisson measure defined on a general measure space. Our results are specifically adapted to geometric applications, and are based on a pervasive use of a…

For nonautonomous linear difference equations in Banach spaces we show that a very general type of dichotomic behavior persists under small enough additive linear perturbations. By using a new approach, we obtain two general robustness…

Many results in extremal graph theory can be formulated as certain polynomial inequalities in graph homomorphism densities. Answering fundamental questions raised by Lov{\'a}sz, Szegedy and Razborov, Hatami and Norine proved that…

We study fluctuations of ergodic averages generated by actions of amenable groups. In the setting of an abstract ergodic theorem for locally compact second countable amenable groups acting on uniformly convex Banach spaces, we deduce a…

We consider parabolic problems with non-Lipschitz nonlinearity in the different scales of Banach spaces and prove local-in-time existence theorem. New class of parabolic equations that have analytic solutions is obtained.

Precedence constraints are inequalities used to model time dependencies. In 1958, Gallai proved that a finite system of precedence constraints admits solutions if and only if the corresponding precedence graph does not contain…

Let $G$ be a countable discrete group with an orthogonal representation $\alpha$ on a real Hilbert space $H$. We prove $L_p$ Poincar\'e inequalities for the group measure space $L_\infty(\Omega_H,\gamma)\rtimes G$, where both the group…

In order to use persistence diagrams as a true statistical tool, it would be very useful to have a good notion of mean and variance for a set of diagrams. In 2011, Mileyko and his collaborators made the first study of the properties of the…

We study extension theorems for Lipschitz-type operators acting on metric spaces and with values on spaces of integrable functions. Pointwise domination is not a natural feature of such spaces, and so almost everywhere inequalities and…

We establish elliptic and parabolic Harnack inequalities on graphs with unbounded weights. As an application we prove a local limit theorem for a continuous time random walk $X$ in an environment of ergodic random conductances taking values…

Graphs are used to model interactions in a variety of contexts, and there is a growing need to quickly assess the structure of a graph. Some of the most useful graph metrics, especially those measuring social cohesion, are based on…

We provide a dynamical proof of the van der Corput inequality for sequences in Hilbert spaces that is based on the Furstenberg correspondence principle. This is done by reducing the inequality to the mean ergodic theorem for contractions on…

Concentration results and probabilistic analysis for combinatorial problems like the TSP, MWST, graph coloring have received much attention, but generally, for i.i.d. samples (i.i.d. points in the unit square for the TSP, for example).…

Lipschitz learning is a graph-based semi-supervised learning method where one extends labels from a labeled to an unlabeled data set by solving the infinity Laplace equation on a weighted graph. In this work we prove uniform convergence…

We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

In this paper, we show how geometry plays in the study of the Furstenberg conjecture (refer to~\cite{F}). Let $p>1$ and $q>1$ be two relative prime positive integers. We prove that a non-atomic $p$- and $q$-invariant measure having balanced…