Related papers: A functional limit theorem for the profile of sear…

This note finds a new characterization of complete Nevanlinna-Pick kernels on the Euclidean unit ball. The classical theory of Sz.-Nagy and Foias about the characteristic function is extended in this note to a commuting tuple $\bfT$ of…

The complexity of the Quicksort algorithm is usually measured by the number of key comparisons used during its execution. When operating on a list of $n$ data, permuted uniformly at random, the appropriately normalized complexity $Y_n$ is…

Tackling simulation optimization problems with non-convex objective functions remains a fundamental challenge in operations research. In this paper, we propose a class of random search algorithms, called Regular Tree Search, which…

We introduce an algorithm that constructs a random uniform graph with prescribed degree sequence together with a depth first exploration of it. In the so-called supercritical regime where the graph contains a giant component, we prove that…

We consider the K-satisfiability problem on a regular d-ary rooted tree. For this model, we demonstrate how we can calculate in closed form, the moments of the total number of solutions as a function of d and K, where the average is over…

We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…

Let $X=\{X_n: n\in\mathbb{N}\}$ be the linear process defined by $X_n=\sum^{\infty}_{j=1} a_j\varepsilon_{n-j}$, where the coefficients $a_j=j^{-\beta}\ell(j)$ are constants with $\beta>0$ and $\ell$ a slowly varying function, and the…

Motivated by the entropic optimal transport problem in unbounded settings, we study versions of Hilbert's projective metric for spaces of integrable functions of bounded growth. These versions of Hilbert's metric originate from cones which…

We extend the classical coding of measured $\mathbb R$-trees by continuous excursion-type functions to c\`adl\`ag excursion-type functions through the notion of parametric representations. The main feature of this extension is its…

We revisit a unified methodology for the iterative solution of nonlinear equations in Hilbert spaces. Our key observation is that the general approach from [Heid & Wihler, Math. Comp. 89 (2020), Calcolo 57 (2020)] satisfies an energy…

We consider a class of infinite weighted metric trees obtained as perturbations of self-similar regular trees. Possible definitions of the boundary traces of functions in the Sobolev space on such a structure are discussed by using…

Let $\xi_0, \xi_1, \dots$ be i.i.d. random variables with zero mean and unit variance. We study the following four families of random analytic functions: $\sum_{k=0}^n \sqrt{\binom nk} \xi_k z^k$ (spherical polynomials), $\sum_{k=0}^\infty…

We apply the concept of parking functions to rooted labelled trees and functional digraphs of mappings (i.e., functions $f : [n] \to [n]$) by considering the nodes as parking spaces and the directed edges as one-way streets: Each driver has…

The local (central) limit theorem precisely describes the behavior of iterated convolution powers of a probability distribution on the $d$-dimensional integer lattice, $\mathbb{Z}^d$. Under certain mild assumptions on the distribution, the…

For $S\subseteq \mathbb{F}^n$, consider the linear space of restrictions of degree-$d$ polynomials to $S$. The Hilbert function of $S$, denoted $\mathrm{h}_S(d,\mathbb{F})$, is the dimension of this space. We obtain a tight lower bound on…

Let $\xi_0,\xi_1,\ldots$ be independent identically distributed complex- valued random variables such that $\mathbb{E}\log(1+|\xi _0|)<\infty$. We consider random analytic functions of the form…

The k-Tree algorithm [Wagner 02] is a non-trivial algorithm for the average-case k-SUM problem that has found widespread use in cryptanalysis. Its input consists of k lists, each containing n integers from a range of size m. Wagner's…

This paper presents a comprehensive study of matrix Kloosterman sums, including their computational aspects, distributional behavior, and applications in cryptographic analysis. Building on the work of [Zelingher, 2023], we develop…

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…

Let $(\xi_1, \eta_1)$, $(\xi_2, \eta_2),\ldots$ be independent identically distributed $\mathbb{R}^2$-valued random vectors. We prove a strong law of large numbers, a functional central limit theorem and a law of the iterated logarithm for…