<?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>50425</entry>
</identifier>
<title><string language="fre"><![CDATA[Strict monotonicity of percolation thresholds under covering maps (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)]]></string></title>
<language>ENG</language>
<description>
<string language="fre"><![CDATA[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 embodies its porosity: percolation consists in keeping independently 
each edge with probability p, erasing it otherwise, and looking at the 
infinite connected components of the resulting graph. It turns out that 
there is a critical porosity: for smaller porosities, all components are
finite almost surely, while for larger ones, there is almost surely at 
least one infinite component. How does this critical porosity depend on 
the underlying graph? This is a broad question, that also has 
connections with the behaviour at the critical point. In this talk, we 
will consider this question in the following perspective: we will prove 
that, under reasonable conditions, quotienting a graph strictly 
increases it critical porosity. This is joint work with Franco Severo.]]></string></description>
<keyword><string language="fre"><![CDATA[processus ponctuels]]></string></keyword><keyword><string language="fre"><![CDATA[graphes aléatoires]]></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:38:37
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:38:37
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:38:37
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:38:37
FN:Sébastien Martineau
N:Martineau;Sébastien;;;
URL;TYPE=work:http://perso.ens-lyon.fr/sebastien.martineau/
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/strict_monotonicity_of_percolation_thresholds_under_covering_maps_workshop_erc_nemo_processus_ponctuels_et_graphes_aleatoires_unimodulaires.50425]]></location>
<location><![CDATA[https://streaming-canal-u.fmsh.fr/vod/media/canalu/videos/fuscia/strict.monotonicity.of.percolation.thresholds.under.covering.maps.workshop.erc.nemo.processus.ponctuels.et.graphes.aleatoires.unimodulaires._50425/4.martineau_h264.mp4]]></location>
<size>4653510285</size>
<duration><duration>PT0H50M47S</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>511.5</id>
<entry>
<string language="fre"><![CDATA[Théorie des graphes. Construction des graphes]]></string>
</entry>
</taxon>
</taxonPath>
</classification> </lom>