Notice
A stable marriage between order and disorder (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
- document 1 document 2 document 3
- niveau 1 niveau 2 niveau 3
Descriptif
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 first discuss a few basic properties of stable matchings between two discrete point sets (resp. point processes) in Euclidean space, where the points prefer to be close to each other. For comparison we also discuss stable transports from Lebesgue measure to point processes. In the second part of the talk we consider a stable matching between the cubic lattice and a stationary Poisson process (or a determinantal point process) with higher intensity. The matched points form a stationary and ergodic (under lattice shifts) point process with unit intensity that has many remarkable properties. If the intensity of the Poisson process is close to one, then it very much resembles a Poisson process, while for large intensities it approaches the lattice. Moreover, the matched points form a hyperuniform and number rigid point process, in sharp contrast to a Poisson process. Still the pair correlation decays exponentially fast. The talk is based on joint work with M. Klatt and D. Yogeshwaran.
Intervention
Thème
Documentation
Documents pédagogiques
Dans la même collection
-
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
-
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
-
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
-
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
-
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
-
-
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
-
Strict monotonicity of percolation thresholds under covering maps (workshop ERC Nemo Processus ponc…
MARTINEAU Sébastien
Percolation is a model for propagation in porous media that as introduced in 1957 by Broadbent and Hammersley. An infinite graph G models the geometry of the situation and a parameter p
-
Comments and problems regarding large graphs. (workshop ERC Nemo Processus ponctuels et graphes alé…
BENJAMINI Itai
We will discuss a couple of results and questions regarding the structure of large graphs. These include vertex transitive graphs, expanders and random graphs.
-
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
-
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
-
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