Factor probabilistic distance clustering (FPDC): a new clustering method

Factor clustering methods have been developed in recent years thanks to improvements in computational power. These methods perform a linear transformation of data and a clustering of the transformed data, optimizing a common criterion. Probabilistic distance (PD)-clustering is an iterative, distribution free, probabilistic clustering method. Factor PD-clustering (FPDC) is based on PD-clustering and involves a linear transformation of the original variables into a reduced number of orthogonal ones using a common criterion with PD-clustering. This paper demonstrates that Tucker3 decomposition can be used to accomplish this transformation. Factor PD-clustering alternatingly exploits Tucker3 decomposition and PD-clustering on transformed data until convergence is achieved. This method can significantly improve the PD-clustering algorithm performance; large data sets can thus be partitioned into clusters with increasing stability and robustness of the results. Real and simulated data sets are used to compare FPDC with its main competitors, where it performs equally well when clusters are elliptically shaped but outperforms its competitors with non-Gaussian shaped clusters or noisy data.     

Nondegeneracy,from the prospect of wave-wave regular interactions of a gasdynamic type

A parallel is considered between Burnat's “algebraic” approach [restricted to a genuine nonlinearity] and Martin's “differential” approach regarding their contribution to describing some nondegenerate one-dimensional gasdynamic regular interaction solutions. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A priori inequalities for solutions of mixed boundary-value problems in unbounded domains

We prove some a priori inequalities for solutions of mixed boundary-value problems for a class of divergence form elliptic equations with discontinuous and unbounded coefficients in unbounded domains. Mathematics Subject Classification (2000) 35J25     

Exact asymptotics in eigenproblems for fractional Brownian covariance operators

Many results in the theory of Gaussian processes rely on the eigenstructure of the covariance operator. However, eigenproblems are notoriously hard to solve explicitly and closed form solutions are known only in a limited number of cases. In this paper we set up a framework for the spectral analysis of the fractional type covariance operators, corresponding to an important family of processes, which includes the fractional Brownian motion and its noise. We obtain accurate asymptotic approximations for the eigenvalues and the eigenfunctions. Our results provide a key to several problems, whose solution is long known in the standard Brownian case, but was missing in the more general fractional setting. This includes computation of the exact limits of $L^2$-small ball probabilities and asymptotic analysis of singularly perturbed integral equations, arising in mathematical physics and applied probability.     

Propagation and localization of polaritons in disordered organic microcavities

The effect of disorder on the polaritonic states in organic microcavities utilizing J aggregates of cyanine dyes is examined. The comparison between the elastic mean free path, the phase breaking length and the wavelength of polaritons shows that, by varying two control parameters, one can achieve different regimes of cavity polariton propagation and localization (including weak and strong localization) in one sample at room temperature. We analyze the role of different parameters of the sample in the possibility of realization of each regime.     

Buyer-seller exactness in the assignment game

In the assignment game framework, we try to identify those assignment matrices in which no entry can be increased without changing the core of the game. These games will be called buyer-seller exact games and satisfy the condition that each mixed-pair coalition attains the corresponding matrix entry in the core of the game. For a given assignment game, a unique buyer-seller exact assignment game with the same core is proved to exist. In order to identify this matrix and to provide a characterization of those assignment games which are buyer-seller exact in terms of the assignment matrix, attainable upper and lower core bounds for the mixed-pair coalitions are found. As a consequence, an open question posed in Quint (1991) regarding a canonical representation of a “45^o-lattice” by means of the core of an assignment game can now be answered. Received: March 2002/Revised version: January 2003 RID="*" ID="*"  Institutional support from research grants BEC 2002-00642 and SGR2001-0029 is gratefully acknowledged RID="**" ID="**"  The authors thank the referees for their comments     

Nilpotent Steiner loops of class 2

We describe Steiner loops of nilpotency class 2 and establish the classification of finite 3-generated nilpotent Steiner loops of nilpotency class 2.     

On the Iterated Biclique Operator

A biclique of a graph G is a maximal induced complete bipartite subgraph of G. The biclique graph of G, denoted by , is the intersection graph of the bicliques of G. We say that a graph G diverges (or converges or is periodic) under an operator F whenever ( for some m, or for some k and , respectively). Given a graph G, the iterated biclique graph of G, denoted by , is the graph obtained by applying the biclique operator k successive times to G. In this article, we study the iterated biclique graph of G. In particular, we classify the different behaviors of when the number of iterations k grows to infinity. That is, we prove that a graph either diverges or converges under the biclique operator. We give a forbidden structure characterization of convergent graphs, which yield a polynomial time algorithm to decide if a given graph diverges or converges. This is in sharp contrast with the situsation for the better known clique operator, where it is not even known if the corresponding problem is decidable. © 2012 Wiley Periodicals, Inc. J. Graph Theory 73: 181–190, 2013     

Ideals in distributive posets

We prove that any ideal in a distributive (relative to a certain completion) poset is an intersection of prime ideals. Besides that, we give a characterization of n-normal meet semilattices with zero, thus generalizing a known result for lattices with zero.     

Biased random walk in a one-dimensional percolation model

We consider random walk with a nonzero bias to the right, on the infinite cluster in the following percolation model: take i.i.d. bond percolation with retention parameter p$p$ on the so-called infinite ladder, and condition on the event of having a bi-infinite path from −∞$-\infty$ to ∞$\infty$. The random walk is shown to be transient, and to have an asymptotic speed to the right which is strictly positive or zero depending on whether the bias is below or above a certain critical value which we compute explicitly.