Lectures on Logarithmic Sobolev Inequalities
Level set structure of an integrable cellular automaton.
Limit laws for the energy of a charged polymer
In this paper we obtain the central limit theorems, moderate deviations and the laws of the iterated logarithm for the energy Hn=∑1≤j<k≤nωjωk1{Sj=Sk} of the polymer {S1, …, Sn} equipped with random electrical charges {ω1, …, ωn}. Our approach is based on comparison of the moments between Hn and the self-intersection local time Qn=∑1≤j<k≤n1{Sj=Sk} run by the d-dimensional random walk {Sk}. As partially needed for our main objective and partially motivated by their independent interest,...
Limit shapes of Gibbs distributions on the set of integer partitions : the expansive case
We find limit shapes for a family of multiplicative measures on the set of partitions, induced by exponential generating functions with expansive parameters, ak∼Ckp−1, k→∞, p>0, where C is a positive constant. The measures considered are associated with the generalized Maxwell–Boltzmann models in statistical mechanics, reversible coagulation–fragmentation processes and combinatorial structures, known as assemblies. We prove a central limit theorem for fluctuations of a properly scaled partition...
Limit theorems for randomly coarse grained continuous-time random walks [Book]
Limit theorems for the painting of graphs by clusters
We consider a generalization of the so-called divide and color model recently introduced by Häggström. We investigate the behavior of the magnetization in large boxes of the lattice and its fluctuations. Thus, Laws of Large Numbers and Central Limit Theorems are proved, both quenched and annealed. We show that the properties of the underlying percolation process deeply influence the behavior of the coloring model. In the subcritical case, the limit magnetization is deterministic and the Central...
Limit Theorems for the painting of graphs by clusters
We consider a generalization of the so-called divide and color model recently introduced by Häggström. We investigate the behavior of the magnetization in large boxes of the lattice and its fluctuations. Thus, Laws of Large Numbers and Central Limit Theorems are proved, both quenched and annealed. We show that the properties of the underlying percolation process deeply influence the behavior of the coloring model. In the subcritical case, the limit magnetization is deterministic and the Central Limit...
Limites hydrodynamiques
Limites hydrodynamiques de l'équation de Boltzmann
Limites réversibles et irréversibles de systèmes de particules.
Il s’agit de comparer les différents résultats et théorèmes concernant dans un cadre essentiellement déterministe des systèmes de particules. Cela conduit à étudier la notion de hiérarchies d’équations et à comparer les modèles non linéaires et linéaires. Dans ce dernier cas on met en évidence le rôle de l’aléatoire. Ce texte réfère à une série de travaux en collaboration avec F. Golse, A. Gottlieb, D. Levermore et N. Mauser.
Limits of determinantal processes near a tacnode
We study a Markov process on a system of interlacing particles. At large times the particles fill a domain that depends on a parameter ε > 0. The domain has two cusps, one pointing up and one pointing down. In the limit ε ↓ 0 the cusps touch, thus forming a tacnode. The main result of the paper is a derivation of the local correlation kernel around the tacnode in the transition regime ε ↓ 0. We also prove that the local process interpolates between the Pearcey process and the GUE minor process....
Limits of Gaudin systems: classical and quantum cases.
Linear convergence in the approximation of rank-one convex envelopes
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope of a given function , i.e. the largest function below which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.
Linear convergence in the approximation of rank-one convex envelopes
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope of a given function , i.e. the largest function below f which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.
Linear speed large deviations for percolation clusters.
Line-energy Ginzburg-Landau models : zero-energy states
We consider a class of two-dimensional Ginzburg-Landau problems which are characterized by energy density concentrations on a one-dimensional set. In this paper, we investigate the states of vanishing energy. We classify these zero-energy states in the whole space: They are either constant or a vortex. A bounded domain can sustain a zero-energy state only if the domain is a disk and the state a vortex. Our proof is based on specific entropies which lead to a kinetic formulation, and on a careful...
Lipschitz percolation.
Local bootstrap percolation.
Local energy statistics in directed polymers.
Local minimizers with vortex filaments for a Gross-Pitaevsky functional
This paper gives a rigorous derivation of a functional proposed by Aftalion and Rivière [Phys. Rev. A64 (2001) 043611] to characterize the energy of vortex filaments in a rotationally forced Bose-Einstein condensate. This functional is derived as a Γ-limit of scaled versions of the Gross-Pitaevsky functional for the wave function of such a condensate. In most situations, the vortex filament energy functional is either unbounded below or has only trivial minimizers, but we establish the existence...