#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2012

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Emmanuel Boissard, Pierre Degond, Sebastien Motsch
- Journal of mathematical biology
- 2013

We propose an Individual-Based Model of ant-trail formation. The ants are modeled as self-propelled particles which deposit directed pheromone particles and interact with them through alignment interaction. The directed pheromone particles intend to model pieces of trails, while the alignment interaction translates the tendency for an ant to follow a trail… (More)

In this paper we tackle the problem of comparing distributions of random variables and defining a mean pattern between a sample of random events. Using barycenters of measures in the Wasserstein space, we propose an iterative version as an estimation of the mean distribution. Moreover, when the distributions are a common measure warped by a centered random… (More)

In this work, we provide non-asymptotic bounds for the average speed of convergence of the empirical measure in the law of large numbers, in Wasserstein distance. We also consider occupation measures of ergodic Markov chains. One motivation is the approximation of a probability measure by nitely supported measures (the quantization problem). It is found… (More)

In this paper we study the Poincaré constant for the Gaussian measure restricted to D = R − B(y, r) where B(y, r) denotes the Euclidean ball with center y and radius r, and d ≥ 2. We also study the case of the l ball (the hypercube). This is the first step in the study of the asymptotic behavior of a d-dimensional Ornstein-Uhlenbeck process in the presence… (More)

- Emmanuel Boissard, Serge Cohen, Thibault Espinasse, James Norris
- Random Struct. Algorithms
- 2015

We consider a random walk ( Z (1) n , · · · , Z n ) ∈ Z with the constraint that each coordinate of the walk is at distance one from the following one. In this paper, we show that this random walk is slowed down by a variance factor σ K = 2 K+2 with respect to the case of the classical simple random walk without constraint.

- ‹
- 1
- ›