Related papers: Strong convergence of partial match queries in ran…
Random embeddings project high-dimensional spaces to low-dimensional ones; they are careful constructions which allow the approximate preservation of key properties, such as the pair-wise distances between points. Often in the field of…
We propose a discrete time formulation of the semi martingale optimal transport problembased on multi-marginal entropic transport. This approach offers a new way to formulate and solve numerically the calibration problem proposed by Guo et…
We consider a multivariate distributional recursion of sum-type as arising in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the…
This paper deals with rates of convergence in the strong law of large numbers, in the Baum-Katz form, for partial sums of Banach space valued random variables. The results are then applied to solve similar problems for weighted partial sums…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
The purpose of this paper is two-fold. First is to extend the notions of an n-dimensional semimartingale and its stochastic integral to a piecewise semimartingale of stochastic dimension. The properties of the former carry over largely…
We consider random hermitian matrices in which distant above-diagonal entries are independent but nearby entries may be correlated. We find the limit of the empirical distribution of eigenvalues by combinatorial methods. We also prove that…
We propose a general approximation method for determining optimal trading strategies in markets with proportional transaction costs, with a polynomial approximation of the residual value function. The method is exemplified by several…
Programs with randomization constructs is an active research topic, especially after the recent introduction of martingale-based analysis methods for their termination and runtimes. Unlike most of the existing works that focus on proving…
It is known that a $2\times 2$ quaternionic matrix has one, two or an infinite number of left eigenvalues, but the available algebraic proofs are difficult to generalize to higher orders. In this paper a different point of view is adopted…
We consider a continuous-time random walk on a regular tree of finite depth and study its favorite points among the leaf vertices. For the walk started from a leaf vertex and stopped upon hitting the root we prove that, in the limit as as…
In this paper, convergence rates of the spectral distributions of quaternion self-dual Hermitian matrices are investigated. We show that under conditions of finite 6th moments, the expected spectral distribution of a large quaternion…
We consider a homogenous fragmentation process with killing at an exponential barrier. With the help of two families of martingales we analyse the growth of the largest fragment for parameter values that allow for survival. In this respect…
We establish functional limit theorems for ergodic sums of observables with power singularities for expanding circle maps. In the regime where the observables have infinite variance, we show that when rescaled by $N^{1/s}(\ln N)^\alpha$,…
The classic model of computable randomness considers martingales that take real or rational values. Recent work by Bienvenu et al. (2012) and Teutsch (2014) shows that fundamental features of the classic model change when the martingales…
We investigate the random bipartite optimal matching problem on a flat torus in two-dimensions, considering general strictly convex power costs of the distance. We extend the successful ansatz first introduced by Caracciolo et al. for the…
We present new links between some remarkable martingales found in the study of the Binary Search Tree, or of the Bisection Problem, looking at them on the probability space of a continuous time binary branching process.
We discuss the upper and lower estimates for the rate of convergence of Pure and Orthogonal Greedy Algorithms for dictionary with bounded cumulative coherence.
We use the random self-similarity of the continuum random tree to show that it is homeomorphic to a post-critically finite self-similar fractal equipped with a random self-similar metric. As an application we determine the mean and…
It is well known that a family of $n\times n$ commuting matrices can be simultaneously triangularized by a unitary similarity transformation. The diagonal entries of the triangular matrices define the $n$ joint eigenvalues of the family. In…