Related papers: Sharp barrier estimates for Bessel bridges
Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…
Square grids play a pivotal role in Robertson and Seymour's work on graph minors as planar obstructions to small treewidth. We introduce a three-sided bramble in a plane graph called a net, which generalizes the standard bramble of crosses…
Let $H$ be a real separable Hilbert space and $(a_k)_{k\in\mathbb{Z}}$ a sequence of bounded linear operators from $H$ to $H$. We consider the linear process $X$ defined for any $k$ in $\mathbb{Z}$ by…
Let alpha \in (1, 2] and X be an R^d-valued alpha-stable process with independent and symmetric components starting in 0. We consider the closure S_t of the path described by X on the interval [0, t] and its convex hull Z_t. The first…
This paper provides a non-asymptotic analysis of linear stochastic approximation (LSA) algorithms with fixed stepsize. This family of methods arises in many machine learning tasks and is used to obtain approximate solutions of a linear…
We provide a representation of the maximal difference between a standard Brownian bridge and its concave majorant on the unit interval, from which we deduce expressions for the distribution and density functions and moments of this…
Results of penalization of a one-dimensional Brownian motion $(X_t) $, by its one-sided maximum $\dis (S_t=\sup_{0 \leq u \leq t}X_u)$, which were recently obtained by the authors are improved with the consideration-in the present paper- of…
Causal mediation analysis decomposes the total treatment effect into a portion operating through a hypothesized mediator and a residual direct portion. Identification of natural direct and indirect effects typically rests on the mediator…
We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…
In this note, we consider Szemer\'{e}di's theorem on $k$-term arithmetic progressions over finite fields $\mathbb{F}_p^n$, where the allowed set $S$ of common differences in these progressions is chosen randomly of fixed size. Combining a…
We consider one-dimensional discrete-time random walks (RWs) with arbitrary symmetric and continuous jump distributions $f(\eta)$, including the case of L\'evy flights. We study the expected maximum ${\mathbb E}[M_n]$ of bridge RWs, i.e.,…
We study mathematical expectations of Betti numbers of configuration spaces of planar linkages, viewing the lengths of the bars of the linkage as random variables. Our main result gives an explicit asymptotic formulae for these mathematical…
In this article, we extend the integration by parts formulae (IbPF) for the laws of Bessel bridges obtained in a recent work by Elad Altman and Zambotti to linear functionals. Our proof relies on properties of hypergeometric functions, thus…
Our interest is in the cumulative probabilities Pr(L(t) \le l) for the maximum length of increasing subsequences in Poissonized ensembles of random permutations, random fixed point free involutions and reversed random fixed point free…
Understanding the structure of minor-free metrics, namely shortest path metrics obtained over a weighted graph excluding a fixed minor, has been an important research direction since the fundamental work of Robertson and Seymour. A…
We investigate the theoretical performances of the Partial Least Square (PLS) algorithm in a high dimensional context. We provide upper bounds on the risk in prediction for the statistical linear model when considering the PLS estimator.…
Let v be a bounded function with bounded support in R^d, d>=3. Let x,y in R^d. Let Z(t) denote the path integral of v along the path of a Brownian bridge in R^d which runs for time t, starting at x and ending at y. As t->infty, it is…
A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the sub-net mesh size goes to zero. The validity of this method is tested for bond percolation on filled…
We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…