English
Related papers

Related papers: Sharp One-Dimensional Sub-Gaussian Comparison in C…

200 papers

The unitary Cayley graph of $\mathbb{Z} /n \mathbb{Z}$, denoted $X_{\mathbb{Z} / n \mathbb{Z}}$, has vertices $0,1, \dots, n-1$ with $x$ adjacent to $y$ if $x-y$ is relatively prime to $n$. We present results on the tightness of the known…

Combinatorics · Mathematics 2018-06-29 Colin Defant , Sumun Iyer

We prove upper and lower bounds for a variational functional for convex functions satisfying certain boundary conditions on a sector of the unit ball in two dimensions. The functional contains two terms: The full Hessian and its…

Analysis of PDEs · Mathematics 2024-02-06 Peter Gladbach , Heiner Olbermann

Given a simple undirected graph $G = (V, E)$, the open neighbourhood of a vertex $v \in V$ is defined as $N_G(v) = \{u \in V \mid uv \in E\}$, and the closed neighbourhood as $N_G[v] = N_G(v) \cup \{v\}$. A subset $D \subseteq V$ is called…

Combinatorics · Mathematics 2025-12-17 Arti Pandey , Kaustav Paul , Kamal Santra

We consider the problem of approximating the moment generating function (MGF) of a truncated random variable in terms of the MGF of the underlying (i.e., untruncated) random variable. The purpose of approximating the MGF is to enable the…

Statistics Theory · Mathematics 2007-06-13 Ronald W. Butler , Andrew T. A. Wood

For a sequence $\{X_{n}, \, n \geqslant 1 \}$ of nonnegative random variables where $\max[\min(X_{n} - s,t),0]$, $t > s \geqslant 0$, satisfy a moment inequality, sufficient conditions are given under which $\sum_{k=1}^n (X_k - \mathbb{E}…

Probability · Mathematics 2020-11-23 João Lita da Silva

Let $G=(V,E)$ be a simple connected graph. A set of vertices $S\subseteq V$ is said to be a dominating set if for any vertex in $V\setminus S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ is the…

Combinatorics · Mathematics 2016-03-25 Lang Tang , Shenglin Zhou

Let $G$ be a finite-dimensional vector space over a prime field $\mathbb{F}_p$ with some subspaces $H_1, \dots, H_k$. Let $f \colon G \to \mathbb{C}$ be a function. Generalizing the notion of Gowers uniformity norms, Austin introduced…

Combinatorics · Mathematics 2021-03-12 Luka Milićević

In this paper, we first study one-dimensional quadratic backward stochastic differential equations driven by $G$-Brownian motions ($G$-BSDEs) with unbounded terminal values. With the help of a $\theta$-method of Briand and Hu [4] and…

Probability · Mathematics 2021-01-28 Ying Hu , Shanjian Tang , Falei Wang

Given an undirected graph $G=(V,E)$, a vertex $v\in V$ is edge-vertex (ev) dominated by an edge $e\in E$ if $v$ is either incident to $e$ or incident to an adjacent edge of $e$. A set $S^{ev}\subseteq E$ is an edge-vertex dominating set…

Computational Geometry · Computer Science 2023-07-17 Vishwanath R. Singireddy , Manjanna Basappa

This paper is the first part of our series work to establish pointwise second-order necessary conditions for stochastic optimal controls. In this part, both drift and diffusion terms may contain the control variable but the control region…

Optimization and Control · Mathematics 2014-09-10 Haisen Zhang , Xu Zhang

We study when the \emph{optimization curve} of first-order methods -- the sequence \${f(x\_n)}*{n\ge0}\$ produced by constant-stepsize iterations -- is convex, equivalently when the forward differences \$f(x\_n)-f(x*{n+1})\$ are…

Optimization and Control · Mathematics 2025-09-12 Le Duc Hieu

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

Combinatorics · Mathematics 2025-09-23 Saeid Alikhani , Abbas Jafari , Maryam Safazadeh

Let $G=(V,E)$ be a simple graph. A set $D\subseteq V$ is a strong dominating set of $G$, if for every vertex $x\in V\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\leq deg(y)$. The strong domination number…

Combinatorics · Mathematics 2022-12-06 Saeid Alikhani , Nima Ghanbari

We investigate the notion of Gaussian domination for the spin $O(N)$ model on general finite graphs. We begin by proving a general inequality for spin correlations under the assumption of Gaussian domination, which directly implies…

Probability · Mathematics 2025-12-16 Xiao Han

We study sequential probability assignment in the Gaussian setting, where the goal is to predict, or equivalently compress, a sequence of real-valued observations almost as well as the best Gaussian distribution with mean constrained to a…

Information Theory · Computer Science 2025-05-27 Jaouad Mourtada

For a finite group $A$ with normal subgroup $G$, a subgroup $U$ of $G$ is an $A$-prime-power-covering subgroup if $U$ meets every $A$-conjugacy-class of elements of $G$ of prime power order. It is conjectured that $|G:U|$ is bounded by some…

Group Theory · Mathematics 2024-12-23 Michael Giudici , Luke Morgan , Cheryl E. Praeger

A fair dominating set in a graph $G$ (or FD-set) is a dominating set $S$ such that all vertices not in $S$ are dominated by the same number of vertices from $S$; that is, every two vertices not in $S$ have the same number of neighbors in…

Combinatorics · Mathematics 2011-09-07 Yair Caro , Adriana Hansberg , Michael A. Henning

The following anticoncentration property is proved. The probability that the $k$-order statistic of an arbitrarily correlated jointly Gaussian random vector $X$ with unit variance components lies within an interval of length $\varepsilon$…

Statistics Theory · Mathematics 2021-07-23 Damian Kozbur

A recent line of ground-breaking results for permutation-based SGD has corroborated a widely observed phenomenon: random permutations offer faster convergence than with-replacement sampling. However, is random optimal? We show that this…

Machine Learning · Computer Science 2021-11-29 Shashank Rajput , Kangwook Lee , Dimitris Papailiopoulos

Let $Z$ be an $n$-dimensional Gaussian vector and let $f: \mathbb R^n \to \mathbb R$ be a convex function. We show that: $$\mathbb P \left( f(Z) \leq \mathbb E f(Z) -t\sqrt{ {\rm Var} f(Z)} \right) \leq \exp(-ct^2),$$ for all $t>1$, where…

Probability · Mathematics 2017-06-19 Grigoris Paouris , Petros Valettas