Related papers: Random Lipschitz functions on graphs with weak exp…

It was already known that a p-adic, locally Lipschitz continuous semi-algebraic function is piecewise Lipschitz continuous, where the pieces can be taken semi-algebraic. We prove that if the function has locally Lipschitz constant 1, then…

We prove that the boundary of an almost minimizer of the intrinsic perimeter in a plentiful group can be approximated by intrinsic Lipschitz graphs. Plentiful groups are Carnot groups of step~$2$ whose center of the Lie algebra is generated…

Consider the random subgraph process on a base graph $G$ with $n$ vertices: we generate a sequence $\{G_t\}_{t=0}^{|E(G)|}$ by taking a uniformly random ordering of the edges of $G$ and then adding these edges one by one to the empty graph…

We prove the local Lipschitz continuity of sub-elliptic harmonic maps between certain singular spaces, more specifically from the $n$-dimensional Heisenberg group into $CAT(0)$ spaces. Our main theorem establishes that these maps have the…

An edge-weighted graph $G$, possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The number of graph homomorphisms from a graph $H$ to an…

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any $n$-vertex, $d$-regular graph $G$ and any graph $H$ (possibly with loops), \[\hom(G,H) \leq \max\left\lbrace\hom(K_{d,d}, H)^{\frac{n}{2d}},…

We provide an abstract multivariate central limit theorem with the Lindeberg-type error bounded in terms of Lipschitz functions (Wasserstein 1-distance) or functions with bounded second or third derivatives. The result is proved by means of…

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…

We provide a new lower bound on the length of the longest cycle of the binomial random graph $G(n,(1+\epsilon)/n)$ that holds w.h.p. for all $\epsilon=\epsilon(n)$ such that $\epsilon^3n\to \infty$. In the case $\epsilon\leq \epsilon_0$ for…

Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…

Lipschitz extensions were recently proposed as a tool for designing node differentially private algorithms. However, efficiently computable Lipschitz extensions were known only for 1-dimensional functions (that is, functions that output a…

Let H be a Tonelli Hamiltonian defined on the cotangent bundle of a compact and connected manifold and let u be a semi-concave function defined on M. If E (u) is the set of all the super-differentials of u and (\phi t) the Hamiltonian flow…

Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of…

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…

Given a class of graphs G closed under taking minors, we study the maximum degree \Delta_n of random graphs from G with n vertices. We prove several lower and upper bounds that hold with high probability. Among other results, we find…

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…

Let $G$ be any graph of minimum degree at least $k$, and let $G_p$ be the random subgraph of $G$ obtained by keeping each edge independently with probability $p$. Recently, Krivelevich, Lee and Sudakov showed that if $pk\to\infty$ then with…

Let $n\geq 1$, $K>0$, and let $X=(X_1,X_2,\dots,X_n)$ be a random vector in $\mathbb{R}^n$ with independent $K$--subgaussian components. We show that for every $1$--Lipschitz convex function $f$ in $\mathbb{R}^n$ (the Lipschitzness with…

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…