Jacopo

Random Combinatorial Structures 2019

This is the webpage for the course of Random Combinatorial Structures. Teacher: Valentin Féray Lectures: Fr 10.15 – 12.00, Room: Y27H25 Exercises: Mo 8.25 – 10.00, Room: Y27H25 UZH-Webpage of the course Some notes on the various notions of convergence for real-valued random variables: CONVERGENCE FOR RANDOM VARIABLES I’m in charge of the exercise sessions …

Random Combinatorial Structures 2019Read More »

Enumerative Combinatorics 2018

This is the webpage for the course of Enumerative Combinatorics. Teacher: Mathilde Bouvel Lectures: Th 15.00 – 17.00, Room: Y27H28 Exercises: Th 8.00 – 9.45, Room: Y27H46 UZH-Webpage of the course I’m in charge of the exercise sessions for this course. I will publish here one exercise sheet per week. Exercises 1 (Solutions 1) Exercises …

Enumerative Combinatorics 2018Read More »

Local convergence for permutations and local limits for uniform ρ-avoiding permutations with |ρ|=3

We set up a new notion of local convergence for permutations and we prove a characterization in terms of proportions of consecutive pattern occurrences. We also characterize random limiting objects for this new topology introducing a notion of “shift-invariant” property (corresponding to the notion of unimodularity for random graphs). We then study two models in …

Local convergence for permutations and local limits for uniform ρ-avoiding permutations with |ρ|=3Read More »

Local convergence for random permutations: the case of uniform pattern-avoiding permutations.

For large combinatorial structures, two main notions of convergence can be defined: scaling limits and local limits. In particular for graphs, both notions are well-studied and well-understood. For permutations only a notion of scaling limits, called permutons, has been recently introduced. The convergence for permutons has also been characterized by frequencies of pattern occurrences. We …

Local convergence for random permutations: the case of uniform pattern-avoiding permutations.Read More »