Concentration inequalities for random fields via coupling

We present a new and simple approach to concentration inequalities in the context of dependent random processes and random fields. Our method is based on coupling and does not use information inequalities. In case one has a uniform control on the coupling, one obtains exponential concentration inequalities. If such a uniform control is no more possible, then one obtains polynomial or stretched-exponential concentration inequalities. Our abstract results apply to Gibbs random fields, both at high and low temperatures and in particular to the low-temperature Ising model which is a concrete example of non-uniformity of the coupling.      

The high-T c superconductor Sr0.2Lai1.8CuO4: A direct and inverse-photoemission study

We have measured ultraviolet and inverse-photoemission spectra of the novel superconductor Sr₀₂La_1.8CuO₄. Our results compare favorably with recent band-structure calculations for La₂CuO₄.A full account of this work will be published elsewhere [1]     

Loss without recovery of Gibbsianness during diffusion of continuous spins

We consider a specific continuous-spin Gibbs distribution μ_t=0 for a double-well potential that allows for ferromagnetic ordering. We study the time-evolution of this initial measure under independent diffusions. For `high temperature' initial measures we prove that the time-evoved measure μ<sub>t</sub> is Gibbsian for all t. For `low temperature' initial measures we prove that μ_t stays Gibbsian for small enough times t, but loses its Gibbsian character for large enough t. In contrast to the analogous situation for discrete-spin Gibbs measures, there is no recovery of the Gibbs property for large t in the presence of a non-vanishing external magnetic field. All of our results hold for any dimension d≥2. This example suggests more generally that time-evolved continuous-spin models tend to be non-Gibbsian more easily than their discrete-spin counterparts. Research carried out at EURANDOM and supported by Deutsche Forschungsgemeinschaft     

Multiplicité des solutions d'équilibre d'une coque de Marguerre–von Kármán membranaireMultiplicity of solutions to the Marguerre–von Kármán membrane equations

We build explicitly an infinite number of equilibrium solutions of unloaded Marguerre–von Kármán membrane shells. This construction is based upon the existence of three elementary solutions, together with the solution of a Monge–Ampère equation associated with a partition of the reference configuration of the shell. To cite this article: A. Léger, B. Miara, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 649–654.     

A locally computed suboptimal control strategy for a class of interconnected systems

In this paper, a locally computed suboptimal control strategy for a class of interconnected systems is introduced. First, optimal statefeedback control equations are derived for a finite-horizon quadratic cost. Then, the control for each subsystem is separated into two portions. The first portion stabilizes the isolated subsystem, and the second portion corresponds to the interactions. To achieve a locally calculable control, an approximation to the optimal control equations is introduced, and two iterative suboptimal control algorithms are developed. In the first algorithm, the initial conditions of subsystems are assumed to be known; in the second algorithm, this information is replaced by statistical distributions. The orders of errors in the iterations of the algorithm and in the suboptimality are given in terms of interconnections. An example with comparisons is also included to show the performance of the approach.     

A finite cutting plane method for facial disjunctive programs

This paper shows that any linear disjunctive program with a finite number of constraints can be transformed into an equivalent facial program. Based upon linear programming technique, a new, finite cutting plane method is presented for the facial programs.

---

Zusammenfassung Die Arbeit zeigt, daß jedes lineare disjunktive Optimierungsproblem mit endlich vielen Restriktionen in ein äquivalentes Fazetten-Problem transformiert werden kann. Auf der Grundlage von linearer Optimierungstechnik wird für das Fazetten-Problem ein neues, endliches Schnittebenenverfahren vorgestellt.

     

On the S-procedure and Some Variants

We give a concise review and extension of S-procedure that is an instrumental tool in control theory and robust optimization analysis. We also discuss the approximate S-Lemma as well as its applications in robust optimization.The many suggestions and detailed corrections of an anonymous referee are gratefully acknowledged.