RÉSUMÉ. Nous proposons un algorithme distribué, asynchrone, silencieux et autostabilisant calculant un ensemble k-dominant minimal d’un réseau identifié quelconque de n processus. La taille de l’ensemble k-dominant calculé est d’au plus ⌈ n k+1 ⌉ processus. À partir d’un transformateur présenté également dans cet article, nous obtenons une solution fonctionnant sous un ordonnanceur inéquitable ...

In this paper, we propose an inexact Newton-like conditional gradient method for solving constrained systems of nonlinear equations. The local convergence of the new method as well as results on its rate are established by using a general majorant condition. Two applications of such condition are provided: one is for functions whose the derivative satisfies Hölder-like condition and the other i...

the function (1.1) will sometimes be denoted by g(0;f). The function g(0) is suggested by some heuristic argument (see [3, I]). It does not seem to possess any obvious geometric significance, although it has a majorant, s(0), with a simple geometric meaning. The reader interested in this problem is referred to papers [4, 7]. In the present note we shall be exclusively concerned with the functio...

Abstract. A new class of schemes of the DSMC type for computing near-continuum flows has been recently suggested: the time-relaxed Monte Carlo (TRMC) methods. An important step preceding the wide use of these schemes is their validation by classical homogeneous and one-dimensional problems of gas dynamics. For this purpose, a plane Couette flow is considered in the present paper. A comparison o...

The analytic aspects of the operator realization of Wick power series of infrared singular free fields are considered. Taking advantage of the holomorphy properties of the two-point correlation function and its Hilbert majorant in x-space, we solve in a general and model independent way the problem of finding the adequate test function space on which a given Wick series is convergent. Substanti...

The familiar bijections between the representations of permutations as words and as products of cycles have a natural class of “data driven” extensions that permit us to use purely combinatorial means to obtain precise probabilistic information about the geometry of random walks. In particular, we show that the algorithmic bijection of Bohnenblust and Spitzer can be used to obtain means, varian...