<?xml version="1.0" encoding="UTF-8"?><lom xmlns="http://ltsc.ieee.org/xsd/LOM" xmlns:lomfr="http://www.lom-fr.fr/xsd/LOMFR" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://ltsc.ieee.org/xsd/LOM http://www.lom-fr.fr/xsd/lomfrv1.0/std/lomfr.xsd">
<general>
<identifier>
<catalog>Canal-U_Ocms</catalog>
<entry>50437</entry>
</identifier>
<title><string language="fre"><![CDATA[Sampling cluster point processes: a review (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)]]></string></title>
<language>ENG</language>
<description>
<string language="fre"><![CDATA[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 models.
The main novel aspect of this review is the extension of the above 
sampling methods to non-Poissonian germ point processes.]]></string></description>
<keyword><string language="fre"><![CDATA[processus ponctuels]]></string></keyword><keyword><string language="fre"><![CDATA[graphes aléatoires]]></string></keyword><keyword><string language="fre"><![CDATA[dynamique des réseaux stochastiques]]></string></keyword><keyword><string language="fre"><![CDATA[modélisation réseau]]></string></keyword>
<lomfr:documentType>
<lomfr:source>LOMFRv1.0</lomfr:source>
<lomfr:value>image en mouvement</lomfr:value>
</lomfr:documentType>
</general><lifeCycle>
<contribute>
<role>
<source>LOMv1.0</source>
<value>content provider</value>
</role>
<entity><![CDATA[BEGIN:VCARD
VERSION:3.0
CLASS:PUBLIC
REV:2021-09-16 17:36:13
FN:INRIA (Institut national de recherche en informatique et automatique)
N:INRIA (Institut national de recherche en informatique et automatique);;;;
URL;TYPE=work:http://www.inria.fr/
ROLE:content provider
TZ:+0200
END:VCARD
]]></entity>
<date><dateTime>2019-03-20</dateTime></date>
</contribute>
<contribute>
<role>
<source>LOMv1.0</source>
<value>publisher</value>
</role>
<entity><![CDATA[BEGIN:VCARD
VERSION:3.0
CLASS:PUBLIC
REV:2021-09-16 17:36:13
FN:INRIA (Institut national de recherche en informatique et automatique)
N:INRIA (Institut national de recherche en informatique et automatique);;;;
URL;TYPE=work:http://www.inria.fr/
ROLE:publisher
TZ:+0200
END:VCARD
]]></entity>
<date><dateTime>2019-03-20</dateTime></date>
</contribute>
<contribute>
<role>
<source>LOMv1.0</source>
<value>content provider</value>
</role>
<entity><![CDATA[BEGIN:VCARD
VERSION:3.0
CLASS:PUBLIC
REV:2021-09-16 17:36:13
FN:François Baccelli
N:Baccelli;François;;;
URL;TYPE=work:https://www.di.ens.fr/baccelli/
ROLE:content provider
TZ:+0200
END:VCARD
]]></entity>
<date><dateTime>2019-03-20</dateTime></date>
</contribute>
<contribute>
<role>
<source>LOMv1.0</source>
<value>author</value>
</role>
<entity><![CDATA[BEGIN:VCARD
VERSION:3.0
CLASS:PUBLIC
REV:2021-09-16 17:36:13
FN:Pierre Brémaud
N:Brémaud;Pierre;;;
URL;TYPE=work:https://people.epfl.ch/pierre.bremaud/bio?lang=fr&cvlang=fr
ROLE:author
TZ:+0200
END:VCARD
]]></entity>
<date><dateTime>2019-03-20</dateTime></date>
</contribute>
</lifeCycle>
<metaMetadata>
<metadataSchema>LOMv1.0</metadataSchema>
<metadataSchema>LOMFRv1.0</metadataSchema>
</metaMetadata>
<technical>
<format>video/mp4</format>
<location><![CDATA[https://www.canal-u.tv/video/inria/sampling_cluster_point_processes_a_review_workshop_erc_nemo_processus_ponctuels_et_graphes_aleatoires_unimodulaires.50437]]></location>
<location><![CDATA[https://streaming-canal-u.fmsh.fr/vod/media/canalu/videos/fuscia/sampling.cluster.point.processes.a.review.workshop.erc.nemo.processus.ponctuels.et.graphes.aleatoires.unimodulaires._50437/9.bremaud_h264.mp4]]></location>
<size>3527739122</size>
<duration><duration>PT0H59M49S</duration></duration>
</technical>
<educational>
<learningResourceType>
<source>LOMv1.0</source>
<value>lecture</value>
</learningResourceType>
<context>
<source>LOMv1.0</source>
<value>doctorat</value>
</context>
</educational>
<rights>
<cost>
<source>LOMv1.0</source>
<value>no</value>
</cost>
<copyrightAndOtherRestrictions>
<source>LOMv1.0</source>
<value>no</value>
</copyrightAndOtherRestrictions>
<description>
<string language="fre"><![CDATA[Droits réservés à l'éditeur et aux auteurs. 
]]></string>
</description>
</rights>
<relation>
<kind>
<source>LOMv1.0</source>
<value>ispartof</value>
</kind>
<resource>
<identifier>
<catalog>URI</catalog>
<entry>https://www.canal-u.tv/producteurs/inria/erc_nemo</entry>
</identifier>
<description>
<string language="fre"><![CDATA[ERC Nemo]]></string>
</description>
</resource>
</relation>
<relation>
<kind>
<source>LOMv1.0</source>
<value>ispartof</value>
</kind>
<resource>
<identifier>
<catalog>URI</catalog>
<entry>https://www.canal-u.tv/producteurs/inria/erc_nemo/workshop_processus_ponctuels_et_graphes_aleatoires_unimodulaires_20_22_mars_2019</entry>
</identifier>
<description>
<string language="fre"><![CDATA[Workshop Processus ponctuels et graphes aléatoires unimodulaires (20-22 mars 2019)]]></string>
</description>
</resource>
</relation>
<classification>
<purpose>
<source>LOMv1.0</source>
<value>discipline</value>
</purpose>
<taxonPath>
<source>
<string language="fre"><![CDATA[Universités Numériques Thématiques 2009 http://www.universites-numeriques.fr]]></string>
</source>
<taxon>
<id/>
<entry>
<string language="fre"/>
</entry>
</taxon>
</taxonPath>
</classification>
<classification>
<purpose>
<source>LOMv1.0</source>
<value>discipline</value>
</purpose>
<taxonPath>
<source>
<string language="fre">CDD 22e éd.</string>
<string language="eng">DDC 22nd ed.</string>
</source>
<taxon>
<id>519</id>
<entry>
<string language="fre"><![CDATA[Probabilités, Statistiques mathématiques, Mathématiques appliquées]]></string>
</entry>
</taxon>
</taxonPath>
</classification> </lom>