Related papers: Strong convergence of partial match queries in ran…

In this paper, we exhibit a new family of martingale couplings between two one-dimensional probability measures $\mu$ and $\nu$ in the convex order. This family is parametrised by two dimensional probability measures on the unit square with…

In the first part of this paper we give easy and intuitive proofs for the small value probabilities of the martingale limit of a supercritical Galton-Watson process in both the Schr\"oder and the B\"ottcher case. These results are…

Let $X$, $X_1$, $X_2$, $...$ be i.i.d. random variables, and let $S_n=X_1+... + X_n$ be the partial sums and $M_n=\max_{k\le n}|S_k|$ be the maximum partial sums. We give the sufficient and necessary conditions for a kind of limit theorems…

Given the univariate marginals of a real-valued, continuous-time martingale, (respectively, a family of measures parameterised by $t \in [0,T]$ which is increasing in convex order, or a double continuum of call prices) we construct a family…

Let $(Z_n)$ be a supercritical branching process in a random environment $\xi$. We study the convergence rates of the martingale $W_n = Z_n/ E[Z_n| \xi]$ to its limit $W$. The following results about the convergence almost sur (a.s.), in…

The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…

We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover,…

Consider a problem where 4k given vectors need to be partitioned into k clusters of four vectors each. A cluster of four vectors is called a quad, and the cost of a quad is the sum of the component-wise maxima of the four vectors in the…

A complete characterization of the possible joint distributions of the maximum and terminal value of uniformly integrable martingale has been known for some time, and the aim of this paper is to establish a similar characterization for…

The probability that the sum of independent, centered, identically distributed, heavy-tailed random variables achieves a very large value is asymptotically equal to the probability that there exists a single summand equalling that value. We…

We prove concentration bounds for random Euclidean combinatorial optimization problems with $p$--costs. For bipartite matching and for the (mono- and bi-partite) traveling salesperson problem in dimension $d\ge 3$, we obtain concentration…

We propose a constructive framework for the super-hedging problem of a European contingent claim under proportional transaction costs in discrete time. Our main contribution is an explicit recursive scheme that computes both the…

Dzhaparidze and Spreij [5] showed that the quadratic variation of a semimartingale can be approximated using a randomized periodogram. We show that the same approximation is valid for a special class of continuous stochastic processes. This…

We prove a fiberwise almost sure invariance principle for random piecewise expanding transformations in one and higher dimensions using recent developments on martingale techniques.

We consider the approximation scheme of the American call option via the discrete Morse semiflow. It is the minimizing scheme of a time-semidiscretized variational functional. In this paper we obtain a rate of convergence of approximate…

We develop a martingale approximation framework yielding quantitative maximal large deviations estimates for invertible dynamical systems. From suitable decay of correlations, we deduce these estimates and, as an application, we obtain…

We introduce a method for proving almost sure termination in the context of lambda calculus with continuous random sampling and explicit recursion, based on ranking supermartingales. This result is extended in three ways. Antitone ranking…

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

We consider directed polymers in random environment on the lattice Z d at small inverse temperature and dimension d $\ge$ 3. Then, the normalized partition function W n is a regular martingale with limit W. We prove that n (d--2)/4 (W n --…

Given a set-valued stochastic process $(V_t)_{t=0}^T$, we say that the martingale selection problem is solvable if there exists an adapted sequence of selectors $\xi_t\in V_t$, admitting an equivalent martingale measure. The aim of this…