Page 1

Displaying 1 – 17 of 17

Showing per page

Large deviations for independent random variables – Application to Erdös-Renyi’s functional law of large numbers

Jamal Najim (2005)

ESAIM: Probability and Statistics

A Large Deviation Principle (LDP) is proved for the family 1 n 1 n 𝐟 ( x i n ) · Z i n where the deterministic probability measure 1 n 1 n δ x i n converges weakly to a probability measure R and ( Z i n ) i are d -valued independent random variables whose distribution depends on x i n and satisfies the following exponential moments condition: sup i , n 𝔼 e α * | Z i n | < + forsome 0 < α * < + . In this context, the identification of the rate function is non-trivial due to the absence of equidistribution. We rely on fine convex analysis to address this issue. Among the applications of this result, we extend...

Large deviations for independent random variables – Application to Erdös-Renyi's functional law of large numbers

Jamal Najim (2010)

ESAIM: Probability and Statistics

A Large Deviation Principle (LDP) is proved for the family 1 n 1 n 𝐟 ( x i n ) · Z i n where the deterministic probability measure 1 n 1 n δ x i n converges weakly to a probability measure R and ( Z i n ) i are d -valued independent random variables whose distribution depends on x i n and satisfies the following exponential moments condition: sup i , n 𝔼 e α * | Z i n | < + forsome 0 < α * < + . In this context, the identification of the rate function is non-trivial due to the absence of equidistribution. We rely on fine convex analysis to address this issue. Among the applications of this result,...

Long-term planning versus short-term planning in the asymptotical location problem

Alessio Brancolini, Giuseppe Buttazzo, Filippo Santambrogio, Eugene Stepanov (2009)

ESAIM: Control, Optimisation and Calculus of Variations

Given the probability measure ν over the given region Ω n , we consider the optimal location of a set Σ composed by n points in Ω in order to minimize the average distance Σ Ω dist ( x , Σ ) d ν (the classical optimal facility location problem). The paper compares two strategies to find optimal configurations: the long-term one which consists in placing all n points at once in an optimal position, and the short-term one which consists in placing the points one by one adding at each step at most one point and preserving...

Long-term planning versus short-term planning in the asymptotical location problem

Alessio Brancolini, Giuseppe Buttazzo, Filippo Santambrogio, Eugene Stepanov (2008)

ESAIM: Control, Optimisation and Calculus of Variations

Given the probability measure ν over the given region Ω n , we consider the optimal location of a set Σ composed by n points in Ω in order to minimize the average distance Σ Ω dist ( x , Σ ) d ν (the classical optimal facility location problem). The paper compares two strategies to find optimal configurations: the long-term one which consists in placing all n points at once in an optimal position, and the short-term one which consists in placing the points one by one adding at each step at most one point and preserving...

Lower bounds for Schrödinger operators in H¹(ℝ)

Ronan Pouliquen (1999)

Studia Mathematica

We prove trace inequalities of type | | u ' | | L 2 2 + j k j | u ( a j ) | 2 λ | | u | | L 2 2 where u H 1 ( ) , under suitable hypotheses on the sequences a j j and k j j , with the first sequence increasing and the second bounded.

Currently displaying 1 – 17 of 17

Page 1