Related papers: Lipschitz Functions on Sparse Graphs II

Let $G=(V,E)$ be a graph of density $p$ on $n$ vertices. Following Erd\H{o}s, \L uczak and Spencer, an $m$-vertex subgraph $H$ of $G$ is called {\em full} if $H$ has minimum degree at least $p(m - 1)$. Let $f(G)$ denote the order of a…

We show that there exist constants $\delta_1,\delta_2>0$ such that if $G$ is an $(n,d,\lambda)$-graph with $\lambda/d\le\delta_1$, then $G$ contains an induced cycle of length at least $\delta_2n/d$. We further demonstrate that, up to a…

An odd $[1,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for each vertex $v \in V(G)$, $d_H(v)$ is odd and $1\le d_H(v) \le b$. Let $\lambda_3(G)$ be the third largest eigenvalue of the adjacency matrix of $G$. For positive…

Let $\H$ denote the discrete Heisenberg group, equipped with a word metric $d_W$ associated to some finite symmetric generating set. We show that if $(X,\|\cdot\|)$ is a $p$-convex Banach space then for any Lipschitz function $f:\H\to X$…

We give improved pseudorandom generators (PRGs) for Lipschitz functions of low-degree polynomials over the hypercube. These are functions of the form psi(P(x)), where P is a low-degree polynomial and psi is a function with small Lipschitz…

We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…

In the present paper, we study large values of Dirichlet $L$- functions inside the critical strip. For every $1/2<\sigma<1$, we show that for $q$ sufficiently large, there exists a non-principal character $\chi$ modulo $q$ and a constant…

A celebrated result of R\"odl and Ruci\'nski states that for every graph $F$, which is not a forest of stars and paths of length $3$, and fixed number of colours $r\ge 2$ there exist positive constants $c, C$ such that for $p \leq…

For an analytic and univalent function $f$ in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$, the logarithmic coefficients $\gamma_n$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

We prove that every recurrent graph $G$ quasi-isometric to $\mathbb{R}$ admits an essentially unique Lipschitz harmonic function $h$. If $G$ is vertex-transitive, then the action of $Aut(G)$ preserves $\partial h$ up to a sign, a fact that…

We study the fluctuations of subgraph counts in hyperbolic random geometric graphs on the $d$-dimensional Poincar\'e ball in the heterogeneous, heavy-tailed degree regime. In a hyperbolic random geometric graph whose vertices are given by a…

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

In $r$-neighbor bootstrap percolation on the vertex set of a graph $G$, a set $A$ of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least $r$ previously infected neighbors. When the…

The "extremal function" $c(H)$ of a graph $H$ is the supremum of densities of graphs not containing $H$ as a minor, where the "density" of a graph $G$ is the ratio of the number of edges to the number of vertices. Myers and Thomason (2005),…

This paper studies bounds in a strong form of regularity for $3$-uniform hypergraphs which was developed by Frankl, Gowers, Kohayakawa, Nagle, R\"{o}dl, Skokan, and Schacht. Regular decompositions of this type involve two structural…

We show that for sufficiently large $d$ and for $t\geq d+1$, there is a graph $G$ with average degree $(1-\varepsilon)\lambda t \sqrt{\ln d}$ such that almost every graph $H$ with $t$ vertices and average degree $d$ is not a minor of $G$,…

We prove the existence of a (random) Lipschitz function $F : \Z^{d-1}\to\Z^+$ such that, for every $x \in \Z^{d-1}$, the site $(x,F(x))$ is open in a site percolation process on $\Z^{d}$. The Lipschitz constant may be taken to be 1 when the…

A sparsifier of a graph $G$ (Bencz\'ur and Karger; Spielman and Teng) is a sparse weighted subgraph $\tilde G$ that approximately retains the cut structure of $G$. For general graphs, non-trivial sparsification is possible only by using…

We prove that, for any $t\ge 3$, there exists a constant $c=c(t)>0$ such that any $d$-regular $n$-vertex graph with the second largest eigenvalue in absolute value~$\lambda$ satisfying $\lambda\le c d^{t-1}/n^{t-2}$ contains vertex-disjoint…

This note corrects a gap and improves results in an earlier paper by the first named author. More precisely, it is shown that on weakly compactly generated Banach spaces X which admit a C^{p} smooth norm, one can uniformly approximate…