Déposez votre fichier ici pour le déplacer vers cet enregistrement.

I will explain how to bound from above and below the expected Betti numbers of a random subcomplex in a simplicial complex and get asymptotic results under infinitely many barycentric subdivisions. This is a joint work with Nermin Salepci. It complements previous joint works with Damien Gayet on random topology.

52Cxx ; 60C05 ; 60B05 ; 55U10

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

A determinantal point process governed by a Hermitian contraction kernel $K$ on a measure space $E$ remains determinantal when conditioned on its configuration on a subset $B \subset E$. Moreover, the conditional kernel can be chosen canonically in a way that is "local" in a non-commutative sense, i.e. invariant under "restriction" to closed subspaces $L^2(B) \subset P \subset L^2(E)$. Using the properties of the canonical conditional kernel we establish a conjecture of Lyons and Peres: if $K$ is a projection then almost surely all functions in its image can be recovered by sampling at the points of the process.
Joint work with Alexander Bufetov and Yanqi Qiu.
A determinantal point process governed by a Hermitian contraction kernel $K$ on a measure space $E$ remains determinantal when conditioned on its configuration on a subset $B \subset E$. Moreover, the conditional kernel can be chosen canonically in a way that is "local" in a non-commutative sense, i.e. invariant under "restriction" to closed subspaces $L^2(B) \subset P \subset L^2(E)$. Using the properties of the canonical conditional kernel ...

60G55 ; 60C05

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

In this talk I will review the recent developments on weighted distances in scale free random graphs as well as highlight key techniques used in the proofs. We consider graph models where the degree distribution follows a power-law such that the empirical variance of the degrees is infinite, such as the configuration model, geometric inhomogeneous random graphs, or scale free percolation. Once the graph is created according to the model definition, we assign i.i.d. positive edge weights to existing edges, and we are interested in the proper scaling and asymptotic distribution of weighted distances.
In the infinite variance degree regime, a dichotomy can be observed in all these graph models: the edge weight distributions form two classes, explosive vs conservative weight distributions. When a distribution falls into the explosive class, typical distances converge in distribution to proper random variables. While, when a distribution falls into the conservative class, distances tend to infinity with the model size, according to a formula that captures the doubly-logarithmic graph distances as well as the precise behaviour of the distribution of edge-weights around the origin. An integrability condition decides into which class a given distribution falls.
This is joint work with Adriaans, Baroni, van der Hofstad, and Lodewijks.
In this talk I will review the recent developments on weighted distances in scale free random graphs as well as highlight key techniques used in the proofs. We consider graph models where the degree distribution follows a power-law such that the empirical variance of the degrees is infinite, such as the configuration model, geometric inhomogeneous random graphs, or scale free percolation. Once the graph is created according to the model ...

05C80 ; 90B15 ; 60C05 ; 60D05

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

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

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

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 ...

60C05 ; 60G50 ; 52C20

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

L'objectif de ce mini-cours est de présenter de la façon la plus élémentaire possible la convergence faible locale des graphes introduite par Benjamini et Schramm en 2001 et développée par Aldous et Steele (2004), Aldous et Lyons (2007). Nous montrerons comment cette notion peut être utilisée dans des dénombrements asymptotiques et dans des problèmes d'optimisation combinatoire.

05C80 ; 60C05

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

L’objectif de ce mini-cours est de présenter de la façon la plus élémentaire possible la convergence faible locale des graphes introduite par Benjamini et Schramm en 2001 et développée par Aldous et Steele (2004), Aldous et Lyons (2007). Nous montrerons comment cette notion peut être utilisée dans des dénombrements asymptotiques et dans des problèmes d’optimisation combinatoire.

05C80 ; 60C05

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Multi angle  Recurrence of half plane maps
Angel, Omer (Auteur de la Conférence) | CIRM (Editeur )

On a graph $G$, we consider the bootstrap model: some vertices are infected and any vertex with 2 infected vertices becomes infected. We identify the location of the threshold for the event that the Erdos-Renyi graph $G(n, p)$ can be fully infected by a seed of only two infected vertices. Joint work with Brett Kolesnik.

05C80 ; 60K35 ; 60C05

Filtrer

Type
Domaine
Codes MSC

Z