Related papers: Lipschitz Functions on Sparse Graphs II

Let $\chi_l(G)$ denote the list chromatic number of the $r$-uniform hypergraph~$G$. Extending a result of Alon for graphs, Saxton and the second author used the method of containers to prove that, if $G$ is simple and $d$-regular, then…

In this paper we prove the first quantitative convergence rates for the graph infinity Laplace equation for length scales at the connectivity threshold. In the graph-based semi-supervised learning community this equation is also known as…

In this paper we prove that there exists a constant $C$ such that, if $S,\Sigma$ are subsets of $\R^d$ of finite measure, then for every function $f\in L^2(\R^d)$, $$\int_{\R^d}|f(x)|^2 dx \leq C e^{C \min(|S||\Sigma|, |S|^{1/d}w(\Sigma),…

Let $c$ denote the largest constant such that every $C_{6}$-free graph $G$ contains a bipartite and $C_4$-free subgraph having $c$ fraction of edges of $G$. Gy\H{o}ri et al. showed that $\frac{3}{8} \le c \le \frac{2}{5}$. We prove that…

We determine the sharp threshold for Hamilton cycles in randomly perturbed sparse graphs. For any $\alpha=\alpha(n)=o(1)$, let $G_{\alpha}$ be an $n$-vertex graph with minimum degree $\delta(G_{\alpha})\ge\alpha n$. We prove that if…

In [K. Bou-Rabee, B. Seward, J. Reine Angwe. Math. 2016] Bou-Rabee and Seward constructed examples of finitely generated residually finite groups $G$ whose residual finiteness growth function $\mathcal{F}_G$ can be at least as fast as any…

For an infinite iterated function system $\mathbf{f}$ on $[0,1]$ with an attractor $\Lambda(\mathbf{f})$ and for an infinite subset $D\subseteq \mathbb{N}$, consider the set \[ \mathbb E(\mathbf{f},D)= \{ x \in \Lambda(\mathbf{f}):…

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…

A graph $G$ is $k$-locally sparse if for each vertex $v \in V(G)$, the subgraph induced by its neighborhood contains at most $k$ edges. Alon, Krivelevich, and Sudakov showed that for $f > 0$ if a graph $G$ of maximum degree $\Delta$ is…

Write ${\cal I}(G)$ for the set of independent sets of a graph $G$ and $i(G)$ for $|{\cal I}(G)|$. It has been conjectured (by Alon and Kahn) that for an $N$-vertex, $d$-regular graph $G$, $$ i(G) \leq \left(2^{d+1}-1\right)^{N/2d}. $$ If…

Let M denote the maximal function along the polynomial curve p(t)=(t,t^2,...,t^d) in R^d: M(f)=sup_{r>0} (1/2r) \int_{|t|<r} |f(x-p(t))| dt. We show that the L^2-norm of this operator grows at most logarithmically with the parameter d:…

In this paper, we exhibit upper and lower bounds with explicit constants for some objects related to entire $L$-functions in the critical strip, under the generalized Riemann hypothesis. The examples include the entire Dirichlet…

We prove a version of the implicit function theorem for Lipschitz mappings $f:\mathbb{R}^{n+m}\supset A \to X$ into arbitrary metric spaces. As long as the pull-back of the Hausdorff content $\mathcal{H}_{\infty}^n$ by $f$ has positive…

For a positive integer $k$ and a graph $H$, the $k$-color induced size-Ramsey number $\hat{R}_{\mathrm{ind}}(H, k)$ is the minimum integer $m$ for which there exists a graph $G$ with $m$ edges such that for every $k$-edge coloring of $G$,…

We study the geometric properties of graphs with non-negative Ollivier-Ricci curvature, a discrete analogue of non-negative Ricci curvature in Riemannian geometry. We prove that for each $d<\infty$ there exists a constant $C_d$ such that if…

The pinning of flux lattices by weak impurity disorder is studied in the absence of free dislocations using both the gaussian variational method and, to $O(\epsilon=4-d)$, the functional renormalization group. We find universal logarithmic…

By methods of stochastic analysis on Riemannian manifolds, we derive explicit constants $c\_1(D)$ and $c\_2(D)$ for a $d$-dimensional compact Riemannian manifold $D$ with boundary such that $c\_1(D)\sqrt{\lambda}\|\phi\|\_\infty \le…

We consider the fractal Sierpi\'{n}ski gasket or carpet graph in dimension $d\geq 2,$ denoted by $G$. At time $0$, we place a Poisson point process of particles onto the graph and let them perform independent simple random walks, which in…

In many real-world applications, it is undesirable to drastically change the problem solution after a small perturbation in the input, as unstable outputs can lead to costly transaction fees, privacy and security concerns, reduced user…

We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem,…