<?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>50433</entry>
</identifier>
<title><string language="fre"><![CDATA[A notion of entropy for limits of sparse marked graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)]]></string></title>
<language>ENG</language>
<description>
<string language="fre"><![CDATA[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 entropy Sigma(rho), the growth in the number of vertices n of the number of graphs on n vertices whose associated rooted graph distribution is close to rho is as d/2 n log n + Sigma(rho) n + o(n), where d is expected degree of the root under rho. We develop the parallel result for probability distributions on marked rooted graphs. Our graphs have vertex marks drawn from a finite set and directed edge marks, one towards each vertex, drawn from a finite set. The talk will focus on presenting an overview of the technical details of this extension We are motivated by the interpretation of a discrete time stochastic process taking values in a finite set Theta as the local weak limit of long strings of symbols from Theta. We argue that probability distributions on marked rooted graphs are the natural analogs of stochastic process models for *graphical data*, by which we mean data indexed by the vertices and edges of a sparse graph rather than by linearly ordered time. Our extension of the BC entropy can then be argued to be the natural extension, in the world of graphical data, of the Shannon entropy rate in the world of time series. We illustrate this viewpoint by proving a lossless data compression theorem analogous to the basic lossless data compression theorem for time series. Joint work with Payam Delgosha.]]></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:17
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:17
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:17
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:17
FN:Venkat Anantharam
N:Anantharam;Venkat;;;
URL;TYPE=work:https://www2.eecs.berkeley.edu/Faculty/Homepages/anantharam.html
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/a_notion_of_entropy_for_limits_of_sparse_marked_graphs_workshop_erc_nemo_processus_ponctuels_et_graphes_aleatoires_unimodulaires.50433]]></location>
<location><![CDATA[https://streaming-canal-u.fmsh.fr/vod/media/canalu/videos/fuscia/a.notion.of.entropy.for.limits.of.sparse.marked.graphs.workshop.erc.nemo.processus.ponctuels.et.graphes.aleatoires.unimodulaires._50433/11.anantharam.mp4]]></location>
<size>975667623</size>
<duration><duration>PT0H55M56S</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>