En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK

Probability and Statistics 509 résultats

Filtrer
Sélectionner : Tous / Aucun
Q
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
The talk concerned with the asymptotic empirical eigenvalue distribution of a non linear random matrix ensemble. More precisely we consider $M=
\frac{1}{m} YY^*$ with $Y=f(WX)$ where W and X are random rectangular matrices with i.i.d. centered entries. The function f is applied pointwise and can be seen as an activation function in (random) neural networks. We compute the asymptotic empirical distribution of this ensemble in the case where W and X have subGaussian tails and f is smooth. This extends a result of [PW17] where the case of Gaussian matrices W and X is considered. We also investigate the same questions in the multi-layer case, regarding neural network applications. [-]
The talk concerned with the asymptotic empirical eigenvalue distribution of a non linear random matrix ensemble. More precisely we consider $M=
\frac{1}{m} YY^*$ with $Y=f(WX)$ where W and X are random rectangular matrices with i.i.d. centered entries. The function f is applied pointwise and can be seen as an activation function in (random) neural networks. We compute the asymptotic empirical distribution of this ensemble in the case where W ...[+]

60B20 ; 15B52

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
Ill-posed linear inverse problems that combine knowledge of the forward measurement model with prior models arise frequently in various applications, from computational photography to medical imaging. Recent research has focused on solving these problems with score-based generative models (SGMs) that produce perceptually plausible images, especially in inpainting problems. In this study, we exploit the particular structure of the prior defined in the SGM to formulate recovery in a Bayesian framework as a Feynman–Kac model adapted from the forward diffusion model used to construct score-based diffusion. To solve this Feynman–Kac problem, we propose the use of Sequential Monte Carlo methods. The proposed algorithm, MCGdiff, is shown to be theoretically grounded and we provide numerical simulations showing that it outperforms competing baselines when dealing with ill-posed inverse problems.[-]
Ill-posed linear inverse problems that combine knowledge of the forward measurement model with prior models arise frequently in various applications, from computational photography to medical imaging. Recent research has focused on solving these problems with score-based generative models (SGMs) that produce perceptually plausible images, especially in inpainting problems. In this study, we exploit the particular structure of the prior defined ...[+]

62F15 ; 65C05 ; 65C60

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
Microparasites (virus, bactéries, protozoaires ...) et macroparasites (métazoaires : helminthes, arthropodes...) sont omniprésents dans les écosystèmes terrestres et marins. Le nombre total d'espèces parasites sur la planète est supérieur à celui des espèces libres qu'ils colonisent, temporairement ou non, au point que ces organismes interfèrent à toutes les échelles d'organisation du vivant. Les pathologies qu'ils peuvent parfois engendrer sont dépendantes de conditions particulières, soit liées à leur propre virulence, soit à un ensemble de facteurs environnementaux. Dans ce contexte, les modèles mathématiques constituent des outils précieux en épidémiologie, permettant de mieux comprendre les modalités de leur propagation dans les populations d'hôtes. Aborder les stratégies démographiques des micro ou des macroparasites implique des approches mathématiques différentes. Le développement de ces modèles ouvre des perspectives intéressantes pour décrire, analyser et même prévoir les comportements démographiques de ces systèmes couplés. En milieu marin, les macroparasites peuvent aussi poser des problèmes de santé à leurs hôtes quand les équilibres de différentes natures sont déplacés, avec ou sans l'intervention de l'homme (espace protégé, pêche, aquaculture...). En prenant l'exemple de parasites de Poissons téléostéens, l'accent sera mis sur la complexité des processus biologiques en cause, et son intégration dans des modèles mathématiques.

[-]
Microparasites (virus, bactéries, protozoaires ...) et macroparasites (métazoaires : helminthes, arthropodes...) sont omniprésents dans les écosystèmes terrestres et marins. Le nombre total d'espèces parasites sur la planète est supérieur à celui des espèces libres qu'ils colonisent, temporairement ou non, au point que ces organismes interfèrent à toutes les échelles d'organisation du vivant. Les pathologies qu'ils peuvent parfois engendrer sont ...[+]

00A06 ; 00A08 ; 92-XX

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Pseudo-Anosov braids are generic - Wiest, Bert (Auteur de la Conférence) | CIRM H

Multi angle

We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with $n\geq 3$ strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov braids in the ball of radius $l$ tends to $1$ exponentially quickly as $l$ tends to infinity. Moreover, with a similar notion of genericity, we prove that for generic pairs of elements of the braid group, the conjugacy search problem can be solved in quadratic time. The idea behind both results is that generic braids can be conjugated ''easily'' into a rigid braid.
braid groups - Garside groups - Nielsen-Thurston classification - pseudo-Anosov - conjugacy problem[-]
We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with $n\geq 3$ strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov braids in the ball of radius $l$ tends to $1$ exponentially quickly as $l$ tends to infinity. Moreover, with a similar notion of genericity, we prove that for generic pairs of elements of the braid group, the ...[+]

20F36 ; 20F10 ; 20F65

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
2y

An introduction to molecular dynamics - Stoltz, Gabriel (Auteur de la Conférence) | CIRM H

Post-edited

The aim of this two-hour lecture is to present the mathematical underpinnings of some common numerical approaches to compute average properties as predicted by statistical physics. The first part provides an overview of the most important concepts of statistical physics (in particular thermodynamic ensembles). The aim of the second part is to provide an introduction to the practical computation of averages with respect to the Boltzmann-Gibbs measure using appropriate stochastic dynamics of Langevin type. Rigorous ergodicity results as well as elements on the estimation of numerical errors are provided. The last part is devoted to the computation of transport coefficients such as the mobility or autodiffusion in fluids, relying either on integrated equilibrium correlations à la Green-Kubo, or on the linear response of nonequilibrium dynamics in their steady-states.[-]
The aim of this two-hour lecture is to present the mathematical underpinnings of some common numerical approaches to compute average properties as predicted by statistical physics. The first part provides an overview of the most important concepts of statistical physics (in particular thermodynamic ensembles). The aim of the second part is to provide an introduction to the practical computation of averages with respect to the Boltzmann-Gibbs ...[+]

82B31 ; 82B80 ; 65C30 ; 82C31 ; 82C70 ; 60H10

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
2y

Integrable probability - Lecture 1 - Corwin, Ivan (Auteur de la Conférence) | CIRM H

Post-edited

A number of probabilistic systems which can be analyzed in great detail due to certain algebraic structures behind them. These systems include certain directed polymer models, random growth process, interacting particle systems and stochastic PDEs; their analysis yields information on certain universality classes, such as the Kardar-Parisi-Zhang; and these structures include Macdonald processes and quantum integrable systems. We will provide background on this growing area of research and delve into a few of the recent developments.

Kardar-Parisi-Zhang - interacting particle systems - random growth processes - directed polymers - Markov duality - quantum integrable systems - Bethe ansatz - asymmetric simple exclusion process - stochastic partial differential equations[-]
A number of probabilistic systems which can be analyzed in great detail due to certain algebraic structures behind them. These systems include certain directed polymer models, random growth process, interacting particle systems and stochastic PDEs; their analysis yields information on certain universality classes, such as the Kardar-Parisi-Zhang; and these structures include Macdonald processes and quantum integrable systems. We will provide ...[+]

82C22 ; 82B23 ; 60H15

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
One of the important "products" of wavelet theory consists in the insight that it is often beneficial to consider sparsity in signal processing applications. In fact, wavelet compression relies on the fact that wavelet expansions of real-world signals and images are usually sparse. Compressive sensing builds on sparsity and tells us that sparse signals (expansions) can be recovered from incomplete linear measurements (samples) efficiently. This finding triggered an enormous research activity in recent years both in signal processing applications as well as their mathematical foundations. The present talk discusses connections of compressive sensing and time-frequency analysis (the sister of wavelet theory). In particular, we give on overview on recent results on compressive sensing with time-frequency structured random matrices.

Keywords: compressive sensing - time-frequency analysis - wavelets - sparsity - random matrices - $\ell_1$-minimization - radar - wireless communications[-]
One of the important "products" of wavelet theory consists in the insight that it is often beneficial to consider sparsity in signal processing applications. In fact, wavelet compression relies on the fact that wavelet expansions of real-world signals and images are usually sparse. Compressive sensing builds on sparsity and tells us that sparse signals (expansions) can be recovered from incomplete linear measurements (samples) efficiently. This ...[+]

94A20 ; 94A08 ; 42C40 ; 60B20 ; 90C25

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
2y

A non exchangeable coalescent arising in phylogenetics - Lambert, Amaury (Auteur de la Conférence) | CIRM H

Post-edited

A popular line of research in evolutionary biology is to use time-calibrated phylogenies in order to infer the underlying diversification process. This involves the use of stochastic models of ultrametric trees, i.e., trees whose tips lie at the same distance from the root. We recast some well-known models of ultrametric trees (infinite regular trees, exchangeable coalescents, coalescent point processes) in the framework of so-called comb metric spaces and give some applications of coalescent point processes to the phylogeny of bird species.

However, these models of diversification assume that species are exchangeable particles, and this always leads to the same (Yule) tree shape in distribution. Here, we propose a non-exchangeable, individual-based, point mutation model of diversification, where interspecific pairwise competition is only felt from the part of individuals belonging to younger species. As the initial (meta)population size grows to infinity, the properly rescaled dynamics of species lineages converge to a one-parameter family of coalescent trees interpolating between the caterpillar tree and the Kingman coalescent.

Keywords: ultrametric tree, inference, phylogenetic tree, phylogeny, birth-death process, population dynamics, evolution[-]
A popular line of research in evolutionary biology is to use time-calibrated phylogenies in order to infer the underlying diversification process. This involves the use of stochastic models of ultrametric trees, i.e., trees whose tips lie at the same distance from the root. We recast some well-known models of ultrametric trees (infinite regular trees, exchangeable coalescents, coalescent point processes) in the framework of so-called comb metric ...[+]

60J80 ; 60J85 ; 92D15 ; 92D25 ; 54E45 ; 54E70

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
We prove that a measure on $[-d,d]$ is the spectral measure of a factor of i.i.d. process on a vertex-transitive infinite graph if and only if it is absolutely continuous with respect to the spectral measure of the graph. Moreover, we show that the set of spectral measures of factor of i.i.d. processes and that of $\bar{d}_2$-limits of factor of i.i.d. processes are the same.

05C80 ; 60G15

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
We show that random walk on a stationary random graph with positive anchored expansion and exponential volume growth has positive speed. We also show that two families of random triangulations of the hyperbolic plane, the hyperbolic Poisson Voronoi tessellation and the hyperbolic Poisson Delaunay triangulation, have 1-skeletons with positive anchored expansion. As a consequence, we show that the simple random walks on these graphs have positive speed. We include a section of open problems and conjectures on the topics of stationary geometric random graphs and the hyperbolic Poisson Voronoi tessellation. [-]
We show that random walk on a stationary random graph with positive anchored expansion and exponential volume growth has positive speed. We also show that two families of random triangulations of the hyperbolic plane, the hyperbolic Poisson Voronoi tessellation and the hyperbolic Poisson Delaunay triangulation, have 1-skeletons with positive anchored expansion. As a consequence, we show that the simple random walks on these graphs have positive ...[+]

05C80 ; 60D05 ; 60G55

Sélection Signaler une erreur