We prove that a.a.s. the maximum size of an induced subtree binomial random graph G ( n , p ) is concentrated in 2 consecutive points. also that, given a non-negative integer-valued function t k < ε under certain smoothness condition on this function, subgraph with exactly edges points as well.

Several approaches have been described for the automatic unsupervised acquisition of patterns for information extraction. Each approach is based on a particular model for the patterns to be acquired, such as a predicate-argument structure or a dependency chain. The effect of these alternative models has not been previously studied. In this paper, we compare the prior models and introduce a new ...

The model-checking problem for higher-order recursive programs, expressed as higher-order recursion schemes (HORS), and where properties are specified in monadic second-order logic (MSO) has received much attention since it was proven decidable by Ong ten years ago. Every HORS may be understood as a simply-typed λ-term G with fixpoint operators Y whose free variables a, b, c . . . ∈ Σ are of or...