Related papers: Limit theory of discrete mathematics problems
Decision-theoretic troubleshooting is one of the areas to which Bayesian networks can be applied. Given a probabilistic model of a malfunctioning man-made device, the task is to construct a repair strategy with minimal expected cost. The…
We develop the theory of Riemann-Hilbert problems necessary for the results in part one of this series of papers. In particular, we obtain solutions for a family of non-linear Riemann-Hilbert problems through classical contraction…
In this paper we present the theory of lacunary trigonometric sums and lacunary sums of dilated functions, from the origins of the subject up to recent developments. We describe the connections with mathematical topics such as…
A Bayesian player acting in an infinite multi-player game learns to predict the other players' strategies if his prior assigns positive probability to their play (or contains a grain of truth). Kalai and Lehrer's classic grain of truth…
The lottery ticket hypothesis has sparked the rapid development of pruning algorithms that aim to reduce the computational costs associated with deep learning during training and model deployment. Currently, such algorithms are primarily…
In this paper, we consider a simple discrete-time optimal betting problem using the celebrated Kelly criterion, which calls for maximization of the expected logarithmic growth of wealth. While the classical Kelly betting problem can be…
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…
We study the problem of arithmetic billiards from a new perspective. We first raise a similar problem about reflecting lights inside grids. For the solution to this problem, we will give three proofs. Next, we consider a similar problem in…
An asymptotic limit of a class of Cahn-Hilliard systems is investigated to obtain a general nonlinear diffusion equation. The target diffusion equation may reproduce a number of well-known model equations: Stefan problem, porous media…
We consider a randomized algorithm for the unique games problem, using independent multinomial probabilities to assign labels to the vertices of a graph. The expected value of the solution obtained by the algorithm is expressed as a…
Recent successes of game-theoretic formulations in ML have caused a resurgence of research interest in differentiable games. Overwhelmingly, that research focuses on methods and upper bounds on their speed of convergence. In this work, we…
In this paper, we consider a network allocation problem motivated by peer-to-peer cloud storage models. The setting is that of a network of units (e.g. computers) that collaborate and offer each other space for the back up of the data of…
Methods are described for the solution of linear inference problems subject to deterministic constraints. The approach builds on work by Backus (1970a,b,c) and Parker (1977), but a range useful advances are suggested to address both…
The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…
We consider a general linear program in standard form whose right-hand side constraint vector is subject to random perturbations. This defines a stochastic linear program for which, under general conditions, we characterize the fluctuations…
The Lottery Ticket Hypothesis (LTH) states that a randomly-initialized large neural network contains a small sub-network (i.e., winning tickets) which, when trained in isolation, can achieve comparable performance to the large network. LTH…
Given a simple undirected graph $G$, the maximum $k$-club problem is to find a maximum-cardinality subset of nodes inducing a subgraph of diameter at most $k$ in $G$. This NP-hard generalization of clique, originally introduced to model low…
The paper is concerned with two-person dynamic zero-sum games. We investigate the limit of value functions of finite horizon games with long run average cost as the time horizon tends to infinity, and the limit of value functions of…
In a classical optimal stopping problem the aim is to maximize the expected value of a functional of a diffusion evaluated at a stopping time. This note considers optimal stopping problems beyond this paradigm. We study problems in which…
Consider the classic infinite-horizon problem of stopping a one-dimensional diffusion to optimise between running and terminal rewards and suppose we are given a parametrised family of such problems. We provide a general theory of parameter…