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

Documents 60K35 41 results

Filter
Select: All / None
Q
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
I will discuss a model of interacting particles in continuous space which is reversible with respect to Poisson point measures with constant density. Similar discrete models are known to ”homogenize”, in the sense that the evolution of the particle density can be approximated by the solution to a partial differential equation over large scales. The goal of the talk is to present some results that make this approximation quantitative.
Based on joint works with Arianna Giunti, Chenlin Gu and Maximilian Nitzschner.[-]
I will discuss a model of interacting particles in continuous space which is reversible with respect to Poisson point measures with constant density. Similar discrete models are known to ”homogenize”, in the sense that the evolution of the particle density can be approximated by the solution to a partial differential equation over large scales. The goal of the talk is to present some results that make this approximation quantitative.
Based on ...[+]

82C22 ; 35B27 ; 60K35

Bookmarks Report an error
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
Consider two ancestral lineages sampled from a system of two-dimensional branching random walks with logistic regulation in the stationary regime. We study the asymptotics of their coalescence time for large initial separation and find that it agrees with well known results for a suitably scaled two-dimensional stepping stone model and also with Malécot's continuous-space approximation for the probability of identity by descent as a function of sampling distance.
This can be viewed as a justification for the replacement of locally fluctuating population sizes by fixed effective sizes. Our main tool is a joint regeneration construction for the spatial embeddings of the two ancestral lineages.[-]
Consider two ancestral lineages sampled from a system of two-dimensional branching random walks with logistic regulation in the stationary regime. We study the asymptotics of their coalescence time for large initial separation and find that it agrees with well known results for a suitably scaled two-dimensional stepping stone model and also with Malécot's continuous-space approximation for the probability of identity by descent as a function of ...[+]

60K35 ; 92D25 ; 92D10 ; 60F05

Bookmarks Report an error
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
The $O(n)$ model can be formulated in terms of loops living on the lattice, with n the fugacity per loop. In two dimensions, it is known to possess a rich critical behavior, involving critical exponents varying continuously with n. In this talk, we will consider the case where the model is ”coupled to 2D quantum gravity”, namely it is defined on a random map.
It has been known since the 90's that the partition function of the model can be expressed as a matrix integral, which can be evaluated exactly in the planar limit. A few years ago, together with G. Borot and E. Guitter, we revisited the problem by a combinatorial approach, which allows to relate it to the so-called Boltzmann random maps, which have no loops but faces of arbitrary (and controlled) face degrees. In particular we established that the critical points of the $O(n)$ model are closely related to the ”stable maps” introduced by Le Gall and Miermont.
After reviewing these results, I will move on to a more recent work done in collaboration with G. Borot and B. Duplantier, where we study the nesting statistics of loops. More precisely we consider loop configurations with two marked points and study the distribution of the number of loops separating them. The associated generating function can be computed exactly and, by taking asymptotics, we show that the number of separating loops grows logarithmically with the size of the maps at a (non generic) critical point, with an explicit large deviation function. Using a continuous generalization of the KPZ relation, our results are in full agreement with those of Miller, Watson and Wilson concerning nestings in Conformal Loop Ensembles.[-]
The $O(n)$ model can be formulated in terms of loops living on the lattice, with n the fugacity per loop. In two dimensions, it is known to possess a rich critical behavior, involving critical exponents varying continuously with n. In this talk, we will consider the case where the model is ”coupled to 2D quantum gravity”, namely it is defined on a random map.
It has been known since the 90's that the partition function of the model can be ...[+]

05Axx ; 60K35 ; 81T40

Bookmarks Report an error
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
The two-periodic Aztec diamond is a dimer or random tiling model with three phases, solid, liquid and gas. The dimers form a determinantal point process with a somewhat complicated but explicit correlation kernel. I will discuss in some detail how the Airy point process can be found at the liquid-gas boundary by looking at suitable averages of height function differences. The argument is a rather complicated analysis using the cumulant approach and subtle cancellations. Joint work with Vincent Beffara and Sunil Chhita.[-]
The two-periodic Aztec diamond is a dimer or random tiling model with three phases, solid, liquid and gas. The dimers form a determinantal point process with a somewhat complicated but explicit correlation kernel. I will discuss in some detail how the Airy point process can be found at the liquid-gas boundary by looking at suitable averages of height function differences. The argument is a rather complicated analysis using the cumulant approach ...[+]

60K35 ; 60G55 ; 60C05 ; 82B20 ; 05B45

Bookmarks Report an error
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
Bookmarks Report an error
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Random walks on dynamical percolation - Sousi, Perla (Author of the conference) | CIRM H

Multi angle

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, ...[+]

60K35 ; 60J10 ; 60G50 ; 82B43

Bookmarks Report an error
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
2y

Self-interacting walks and uniform spanning forests - Peres, Yuval (Author of the conference) | CIRM H

Post-edited

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 ...[+]

05C05 ; 05C80 ; 60G50 ; 60J10 ; 60K35 ; 82B43

Bookmarks Report an error
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
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.)

60K37 ; 60G50 ; 60K35 ; 60J75 ; 81T25 ; 81T60

Bookmarks Report an error
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
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.

60G50 ; 60J60 ; 60K35

Bookmarks Report an error
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
2y

Bootstrap percolation on Erdos-Renyi graphs - Angel, Omer (Author of the conference) | CIRM H

Post-edited

We consider bootstrap percolation on the Erdos-Renyi graph: given an initial infected set, a vertex becomes infected if it has at least $r$ infected neighbours. The graph is susceptible if there exists an initial set of size $r$ that infects the whole graph. We identify the critical threshold for susceptibility. We also analyse Bollobas's related graph-bootstrap percolation model.
Joint with Brett Kolesnik.

05C80 ; 60K35 ; 60J85 ; 82B26 ; 82B43

Bookmarks Report an error