We construct (modified) scattering operators for the Vlasov–Poisson system in three dimensions, mapping small asymptotic dynamics as t→−∞ to asymptotic dynamics as t→+∞. The main novelty is the construction of modified wave operators, but we also obtain a ...
We consider several aspects of conjugating symmetry methods, including the method of invariants, with an asymptotic approach. In particular we consider how to extend to the stochastic setting several ideas which are well established in the deterministic on ...
We study the asymptotic behavior of the N-clock model, a nearest neighbors ferromagnetic spin model on the d-dimensional cubic epsilon-lattice in which the spin field is constrained to take values in a discretization S-N of the unit circle S-1 consisting o ...
We consider various versions of the obstacle and thin-obstacle problems, we interpret them as variational inequalities, with non-smooth constraint, and prove that they satisfy a new constrained Lojasiewicz inequality. The difficulty lies in the fact that, ...
We study in this thesis the asymptotic behavior of optimal paths on a random graph model, the configuration model, for which we assign continuous random positive weights on its edges.
We start by describing the asymptotic behavior of the diameter and the f ...
We perform a general optimization of the parameters in the multilevel Monte Carlo (MLMC) discretization hierarchy based on uniform discretization methods with general approximation orders and computational costs. We optimize hierarchies with geometric and ...
This paper is devoted to the study of the behavior of the unique solution u delta is an element of H-0(1)(Omega), as delta -> 0, to the equation div(s(delta)A del u(delta)) + k(2)s(0)Sigma u(delta) = s0 f in Omega, where Omega is a smooth connected bounded ...
We revisit the problem of finding the probability distribution of a fermionic number of one-dimensional spinless free fermions on a segment of a given length. The generating function for this probability distribution can be expressed as a determinant of a ...
Navigability of networks, that is, the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small world networks provided that a ...
This thesis is a small part of the preparation of the launch of the Gaia mission, a satellite of the European Space Agency (ESA). One of the goals of the mission is to perform a classification among variable stars considering different attributes. Periodic ...
