We show that for every hereditary permutation property P and every ε0 > 0, there exists an integer M such that if a permutation π is ε0far from P in the Kendall’s tau distance, then a random subpermutation of π of order M has the property P with probability at most ε0. This settles an open problem whether hereditary permutation properties are strongly testable, i.e., testable with respect to th...

We describe the use of random field and permutation methods to detect activation in cortically constrained maps of current density computed from MEG data. The methods are applicable to any inverse imaging method that maps event-related MEG to a coregistered cortical surface. These approaches also extend directly to images computed from event-related EEG data. We determine statistical thresholds...

In this paper we head for a fully Bayesian analysis of the latent class model with a priori unknown number of classes. Estimation is carried out by means of Markov Chain Monte Carlo (MCMC) methods. We deal explicitely with the consequences the unidentifiability of this type of model has on MCMC estimation. Joint Bayesian estimation of all latent variables, model parameters, and parameters deter...

P ∈ SN is a fast forward permutation if for each m the computational complexity of evaluating Pm(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in SN is (N) if one does not us...

| In this paper we develop a group theoretic method for reducing the class cardinality of Permutation (P) lters. P lters are a recently introduced class of non-linear lters that have their roots in permutation theory and are based on the mapping x 7 ! x r , where x and x r are temporal{ordered and rank{ordered observation vectors, respectively. While P lters contain as a proper subset a large b...

The set of synchronizing words a given n-state automaton forms regular language recognizable by an with \(2^n - n\) states. size recognizing for the is linked to computational problems related synchronization and length words. Hence, it natural investigate automata extremal this property, i.e., such that minimal deterministic has sync-maximal permutation groups have been introduced in [S. Hoffm...

This paper presents a robust and precise method for solving the permutation problem of frequency-domain blind source separation. It is based on two previous approaches: the direction of arrival estimation approach and the inter-frequency correlation approach. We discuss the advantages and disadvantages of the two approaches, and integrate them to exploit the both advantages. We also present a c...