Notice
Absence of percolation for Poisson outdegree-one graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
- document 1 document 2 document 3
- niveau 1 niveau 2 niveau 3
Descriptif
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 satisfying two assumptions. The Shield assumption roughly says that the graph is locally determined with possible random horizons. The Loop assumption ensures that any forward branch merges on a loop provided that the Poisson point process is augmented with a finite collection of well-chosen points. This result allows to solve a conjecture by D. Daley, S. Ebert and G. Last on the absence of percolation for the “line-segment model”. In this planar model, a segment is growing from any point of the Poisson process and stops its growth whenever it hits another segment. The random directions are picked independently and uniformly on the unit sphere. This is a joint work with D. Dereudre and S. Le Stum.
Thème
Documentation
Documents pédagogiques
Dans la même collection
-
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
-
-
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
-
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.
-
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
-
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
-
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
-
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
-
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
-
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
-
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
