English
Typicality and entropy of processes on infinite trees
Multi angle
Auteurs : Backhausz, Agnes (Auteur de la conférence)
CIRM (Editeur )
05C80 - Random graphs
28D20 - Entropy and other invariants
37A35 - Entropy and other invariants, isomorphism, classification
CIRM (Editeur )
Loading the player...
|
Résumé :
We consider a special family of invariant random processes on the infinite d-regular tree, which is closely related to random d-regular graphs, and helps understanding the structure of these finite objects. By using different notions of entropy and finding inequalities between these quantities, we present a sufficient condition for a process to be typical, that is, to be the weak local limit of functions on the vertices of a randomly chosen d-regular graph (with fixed d, and the number of vertices tending to infinity). Our results are based on invariant couplings of the process with another copy of itself. The arguments can also be extended to processes on unimodular Galton-Watson trees. In the talk we present the notion of typicality, the entropy inequalities that we use and the sufficient conditions mentioned above. Joint work with Charles Bordenave and Balázs Szegedy.
Mots-Clés : infinite trees; invariant process; sofic entropy
Codes MSC : Mots-Clés : infinite trees; invariant process; sofic entropy
05C80 - Random graphs
28D20 - Entropy and other invariants
37A35 - Entropy and other invariants, isomorphism, classification
|
Informations sur la Vidéo
Réalisateur : Petit, JeanLangue : Anglais Date de Publication : 09/06/2023 Date de Captation : 22/05/2023 Sous Collection : Research talks Catégorie arXiv : Probability Domaine(s) : Probabilités & Statistiques Format : MP4 (.mp4) - HD Durée : 00:49:39 Audience : Chercheurs ; Etudiants Science Cycle 2 ; Doctoral Students, Post-Doctoral Students Download : https://videos.cirm-math.fr/2023-05-22_Backhausz.mp4 
|
Informations sur la Rencontre
Nom de la Rencontre : Measured Group Theory, Stochastic Processes on Groups and Borel Combinatorics / Théorie mesurée des groupes, processus stochastiques sur les groupes et combinatoire BorélienneOrganisateurs de la Rencontre : Abért, Miklós ; Gaboriau, Damien ; Tserunyan, Anush ; Virág, Bálint Dates : 22/05/2023 - 26/05/2023 Année de la rencontre : 2023 URL de la Rencontre : https://conferences.cirm-math.fr/2172.html
Données de citation
DOI : 10.24350/CIRM.V.20048403Citer cette vidéo: Backhausz, Agnes (2023). Typicality and entropy of processes on infinite trees. CIRM. Audiovisual resource. doi:10.24350/CIRM.V.20048403 URI : http://dx.doi.org/10.24350/CIRM.V.20048403 |
Voir Aussi
- [Multi angle] Treeability and planarity in measured group theory / Auteur de la conférence Tucker-Drob, Robin.
- [Multi angle] Commability and graphs of abelian groups / Auteur de la conférence Le Boudec, Adrien.
- [Multi angle] Borel asymptotic dimension and hyperfiniteness / Auteur de la conférence Conley, Clinton.
- [Multi angle] Perfect kernels and dynamics: from Bass-Serre theory to hyperbolic groups / Auteur de la conférence Azuelos, Pénélope.
Bibliographie
- BACKHAUSZ, Agnes, BORDENAVE, Charles, et SZEGEDY, Balázs. Typicality and entropy of processes on infinite trees. In : Annales de l'Institut Henri Poincare (B) Probabilites et statistiques. Institut Henri Poincaré, 2022. p. 1959-1980. - http://dx.doi.org/10.1214/21-AIHP1233
- BACKHAUSZ, Agnes et SZEGEDY, Balázs. On large‐girth regular graphs and random processes on trees. Random Structures & Algorithms, 2018, vol. 53, no 3, p. 389-416. - https://doi.org/10.1002/rsa.20769
- NAM, Danny, SLY, Allan, et ZHANG, Lingfu. Ising model on trees and factors of IID. Communications in Mathematical Physics, 2022, p. 1-38. - http://dx.doi.org/10.1007/s00220-021-04260-2
- RAHMAN, Mustazee et VIRAG, Bálint. Local algorithms for independent sets are half-optimal. Ann. Probab. 2017. 45 (3) 1543 - 1577 - http://dx.doi.org/10.1214/16-AOP1094
Imagette Video
