• D

F Nous contacter

0

Documents  60G50 | enregistrements trouvés : 9

O

Sélection courante (0) : Tout sélectionner / Tout déselectionner

P Q

Post-edited  Martingales in self-similar growth-fragmentations and their applications Bertoin, Jean (Auteur de la Conférence) | CIRM (Editeur )

This talk is based on a work jointly with Timothy Budd (Copenhagen), Nicolas Curien (Orsay) and Igor Kortchemski (Ecole Polytechnique).
Consider a self-similar Markov process $X$ on $[0,\infty)$ which converges at infinity a.s. We interpret $X(t)$ as the size of a typical cell at time $t$, and each negative jump as a birth event. More precisely, if ${\Delta}X(s) = -y < 0$, then $s$ is the birth at time of a daughter cell with size $y$ which then evolves independently and according to the same dynamics. In turn, daughter cells give birth to granddaughter cells each time they make a negative jump, and so on.
The genealogical structure of the cell population can be described in terms of a branching random walk, and this gives rise to remarkable martingales. We analyze traces of these mar- tingales in physical time, and point at some applications for self-similar growth-fragmentation processes and for planar random maps.
This talk is based on a work jointly with Timothy Budd (Copenhagen), Nicolas Curien (Orsay) and Igor Kortchemski (Ecole Polytechnique).
Consider a self-similar Markov process $X$ on $[0,\infty)$ which converges at infinity a.s. We interpret $X(t)$ as the size of a typical cell at time $t$, and each negative jump as a birth event. More precisely, if ${\Delta}X(s) = -y < 0$, then $s$ is the birth at time of a daughter cell with size $y$ which then ...

Post-edited  Self-interacting walks and uniform spanning forests Peres, Yuval (Auteur de la Conférence) | CIRM (Editeur )

In the first half of the talk, I will survey results and open problems on transience of self-interacting martingales. In particular, I will describe joint works with S. Popov, P. Sousi, R. Eldan and F. Nazarov on the tradeoff between the ambient dimension and the number of different step distributions needed to obtain a recurrent process. In the second, unrelated, half of the talk, I will present joint work with Tom Hutchcroft, showing that the component structure of the uniform spanning forest in $\mathbb{Z}^d$ changes every dimension for $d > 8$. This sharpens an earlier result of Benjamini, Kesten, Schramm and the speaker (Annals Math 2004), where we established a phase transition every four dimensions. The proofs are based on a the connection to loop-erased random walks. In the first half of the talk, I will survey results and open problems on transience of self-interacting martingales. In particular, I will describe joint works with S. Popov, P. Sousi, R. Eldan and F. Nazarov on the tradeoff between the ambient dimension and the number of different step distributions needed to obtain a recurrent process. In the second, unrelated, half of the talk, I will present joint work with Tom Hutchcroft, showing that the ...

Multi angle  Random walk on random digraph Salez, Justin (Auteur de la Conférence) | CIRM (Editeur )

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the context of card shuffling (Aldous-Diaconis, 1986), this remarkable phenomenon is now rigorously established for many reversible chains. Here we consider the non-reversible case of random walks on sparse directed graphs, for which even the equilibrium measure is far from being understood. We work under the configuration model, allowing both the in-degrees and the out-degrees to be freely specified. We establish the cutoff phenomenon, determine its precise window and prove that the cutoff profile approaches a universal shape. We also provide a detailed description of the equilibrium measure. A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the context of card shuffling (Aldous-Diaconis, 1986), this remarkable phenomenon is now rigorously established for many reversible chains. Here we consider the non-reversible case of random walks on sparse ...

Multi angle  Tilings and non-intersecting paths beyond integrable cases Gorin, Vadim (Auteur de la Conférence) | CIRM (Editeur )

The talk is about a class of systems of 2d statistical mechanics, such as random tilings, noncolliding walks, log-gases and random matrix-type distributions. Specific members in this class are integrable, which means that available exact formulas allow delicate asymptotic analysis leading to the Gaussian Free Field, sine-process, Tracy-Widom distributions. Extending the results beyond the integrable cases is challenging. I will speak about a recent progress in this direction: about universal local limit theorems for a class of lozenge and domino tilings, noncolliding random walks; and about GFF-type asymptotic theorems for global fluctuations in these systems and in discrete beta log­gases. The talk is about a class of systems of 2d statistical mechanics, such as random tilings, noncolliding walks, log-gases and random matrix-type distributions. Specific members in this class are integrable, which means that available exact formulas allow delicate asymptotic analysis leading to the Gaussian Free Field, sine-process, Tracy-Widom distributions. Extending the results beyond the integrable cases is challenging. I will speak about a ...

Multi angle  Low temperature interfaces and level lines in the critical prewetting regime Ioffe, Dmitry (Auteur de la Conférence) | CIRM (Editeur )

Complete wetting in the context of the low temperature two-dimensional Ising model is characterized by creation of a mesoscopic size layer of the "-" phase above an active substrate. Adding a small positive magnetic field h makes "-"-phase unstable, and the layer becomes only microscopically thick. Critical prewetting corresponds to a continuous divergence of this layer as h tends to zero. There is a conjectured 1/3 (diffusive) scaling leading to Ferrari-Spohn diffusions. Rigorous results were established for polymer models of random and self-avoiding walks under vanishing area tilts.
A similar 1/3-scaling is conjectured to hold for top level lines of low temperature SOS-type interfaces in three dimensions. In the latter case, the effective local structure is that of ordered walks, again under area tilts. The conjectured scaling limits (rigorously established in the random walk context) are ordered diffusions driven by Airy Slatter determinants.
Based on joint walks with Senya Shlosman, Yvan Velenik and Vitali Wachtel.
Complete wetting in the context of the low temperature two-dimensional Ising model is characterized by creation of a mesoscopic size layer of the "-" phase above an active substrate. Adding a small positive magnetic field h makes "-"-phase unstable, and the layer becomes only microscopically thick. Critical prewetting corresponds to a continuous divergence of this layer as h tends to zero. There is a conjectured 1/3 (diffusive) scaling leading ...

Multi angle  Random walks on dynamical percolation Sousi, Perla (Auteur de la Conférence) | CIRM (Editeur )

We study the behaviour of random walk on dynamical percolation. In this model, the edges of a graph are either open or closed and refresh their status at rate $\mu$, while at the same time a random walker moves on $G$ at rate 1, but only along edges which are open. On the d-dimensional torus with side length $n$, when the bond parameter is subcritical, the mixing times for both the full system and the random walker were determined by Peres, Stauffer and Steif. I will talk about the supercritical case, which was left open, but can be analysed using evolving sets.

Joint work with Y. Peres and J. Steif.
We study the behaviour of random walk on dynamical percolation. In this model, the edges of a graph are either open or closed and refresh their status at rate $\mu$, while at the same time a random walker moves on $G$ at rate 1, but only along edges which are open. On the d-dimensional torus with side length $n$, when the bond parameter is subcritical, the mixing times for both the full system and the random walker were determined by Peres, ...

Multi angle  Introduction to hyperbolic sigma models and Edge Reinforced Random Walk Spencer, Tom (Auteur de la Conférence) | CIRM (Editeur )

This talk will introduce two statistical mechanics models on the lattice. The spins in these models have a hyperbolic symmetry. Correlations for these models can be expressed in terms of a random walk in a highly correlated random environment. In the SUSY hyperbolic case these walks are closely related to the vertex reinforced jump process and to the edge reinforced random walk. (Joint work with M. Disertori and M. Zirnbauer.)

Multi angle  Internal diffusion-limited aggregation with random starting points Kozma, Gady (Auteur de la Conférence) | CIRM (Editeur )

We consider a model for a growing subset of a euclidean lattice (an "aggregate") where at each step one choose a random point from the existing aggregate, starts a random walk from that point, and adds the point of exit to the aggregate. We show that the limiting shape is a ball. Joint work with Itai Benjamini, Hugo Duminil-Copin and Cyril Lucas.

Multi angle  The Metropolis Hastings algorithm: introduction and optimal scaling of the transient phase Jourdain, Benjamin (Auteur de la Conférence) | CIRM (Editeur )

We first introduce the Metropolis-Hastings algorithm. We then consider the Random Walk Metropolis algorithm on $R^n$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one dimensional law. It is well-known that, in the limit $n$ tends to infinity, starting at equilibrium and for an appropriate scaling of the variance and of the timescale as a function of the dimension $n$, a diffusive limit is obtained for each component of the Markov chain. We generalize this result when the initial distribution is not the target probability measure. The obtained diffusive limit is the solution to a stochastic differential equation nonlinear in the sense of McKean. We prove convergence to equilibrium for this equation. We discuss practical counterparts in order to optimize the variance of the proposal distribution to accelerate convergence to equilibrium. Our analysis confirms the interest of the constant acceptance rate strategy (with acceptance rate between 1/4 and 1/3). We first introduce the Metropolis-Hastings algorithm. We then consider the Random Walk Metropolis algorithm on $R^n$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one dimensional law. It is well-known that, in the limit $n$ tends to infinity, starting at equilibrium and for an appropriate scaling of the variance and of the timescale as a function of the dimension $n$, a diffusive limit is obtained ...

Codes MSC

Nuage de mots clefs ici

Z