Related papers: Probabilistic and Geometrical Applications to Grap…
We establish Krylov-Safonov type H\"older regularity theory for solutions to quite general discrete dynamic programming equations or equivalently discrete stochastic processes on random geometric graphs. Such graphs arise for example from…
We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…
We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct…
For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\varphi:E(G)\rightarrow \{1,...,t\}$ is called a proper edge $t$-coloring of a graph $G$,…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
We introduce the notion of an interpolating path on the set of probability measures on finite graphs. Using this notion, we first prove a displacement convexity property of entropy along such a path and derive Prekopa-Leindler type…
A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…
Given a graph $H$ and a natural number $n$, the extremal number $\mathrm{ex}(n, H)$ is the largest number of edges in an $n$-vertex graph containing no copy of $H$. In this paper, we obtain a general upper bound for the extremal number of…
Settling Kahn's conjecture (2001), we prove the following upper bound on the number $i(G)$ of independent sets in a graph $G$ without isolated vertices: \[ i(G) \le \prod_{uv \in E(G)} i(K_{d_u,d_v})^{1/(d_u d_v)}, \] where $d_u$ is the…
The purpose of this paper is twofold. We first prove a weighted Sobolev inequality and part of a weighted Morrey's inequality, where the weights are a power of the mean curvature of the level sets of the function appearing in the…
The present paper is intended to provide the basis for the study of weakly differentiable functions on rectifiable varifolds with locally bounded first variation. The concept proposed here is defined by means of integration by parts…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
Slepian and Sudakov-Fernique type inequalities, which compare expectations of maxima of Gaussian random vectors under certain restrictions on the covariance matrices, play an important role in probability theory, especially in empirical…
We consider the problem of maximizing submodular functions; while this problem is known to be NP-hard, several numerically efficient local search techniques with approximation guarantees are available. In this paper, we propose a novel…
We undertake a systematic study of the approximation properties of the topological and measurable versions of the coarse boundary groupoid associated to a sequence of finite graphs of bounded degree. On the topological side, we prove that…
Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…
A fundamental problem in pattern avoidance is describing the asymptotic behavior of the extremal function and its generalizations. We prove an equivalence between the asymptotics of the graph extremal function for a class of bipartite…
Probability functions figure prominently in optimization problems of engineering. They may be nonsmooth even if all input data are smooth.This fact motivates the consideration of subdifferentials for such typically just continuous…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
Inhomogeneous Erd\H{o}s-R\'enyi random graphs $\mathbb G_N$ on $N$ vertices in the non-dense regime are considered in this paper. The edge between the pair of vertices $\{i,j\}$ is retained with probability…