Related papers: Limiting distributions for additive functionals on…
An intermittent nonlinear map generating subdiffusion is investigated. Computer simulations show that the generalized diffusion coefficient of this map has a fractal, discontinuous dependence on control parameters. An amended continuous…
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quadtrees and $k$-d trees). We assume the traditional model where the data consist of independent and uniform points in the unit…
We consider the cost of general orthogonal range queries in random quadtrees. The cost of a given query is encoded into a (random) function of four variables which characterize the coordinates of two opposite corners of the query rectangle.…
Doubly intractable distributions arise in many settings, for example in Markov models for point processes and exponential random graph models for networks. Bayesian inference for these models is challenging because they involve intractable…
In this work we derive limit theorems for trawl processes. First,we study the asymptotic behaviour of the partial sums of the discretized trawl process $(X_{i\Delta_{n}})_{i=0}^{\lfloor nt\rfloor-1}$, under the assumption that as…
The $\lambda$-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the…
The origin of deterministic diffusion is a matter of discussion. We study the asymptotic distributions of the sums $y_n(x)=\sum_{k=0}^{n-1}\psi (x+k\alpha)$, where $\psi$ is a periodic function of bounded variation and $\alpha$ an…
For linear processes with independent identically distributed innovations that are regularly varying with tail index $\alpha \in (0, 2)$, we study functional convergence of the joint partial sum and partial maxima processes. We derive a…
In this paper, we introduce a new probability distribution, the Lasso distribution. We derive several fundamental properties of the distribution, including closed-form expressions for its moments and moment-generating function.…
Decision trees are widely used for non-linear modeling, as they capture interactions between predictors while producing inherently interpretable models. Despite their popularity, performing inference on the non-linear fit remains largely…
We investigate the tree gonality of a genus-$g$ metric graph, defined as the minimum degree of a tropical morphism from any tropical modification of the metric graph to a metric tree. We give a combinatorial constructive proof that this…
In this paper our aim is to show some mean value inequalities for the modified Bessel functions of the first and second kinds. Our proofs are based on some bounds for the logarithmic derivatives of these functions, which are in fact…
We show that families of action graphs, with initial graphs which are linear of varying length, give rise to self-convolutions of the Catalan sequence. We prove this result via a comparison with planar rooted forests with a fixed number of…
The number of unbalanced interior nodes of divide-and-conquer trees on $n$ leaves is known to form a sequence of dilations of the Takagi function on dyadic rationals. We use this fact to derive identities on the Takagi function and on the…
In this article we propose a boosting algorithm for regression with functional explanatory variables and scalar responses. The algorithm uses decision trees constructed with multiple projections as the "base-learners", which we call…
Let $\cT$ be a monadic-second order class of finite trees, and let $\bT(x)$ be its (ordinary) generating function, with radius of convergence $\rho$. If $\rho \ge 1$ then $\cT$ has an explicit specification (without using recursion) in…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively (from the root) split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities…
Distribution regression, where the goal is to predict a scalar response from a distribution-valued predictor, arises naturally in settings where observations are grouped and outcomes depend on group-level characteristics rather than on…
We introduce a framework for proving lower bounds on computational problems over distributions against algorithms that can be implemented using access to a statistical query oracle. For such algorithms, access to the input distribution is…
The first order loss function and its complementary function are extensively used in practical settings. When the random variable of interest is normally distributed, the first order loss function can be easily expressed in terms of the…