Canal-U

Mon compte

Résultats de recherche

Nombre de programmes trouvés : 249
Conférences

le (1h1m15s)

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

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 interpretations. For lack of better terms, call the well known version standard and the less known version modified. In this talk we shall focus on the modified Palm version and its interpretation. The concepts of shift-coupling and mass-stationarity will play a key role
Voir la vidéo
Conférences

le (59m49s)

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

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 its adaptation by Moller and Rasmussen to Hawkes branching point processes on the real line with light-tail fertility rate. A formal proof via Laplace transforms of the validity of the method in terms of general clusters that are not necessarily point processes fits this purpose and allows to include the exact sampling of Boolean ...
Voir la vidéo
Conférences

le (52m52s)

Absence of percolation for Poisson outdegree-one graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)

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 ...
Voir la vidéo
Conférences

le (56m5s)

Eternal family trees and dynamics on unimodular random graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)

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 network isomorphisms. Such dynamics are referred to as vertex-shifts here. These dynamics have point-shifts on point processes as a subclass. First we give a classification of vertex-shifts on unimodular random networks. Each such vertex-shift partitions the vertices into a collection of connected components and foils. The latter are discrete analogues the stable manifold ...
Voir la vidéo
Conférences

le (51m43s)

On the notion of dimension of unimodular discrete spaces (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)

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 Hausdorff dimension. The key point in the definitions is the use of the mass transport principle which is used indispensably and distinguishes this view point from the previous notions which are defined in the literature. The connections of these definitions to volume growth and other notions of dimension are also discussed, which provide a toolset ...
Voir la vidéo

 
FMSH
 
Facebook Twitter Google+
Mon Compte