中文
相关论文

相关论文: The Lipschitz Constant of Perturbed Anonymous Game…

200 篇论文

A tournament on a graph is an orientation of its edges. The score sequence lists the in-degrees in non-decreasing order. Works by Winston and Kleitman (1983) and Kim and Pittel (2000) showed that the number $S_n$ of score sequences on the…

组合数学 · 数学 2025-11-18 Brett Kolesnik

The sum $\lambda_1 + \lambda_n$ of the maximum and minimum eigenvalues, and the odd girth of a graph both measure bipartiteness. We seek to relate these measures. In particular, for an odd integer $k\geq 3$, let $\gamma_k$ denote the…

组合数学 · 数学 2026-03-02 Fredy Yip

We consider the random $k$-SAT problem with $n$ variables, $m=m(n)$ clauses, and clause density $\alpha=\lim_{n\to\infty}m/n$ for $k=2,3$. It is known that if $\alpha$ is small enough, then the random $k$-SAT problem admits a solution with…

We study the model $G_\alpha\cup G(n,p)$ of randomly perturbed dense graphs, where $G_\alpha$ is any $n$-vertex graph with minimum degree at least $\alpha n$ and $G(n,p)$ is the binomial random graph. We introduce a general approach for…

组合数学 · 数学 2019-08-01 Julia Böttcher , Richard Montgomery , Olaf Parczyk , Yury Person

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…

Taking $t$ at random, uniformly from $[0,T]$, we consider the $k$th moment, with respect to $t$, of the random variable corresponding to the $2\beta$th moment of $\zeta(1/2+ix)$ over the interval $x\in(t, t+1]$, where $\zeta(s)$ is the…

数论 · 数学 2021-01-22 E. C. Bailey , J. P. Keating

We define a random step size tug-of-war game, and show that the gradient of a value function exists almost everywhere. We also prove that the gradients of value functions are uniformly bounded and converge weakly to the gradient of the…

偏微分方程分析 · 数学 2020-04-24 Amal Attouchi , Hannes Luiro , Mikko Parviainen

We introduce a three-player nonlocal game, with a finite number of classical questions and answers, such that the optimal success probability of $1$ in the game can only be achieved in the limit of strategies using arbitrarily…

量子物理 · 物理学 2020-10-28 Zhengfeng Ji , Debbie Leung , Thomas Vidick

This work is devoted to Lipschitz conditions on bounded harmonic functions on the upper half-space in $\mathbb {R}^n$. Among other results we prove the following one. Let $U(x',x_n)$ be a real-valued bounded harmonic function on the upper…

复变函数 · 数学 2025-01-28 Marijan Markovic

A two-player stochastic differential game representation has recently been obtained for solutions of the equation -\Delta_\infty u=h in a \calC^2 domain with Dirichlet boundary condition, where h is continuous and takes values in…

概率论 · 数学 2008-12-03 Rami Atar , Amarjit Budhiraja

The best algorithm so far for solving Simple Stochastic Games is Ludwig's randomized algorithm which works in expected $2^{O(\sqrt{n})}$ time. We first give a simpler iterative variant of this algorithm, using Bland's rule from the simplex…

数据结构与算法 · 计算机科学 2019-01-17 David Auger , Pierre Coucheney , Yann Strozecki

We present a time dependent quantum perturbation result, uniform in the Planck constant, for perturbations of potentials whose gradients are Lipschitz continuous by potentials whose gradients are only bounded a.e.. Though this low…

偏微分方程分析 · 数学 2021-03-19 François Golse , Thierry Paul

In this work we completely characterize how the frequency with which each player participates in the game dynamics affects the possibility of reaching efficient states, i.e., states with an approximation ratio within a constant factor from…

计算机科学与博弈论 · 计算机科学 2011-05-02 Angelo Fanelli , Luca Moscardelli , Alexander Skopalik

We consider a random walk among i.i.d. obstacles on the one dimensional integer lattice under the condition that the walk starts from the origin and reaches a remote location y. The obstacles are represented by a killing potential, which…

概率论 · 数学 2015-06-12 Elena Kosygina

In [18] we have shown that, for $p_{1},p_{2}\in(2,\infty]$, the constants of Bennett's inequality on unimodular bilinear forms on $\ell_{p_{1}}^{n_{1} }\times\ell_{p_{2}}^{n_{2}}$ are asymptotically bounded by $1$. In the present paper we…

泛函分析 · 数学 2021-08-03 Daniel Pellegrino , Anselmo Raposo

Let K be a complete, algebraically closed nonarchimedean valued field, and let f(z) be a non-constant rational function in K(z). We provide explicit bounds for the Lipschitz constant of f(z) acting on the Berkovich projective line, relative…

动力系统 · 数学 2015-12-04 Robert Rumely , Stephen Winburn

Moves in chess games are usually analyzed on a case-by-case basis by professional players, but thanks to the availability of large game databases, we can envision another approach of the game. Here, we indeed adopt a very different point of…

物理与社会 · 物理学 2023-05-01 Marc Barthelemy

In this Note, assuming that the generator is uniform Lipschitz in the unknown variables, we relate the solution of a one dimensional backward stochastic differential equation with the value process of a stochastic differential game. Under a…

概率论 · 数学 2007-05-23 Shanjian Tang

We study the first and second orders of the asymptotic expansion, as the dimension goes to infinity, of the moments of the Hilbert-Schmidt norm of a uniformly distributed matrix in the p-Schatten unit ball. We consider the case of matrices…

泛函分析 · 数学 2022-02-17 Benjamin Dadoun , Matthieu Fradelizi , Olivier Guédon , Pierre-André Zitt

We consider a quasi-variational inequality governed by a moving set. We employ the assumption that the movement of the set has a small Lipschitz constant. Under this requirement, we show that the quasi-variational inequality has a unique…

最优化与控制 · 数学 2019-09-09 Gerd Wachsmuth