Bäıou and Balinski (2000) characterized the stable admissions polytope using a system of linear inequalities. The structure of feasible solutions to this system of inequalities —fractional stable matchings—is the focus of this paper. The main result associates a geometric structure with each fractional stable matching. This insight appears to be interesting in its own right, and can be viewed a...

Computing meaningful clusters of nodes is crucial to analyze large networks. In this paper, we present a pairwise node similarity measure that allows to extract roles, i.e. group of nodes sharing similar flow patterns within a network. We propose a low rank iterative scheme to approximate the similarity measure for very large networks. Finally, we show that our low rank similarity score success...

We study the classes of the form ALMOST-R, for R a reducibility. characterization of these classes in terms of reductions to n-random languages , a subclass of algorithmically random languages. We also discuss the possibility of characterizing the classes ALMOST-R in terms of resource bounded measure.

For a given stationary max-stable random field X(t), t ∈ ℤd, the corresponding generalized Pickands constant coincideswith classical extremal index θX [0, 1]. In this contribution,we discuss necessary and sufficient conditions for to be 0, positive, or equal 1 also show that is so-called block index. Further, we consider some general functional indices of X prove large class functionals they co...