Explore the vast range of titles available.

We develop computational methods for solving the martingale optimal transport (MOT) problem—a version of the classical optimal transport with an additional martingale constraint on the transport’s dynamics. We prove that a general, multi-step multi-dimensional, MOT problem can be approximated through a sequence of linear programming (LP) problems which result from a discretization of the marginal distributions combined with an appropriate relaxation of the martingale condition. Further, we establish two generic approaches for discretising probability distributions, suitable respectively for the cases when we can compute integrals against these distributions or when we can sample from them. These render our main result applicable and lead to an implementable numerical scheme for solving MOT problems. Finally, specialising to the one-step model on real line, we provide an estimate of the convergence rate which, to the best of our knowledge, is the first of its kind in the literature.

We define a class of random measures, spatially independent martingales, which we view as a natural generalization of the canonical random discrete set, and which includes as special cases many variants of fractal percolation and Poissonian cut-outs. We pair the random measures with deterministic families of parametrized measures

We consider the optimal Skorokhod embedding problem (SEP) given full marginals over the time interval [0, 1]. The problem is related to the study of extremal martingales associated with a peacock (\"process increasing in convex order,\" by Hirsch, Profeta, Roynette and Yor [Peacocks and Associated Martingales, with Explicit Constructions (2011), Springer, Milan]). A general duality result is obtained by convergence techniques. We then study the case where the reward function depends on the maximum of the embedding process, which is the limit of the martingale transport problem studied in Henry-Labordère, Obłój, Spoida and Touzi [Ann. Appl. Probab. 26 (2016) 1-44]. Under technical conditions, we then characterize the optimal value and the solution to the dual problem. In particular, the optimal embedding corresponds to the Madan and Yor [Bernoulli 8 (2002) 509-536] peacock under their \"increasing mean residual value\" condition. We also discuss the associated martingale inequality.

We introduce the martingale local Morrey spaces. We establish the Doob's inequality, the Burkholder–Gundy inequality and the boundedness of the martingale transforms to martingale local Morrey spaces defined on complete probability spaces.

We study the optimal transport between two probability measures on the real line, where the transport plans are laws of one-step martingales. A quasi-sure formulation of the dual problem is introduced and shown to yield a complete duality theory for general marginals and measurable reward (cost) functions: absence of a duality gap and existence of dual optimizers. Both properties are shown to fail in the classical formulation. As a consequence of the duality result, we obtain a general principle of cyclical monotonicity describing the geometry of optimal transports.

The hypothesis of randomness is fundamental in statistical machine learning and in many areas of nonparametric statistics; it says that the observations are assumed to be independent and coming from the same unknown probability distribution. This hypothesis is close, in certain respects, to the hypothesis of exchangeability, which postulates that the distribution of the observations is invariant with respect to their permutations. This paper reviews known methods of testing the two hypotheses concentrating on the online mode of testing, when the observations arrive sequentially. All known online methods for testing these hypotheses are based on conformal martingales, which are defined and studied in detail. An important variety of online testing is change detection, where the use of conformal martingales leads to conformal versions of the CUSUM and Shiryaev–Roberts procedures; these versions work in the nonparametric setting where the data is assumed IID according to a completely unknown distribution before the change. The paper emphasizes conceptual and practical aspects and states two kinds of results. Validity results limit the probability of a false alarm or, in the case of change detection, the frequency of false alarms for various procedures based on conformal martingales. Efficiency results establish connections between randomness, exchangeability, and conformal martingales.

Multiple testing of a single hypothesis and testing multiple hypotheses are usually done in terms of p-values. In this paper, we replace p-values with their natural competitor, e-values, which are closely related to betting, Bayes factors and likelihood ratios. We demonstrate that e-values are often mathematically more tractable; in particular, in multiple testing of a single hypothesis, e-values can be merged simply by averaging them. This allows us to develop efficient procedures using e-values for testing multiple hypotheses.

We introduce several martingale Orlicz-Hardy spaces with continuous time. By use of the atomic decomposition, we establish some martingale inequalities and characterize the dualities of these spaces.

Under mild regularity assumptions, the transport problem is stable in the following sense: if a sequence of optimal transport plans π¹, π², . . . converges weakly to a transport plan π, then π is also optimal (between its marginals). Alfonsi, Corbetta and Jourdain (Ann. Inst. Henri Poincaré Probab. Stat. 56 (2020) 1706–1729) asked whether the same property is true for the martingale transport problem. This question seems particularly pressing since martingale transport is motivated by robust finance where data is naturally noisy. On a technical level, stability in the martingale case appears more intricate than for classical transport since martingale optimal transport plans are not characterized by a “monotonicity”-property of their supports. In this paper we give a positive answer and establish stability of the martingale transport problem. As a particular case, this recovers the stability of the left curtain coupling established by Juillet (In Séminaire de Probabilités XLVIII (2016) 13–32 Springer). An important auxiliary tool is an unconventional topology which takes the temporal structure of martingales into account. Our techniques also apply to the the weak transport problem introduced by Gozlan, Roberto, Samson and Tetali.

While traditional multiple testing procedures prohibit adaptive analysis choices made by users, Goeman and Solari (Statist. Sci. 26 (2011) 584–597) proposed a simultaneous inference framework that allows users such flexibility while preserving high-probability bounds on the false discovery proportion (FDP) of the chosen set. In this paper, we propose a new class of such simultaneous FDP bounds, tailored for nested sequences of rejection sets. While most existing simultaneous FDP bounds are based on closed testing using global null tests based on sorted p-values, we additionally consider the setting where side information can be leveraged to boost power, the variable selection setting where knockoff statistics can be used to order variables, and the online setting where decisions about rejections must be made as data arrives. Our finite-sample, closed form bounds are based on repurposing the FDP estimates from false discovery rate (FDR) controlling procedures designed for each of the above settings. These results establish a novel connection between the parallel literatures of simultaneous FDP bounds and FDR control methods, and use proof techniques employing martingales and filtrations that are new to both these literatures. We demonstrate the utility of our results by augmenting a recent knockoffs analysis of the UK Biobank dataset.