Recherches sur la polarisation rotatoire magnétique dans le spath d'Islande
Les surdoués
Sur la propriété de Branchement
Arbres et processus de Bellman-Harris
Limit distributions for multitype branching processes of -ary search trees
Let be an integer. The so-calledis a discrete time Markov chain which is very popular in theoretical computer science, modelling famous algorithms used in searching and sorting. This random process satisfies a well-known phase transition: when , the asymptotic behavior of the process is Gaussian, but for it is no longer Gaussian and a limit of a complex-valued martingale arises. In this paper, we consider the multitype branching process which is the continuous time version of the -ary search...
Martingales and profile of binary search trees.
Digital search trees and chaos game representation
In this paper, we consider a possible representation of a DNA sequence in a quaternary tree, in which one can visualize repetitions of subwords (seen as suffixes of subsequences). The CGR-tree turns a sequence of letters into a Digital Search Tree (DST), obtained from the suffixes of the reversed sequence. Several results are known concerning the height, the insertion depth for DST built from independent successive random sequences having the same distribution. Here the successive inserted words...
Stochastic Lagrangian method for downscaling problems in computational fluid dynamics
This work aims at introducing modelling, theoretical and numerical studies related to a new downscaling technique applied to computational fluid dynamics. Our method consists in building a local model, forced by large scale information computed thanks to a classical numerical weather predictor. The local model, compatible with the Navier-Stokes equations, is used for the small scale computation (downscaling) of the considered fluid. It is inspired by Pope's works on turbulence, and consists in...
Page 1