Topologie faible et méta-stabilité
Topologie fine et mesure de référence.
Topologies du type de Skorohod
Topologies métrisables rendant continues les trajectoires d'un processus
Topologies on Spaces of Vector-Valued Continuous Functions. II.
Totally coherent set-valued probability assessments
We introduce the concept of total coherence of a set-valued probability assessment on a family of conditional events. In particular we give sufficient and necessary conditions of total coherence in the case of interval-valued probability assessments. Some relevant cases in which the set-valued probability assessment is represented by the unitary hypercube are also considered.
Tout sous-espace de contient un , d’après D. Aldous
Toward the best constant factor for the Rademacher-Gaussian tail comparison
It is proved that the best constant factor in the Rademacher-Gaussian tail comparison is between two explicitly defined absolute constants c1 and c2 such that c2≈1.01 c1. A discussion of relative merits of this result versus limit theorems is given.
Towards a proof of recurrence for the Lorentz process
Towards an innovation theory of spatial Brownian motion under boundary conditions.
Towards effective dynamics in complex systems by Markov kernel approximation
Many complex systems occurring in various application share the property that the underlying Markov process remains in certain regions of the state space for long times, and that transitions between such metastable sets occur only rarely. Often the dynamics within each metastable set is of minor importance, but the transitions between these sets are crucial for the behavior and the understanding of the system. Since simulations of the original process are usually prohibitively expensive, the effective...
Traitement d'un modèle de processus à stochasticités imbriquées (dynamic inference)
Transfer-function solution of the Kalman-Bucy filtering problem
Transfert de charge dans un réseau de processeurs totalement connectés
Transfert de Charge dans un Réseau de Processeurs Totalement Connectés
In this paper, a model of the load transfer on a fully connected net is presented. Each processor can accept at most K tasks. A load difference of two tasks between two processors is a prohibited situation and when it may appear, an immediat and instantaneous transfer is decided. The performances of the system are evaluated by the following indices: the reject probability, the throughput, the mean response time, the stationary probability distribution for a processor to host i tasks. The aim of...
Transformation de Riesz pour les semi-groupes symétriques. Première partie : étude de la dimension 1
Transformation de Riesz pour les semi-groupes symétriques. Seconde partie : étude sous la condition
Transformation of gaussian measures
Transformation of Markov processes
Transformations de Riesz pour les lois gaussiennes