We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...

A widely accepted method to specify (possibly infinite) behaviour is to define it as the solution, in some process algebra, of a recursive specification, i.e., a system of recursive equations over the fundamental operations of the process algebra. The method only works if the recursive specification has a unique solution in the process algebra; it is well-known that guardedness is a sufficient ...

In this paper we will discuss several methods for recursive query processing using a recursive control structure. We will describe the QSQR method, introduced in [Vie861 and show that it fails to produce all answers in certain cases. After analyzing the causes of this failure we propose an improved algorithm the RQA/FQI Strategy which is complete over the domain of function-free Horn clauses. T...

We describe a new method for improving the performance of functional programs based on catamorphisms. The method relies on using a compact vector representation for the recursive structure over which the catamorphism operates. This saves space and allows catamorphisms to be implemented in tail-recursive fashion even in cases where the standard linked structure representation requires non-tail-r...

we use the recursive method of construction large sets of t-designs given by qiu-rong wu (a note on extending t-designs‎, ‎{em australas‎. ‎j‎. ‎combin.}‎, ‎{bf 4} (1991) 229--235.), and present a similar method for constructing $t$-subset-regular‎ ‎self-complementary $k$-uniform hypergraphs of order $v$‎. ‎as an‎ ‎application we show the existence of a new family of 2-subset-regular‎ ‎self-com...

in this article, the discrete time state space model with first-order autoregressive dependent process noise is considered and the recursive method for filtering, prediction and smoothing of the hidden state from the noisy observation is designed. the explicit solution is obtained for the hidden state estimation problem. finally, in a simulation study, the performance of the designed method ...

we study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by devroye et. al (2011). in a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor ix_i floor$ where $x_0$, $ldots$ , $x_n$ is a sequence of i.i.d. random variables, with support in [0,...