Related papers: Bounding normalization time through intersection t…
Branching bisimilarity on normed BPA processes was recently shown to be decidable by Yuxi Fu (ICALP 2013) but his proof has not provided any upper complexity bound. We present a simpler approach based on relative prime decompositions that…
In this paper we present a series of results that permit to extend in a direct manner uniform deviation inequalities of the empirical process from the independent to the dependent case characterizing the additional error in terms of…
Analysing statistical properties of the normal forms of random braids, we observe that, except for an initial and a final region whose lengths are uniformly bounded (that is, the bound is independent of the length of the braid), the…
Using a probabilistic approach, we derive some interesting combinatorial identities involving gamma and beta functions. These results generalize certain well-known combinatorial identities involving binomial coefficients and special…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
We characterize those intersection-type theories which yield complete intersection-type assignment systems for lambda-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics,…
A linear sequence transformation is defined that accelerates the convergence of the negative binomial series when the terms of the binomial have the same sign. The transformed series can be used to extend the region of applicability of the…
Boundary conditions may change the phase diagram of non-equilibrium statistical systems like the one-dimensional asymmetric simple exclusion process with and without particle number conservation. Using the quantum Hamiltonian approach, the…
In this paper, we study a nonlocal boundary blow up problem on an interval and obtain the precise asymptotic formula for solutions when the bifurcation parameter in the problem is large.
A bound uniform over various loss-classes is given for data generated by stationary and phi-mixing processes, where the mixing time (the time needed to obtain approximate independence) enters the sample complexity only in an additive way.…
A general rule determining how extremal branes can intersect in a configuration with zero binding energy is presented. It is derived in a model independent way and without explicit use of supersymmetry, solving a set of classical equations…
The theory of interface localization in near-critical planar systems at phase coexistence is formulated from first principles. We show that mutual delocalization of two interfaces, amounting to interfacial wetting, occurs when the bulk…
A bilateral (i.e., upper and lower) bound on the mean-square error under a general model mismatch is developed. The bound, which is derived from the variational representation of the chi-square divergence, is applicable in the Bayesian and…
Labeling of sentence boundaries is a necessary prerequisite for many natural language processing tasks, including part-of-speech tagging and sentence alignment. End-of-sentence punctuation marks are ambiguous; to disambiguate them most…
We present intersection type systems in the style of sequent calculus, modifying the systems that Valentini introduced to prove normalisation properties without using the reducibility method. Our systems are more natural than Valentini's…
A recursion for the joint moments of the external branch lengths for coalescents with multiple collisions ($\Lambda$-coalescents) is provided. This recursion is used to derive asymptotic results as the sample size $n$ tends to infinity for…
Let $T$ be a general sampling statistic that can be written as a linear statistic plus an error term. Uniform and non-uniform Berry--Esseen type bounds for $T$ are obtained. The bounds are the best possible for many known statistics.…
Trace norm regularization is a popular method of multitask learning. We give excess risk bounds with explicit dependence on the number of tasks, the number of examples per task and properties of the data distribution. The bounds are…
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is $\lambda$-calculus a reasonable machine? Is there a way to measure the computational…
In this paper, we develop interval estimation methods for means of bounded random variables based on a sequential procedure such that the sampling is continued until the sample sum is no less than a prescribed threshold.