Related papers: The Lipschitz Constant of Perturbed Anonymous Game…

We show the existence of "mild solutions" for a first-order mean field game of controls under the state constraint that trajectories be confined in a closed and bounded set in euclidean space. This extends the results of Cannarsa and…

We consider random walks $X,Y$ on a finite graph $G$ with respective lazinesses $\alpha, \beta \in [0,1]$. Let $\mu_k$ and $\nu_k$ be the $k$-step transition probability measures of $X$ and $Y$. In this paper, we study the Wasserstein…

In this paper we investigate the behavior of the eigenvalues of the Dirichlet Laplacian on sets in $\mathbb{R}^N$ whose first eigenvalue is close to the one of the ball with the same volume. In particular in our main Theorem we prove that,…

We define a dynamical simple symmetric random walk in one dimension, and show that there almost surely exist exceptional times at which the walk tends to infinity. This is in contrast to the usual dynamical simple symmetric random walk in…

Let $\Omega =\omega\times\mathbb R$ where $\omega\subset \mathbb R^2$ be a bounded domain, and $V : \Omega \to\mathbb R$ a bounded potential which is $2\pi$-periodic in the variable $x_{3}\in \mathbb R$. We study the inverse problem…

Comparisons of the positive and negative halves of the distributions of parity-odd event variables in particle-physics experimental data can provide sensitivity to sources of non-standard parity violation. Such techniques benefit from…

A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…

Lipschitz constants of neural networks have been explored in various contexts in deep learning, such as provable adversarial robustness, estimating Wasserstein distance, stabilising training of GANs, and formulating invertible neural…

We consider $k$-Facility Location games, where $n$ strategic agents report their locations on the real line, and a mechanism maps them to $k\ge 2$ facilities. Each agent seeks to minimize her distance to the nearest facility. We are…

We provide an account for the existence and uniqueness of solutions to rough differential equations under the framework of controlled rough paths. The case when the driving path is $\beta$-H\"older continuous, for $\beta>1/3$, is widely…

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

We consider nondegenerate, finitely supported random walks on a finitely generated Gromov hyperbolic group. We show that the entropy and the escape rate are Lipschitz functions of the probability if the support remains constant.

We consider a generalisation of the vicious walker problem in which N random walkers in R^d are grouped into p families. Using field-theoretic renormalisation group methods we calculate the asymptotic behaviour of the probability that no…

Let (X, d) be a quasi-convex, complete and separable metric space with reference probability measure m. We prove that the set of of real valued Lipschitz function with non zero point-wise Lipschitz constant m-almost everywhere is residual,…

\noindent Using the techniques connected with the measure of noncompactness we investigate the neutral difference equation of the following form \begin{equation*} \Delta \left(r_{n}\left(\Delta \left(x_{n}+p_{n}x_{n-k}\right) \right)…

An amazingly simple model of correlated disorder is a one-dimensional chain of n potential steps with a fixed width lc and random heights. A theoretical analysis of the average transmission coefficient and Landauer resistance as functions…

We study a discrete Laplace operator $\Delta$ on percolation subgraphs of an infinite graph. The ball volume is assumed to grow at most polynomially. We are interested in the behavior of the integrated density of states near the lower…

We study parity games in which one of the two players controls only a small number $k$ of nodes and the other player controls the $n-k$ other nodes of the game. Our main result is a fixed-parameter algorithm that solves bipartite parity…

We study the relationship between tournaments and random walks. This connection was first observed by Erd\H{o}s and Moser. Winston and Kleitman came close to showing that $S_n=\Theta(4^n/n^{5/2})$. Building on this, and works by Tak\'acs,…

We introduce and analyze the ordered Zeckendorf game, a novel combinatorial two-player game inspired by Zeckendorf's Theorem, which guarantees a unique decomposition of every positive integer as a sum of non-consecutive Fibonacci numbers.…