Workshop Processus ponctuels et graphes aléatoires unimodulaires [ERC Nemo] (20-22 mars 2019)

évènement
Réalisation : 20-22/03/2019
Mise en ligne : 20 mars 2019
DOI : 10.60527/djwm-ar02
URL pérenne : https://doi.org/10.60527/djwm-ar02
  • niveau 1 niveau 2 niveau 3
  • document 1 document 2 document 3
ERC-NEMO

Descriptif

Workshop organisé du 20 au 22 mars 2019 à Inria Paris dans le cadre de l'ERC NEMO.

Vidéos

A stable marriage between order and disorder (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:43:38

A stable marriage between order and disorder (workshop ERC Nemo Processus ponctuels et graphes aléa…

Last
Günter

Stable matchings were introduced in a seminal paper by Gale and Shapley (1962) and play an important role in economics. Following closely Holroyd, Pemantle, Peres and Schramm (2009), we shall

On the notion of dimension of unimodular discrete spaces (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:51:42

On the notion of dimension of unimodular discrete spaces (workshop ERC Nemo Processus ponctuels et …

Khezeli
Ali

In this talk we will define notions of dimension for unimodular random graphs and point-stationary point processes. These notions are in spirit similar to the Minkowski dimension and the

Eternal family trees and dynamics on unimodular random graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:56:04

Eternal family trees and dynamics on unimodular random graphs (workshop ERC Nemo Processus ponctuel…

Haji Mirsadeghi
Mir Omid

This talk is centered on covariant dynamics on unimodular random graphs and random networks (marked graphs), namely maps from the set of vertices to itself which are preserved by graph or

Central Limit theorem for quasi-local statistics of point processes with fast decay of correlations (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:46:10

Central Limit theorem for quasi-local statistics of point processes with fast decay of correlations…

We shall consider Euclidean stationary point processes which have fast decay of correlations i.e., their correlation functions factorize upto an additive error decaying exponentially in the

Stein-Malliavin method for discrete alpha stable point processes (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:42:39

Stein-Malliavin method for discrete alpha stable point processes (workshop ERC Nemo Processus ponct…

Decreusefond
Laurent

The notion of discrete alpha-stable point processes generalizes to point processes the notion of stable distribution. It has been introduced and studied by Davydov, Molchanov and Zuyev a few

Subdiffusivity of random walks on random planar maps, via stationarity (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:53:50

Subdiffusivity of random walks on random planar maps, via stationarity (workshop ERC Nemo Processus…

Curien
Nicolas

Random planar maps have been the subject of numerous studies over the last years. They are instance of stationary and reversible random planar maps exhibiting a non-conventional geometry at

Absence of percolation for Poisson outdegree-one graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:52:51

Absence of percolation for Poisson outdegree-one graphs (workshop ERC Nemo Processus ponctuels et g…

Coupier
David

A Poisson outdegree-one graph is a directed graph based on a marked Poisson point process such that each vertex has only one outgoing edge. We state the absence of percolation for such graphs

Sampling cluster point processes: a review (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:59:48

Sampling cluster point processes: a review (workshop ERC Nemo Processus ponctuels et graphes aléato…

Brémaud
Pierre

The theme of this talk is the sampling of cluster and iterated cluster point processes. It is partially a review, mainly of the Brix–Kendall exact sampling method for cluster point processes and

Comments and problems regarding large graphs. (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:55:05
A notion of entropy for limits of sparse marked graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:55:55

A notion of entropy for limits of sparse marked graphs (workshop ERC Nemo Processus ponctuels et gr…

Anantharam
Venkat

Bordenave and Caputo (2014) defined a notion of entropy for probability distributions on rooted graphs with finite expected degree at the root. When such a probability distribution \rho has finite BC

On the modified Palm version (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
01:01:14

On the modified Palm version (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodula…

Thorisson
Hermann

The Palm version of a stationary random measure is an important tool in probability. It is however not well known that there are in fact two Palm versions, with related but different

Emergence of extended states at zero in the spectrum of sparse random graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:39:52

Emergence of extended states at zero in the spectrum of sparse random graphs (workshop ERC Nemo Pro…

Salez
Justin

We confirm the long-standing prediction that c=e≈2.718 is the threshold for the emergence of a non-vanishing absolutely continuous part (extended states) at zero in the limiting spectrum of the

Spectral embedding for graph classification (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:43:17

Spectral embedding for graph classification (workshop ERC Nemo Processus ponctuels et graphes aléat…

Lelarge
Marc

Learning on graphs requires a graph feature representation able to discriminate among different graphs while being amenable to fast computation. The graph isomorphism problem tells us that no

Point processes, cost and the growth of rank for locally compact groups (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:50:56

Point processes, cost and the growth of rank for locally compact groups (workshop ERC Nemo Processu…

Abert
Miklós

The cost of a vertex transitive graph is the infimum of the expected degree of an invariant random wiring of the graph. Similarly, one can define the cost of a point process on a homogeneous

Intervenants et intervenantes

France

Mathématicien. En poste au Laboratoire des signaux et systèmes, CNRS/ESE, Gif-sur-Yvette et à l'École de polytechnique, Département de mathématiques, Palaiseau (en 1984) ; Professeur titulaire à l’École Polytechnique Fédérale de Lausanne (EPFL), faculté Informatique et Communication (de 1997 à 2009) ; Enseignant-chercheur au département d’Informatique de l’École Normale Supérieure, groupe INRIA/TREC (depuis 2009-)