Displaying similar documents to “Uniqueness of invariant product measures for elliptic infinite dimensional diffusions and particle spin systems”

Méthodes géométriques et analytiques pour étudier l'application exponentielle, la sphère et le front d'onde en géométrie sous-riemannienne dans le cas Martinet

Bernard Bonnard, Monique Chyba (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

Consider a sub-riemannian geometry (U,D,g) where U is a neighborhood of 0 in R 3, D is a Martinet type distribution identified to ker ω, ω being the 1-form: ω = d z - y 2 2 d x , q=(x,y,z) and g is a metric on D which can be taken in the normal form:...

About the decision of reachability for register machines

Véronique Cortier (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We study the decidability of the following problem: given  affine functions ƒ,...,ƒ over ℕ k and two vectors v 1 , v 2 ∈ ℕ k , is reachable from by successive iterations of ƒ,...,ƒ (in this given order)? We show that this question is decidable for and undecidable for some fixed .

Minimax nonparametric hypothesis testing for ellipsoids and Besov bodies

Yuri I. Ingster, Irina A. Suslina (2010)

ESAIM: Probability and Statistics

Similarity:

We observe an infinitely dimensional Gaussian random vector where is a sequence of standard Gaussian variables and is an unknown mean. We consider the hypothesis testing problem alternatives H ε , τ : v ∈ V ε for the sets V ε = V ε ( τ , ρ ε ) ⊂ l 2 . The sets are -ellipsoids of semi-axes with -ellipsoid of semi-axes removed or similar Besov bodies with Besov bodies removed. Here τ = ( κ , R ) or τ = ( κ , h , t , R ) ; κ = ( p , q , r , s ) are the parameters which define the sets for given radii , 0 < ; is the asymptotical...

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

A vertex of a graph = () is said to be by M ⊆ V if the majority of the elements of the neighborhood of  (including itself) belong to . The set is a in if every vertex i ∈ V is controlled by . Given a set M ⊆ V and two graphs = ( V , E 1 ) and = ( V , E 2 ) where E 1 ⊆ E 2 , the consists of deciding whether there exists a sandwich graph = () (, a graph where E 1 ⊆ E ⊆ E 2 ) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich...

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

A vertex of a graph = () is said to be by M ⊆ V if the majority of the elements of the neighborhood of  (including itself) belong to . The set is a in if every vertex i ∈ V is controlled by . Given a set M ⊆ V and two graphs = ( V , E 1 ) and = ( V , E 2 ) where E 1 ⊆ E 2 , the consists of deciding whether there exists a sandwich graph = () (, a graph where E 1 ⊆ E ⊆ E 2 ) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich...