BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Christina Goldschmidt (Oxford University) DTSTART:20200424T143000Z DTEND:20200424T153000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/1 DESCRIPTION:Title: The scaling limit of a critical random directed graph\nby Chris tina Goldschmidt (Oxford University) as part of Bristol probability semina r\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/BristolProbSem/1/ END:VEVENT BEGIN:VEVENT SUMMARY:Tal Orenshtein (TU Berlin) DTSTART:20200501T143000Z DTEND:20200501T153000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/2 DESCRIPTION:Title: Rough walks in random environment\nby Tal Orenshtein (TU Berlin ) as part of Bristol probability seminar\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/BristolProbSem/2/ END:VEVENT BEGIN:VEVENT SUMMARY:Nina Gantert (TU Berlin) DTSTART:20200522T143000Z DTEND:20200522T153000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/3 DESCRIPTION:Title: The tagged particle in exclusion processes on trees\nby Nina Ga ntert (TU Berlin) as part of Bristol probability seminar\n\n\nAbstract\nWe consider exclusion processes on regular trees\, started from an equilibri um distribution\, and give a formula for the speed of the tagged particle. Then we consider two different versions of the simple exclusion process o n augmented Galton-Watson trees\, the constant speed model and the variabl e speed model. We show for both models that the tagged particle has a posi tive linear speed and we give explicit formulas for the speeds. The talk i s based on joint results with Dayue Chen\, Peng Chen and Dominik Schmid.\n LOCATION:https://researchseminars.org/talk/BristolProbSem/3/ END:VEVENT BEGIN:VEVENT SUMMARY:Riddhipratim Basu (ICTS) DTSTART:20200529T143000Z DTEND:20200529T153000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/4 DESCRIPTION:Title: Beta-ensembles\, eigenvalue rigidity and last passage percolation\nby Riddhipratim Basu (ICTS) as part of Bristol probability seminar\n\n \nAbstract\nConnection between beta ensembles and exactly solvable models of last passage percolation is classical. I shall recall some of the stand ard distributional equalities and explain how one can obtain tail estimate s for last passage times using random matrix techniques. We shall also dis cuss how these estimates\, combined with certain rigidity properties of ei genvalues\, can be used to answer questions about geometry of geodesics in integrable models of last passage percolation.\n LOCATION:https://researchseminars.org/talk/BristolProbSem/4/ END:VEVENT BEGIN:VEVENT SUMMARY:Celement Cosco (Weizmann Institute) DTSTART:20200605T143000Z DTEND:20200605T153000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/5 DESCRIPTION:Title: Properties of the stochastic heat equation (SHE) and the Kardar-Par isi-Zhang (KPZ) equation in dimension d ≥ 3\nby Celement Cosco (Weiz mann Institute) as part of Bristol probability seminar\n\n\nAbstract\nTher e have been recently a few works studying the behavior of the mollified SH E and KPZ equation in higher dimension as the mollification parameter is s witched off. We will present a selection of these results\, as well as the relation to the directed polymer model that has played a central role in the study of these equations.\n LOCATION:https://researchseminars.org/talk/BristolProbSem/5/ END:VEVENT BEGIN:VEVENT SUMMARY:Giambattista Giacomin (LPSM) DTSTART:20200612T143000Z DTEND:20200612T153000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/6 DESCRIPTION:Title: A mathematical viewpoint on disorder relevance and on the infinite disorder renormalization group fixed point.\nby Giambattista Giacomin (LPSM) as part of Bristol probability seminar\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/BristolProbSem/6/ END:VEVENT BEGIN:VEVENT SUMMARY:Gabor Pete (Rényi Institute) DTSTART:20200619T143000Z DTEND:20200619T153000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/7 DESCRIPTION:Title: The Free Uniform Spanning Forest is disconnected in some virtually free groups\, depending on the generating set\nby Gabor Pete (Rényi I nstitute) as part of Bristol probability seminar\n\n\nAbstract\nThe unifor m measure on the set of all spanning trees of a finite graph is a classica l object in probability. In an infinite graph\, one can take an exhaustion by finite subgraphs\, with some boundary conditions\, and take the limit measure. The Free Uniform Spanning Forest (FUSF) is one of the natural lim its\, but it is less understood than the wired version\, the WUSF. If we t ake a finitely generated group\, then several properties of WUSF and FUSF have been known to be independent of the Cayley graph of the group: whethe r WUSF=FUSF\; the average degree in WUSF and in FUSF\; the number of trees in the WUSF. Lyons and Peres asked if this should also be the case for th e FUSF.\nIn recent joint work with Ádám Timár\, we give two different C ayley graphs of the same group such that the FUSF is connected in one of t hem and it has infinitely many trees in the other. Furthermore\, since our example is a virtually free group\, we obtained a counterexample to the g eneral expectation that such "tree-like" graphs would have connected FUSF. \n LOCATION:https://researchseminars.org/talk/BristolProbSem/7/ END:VEVENT BEGIN:VEVENT SUMMARY:Mariangeles Serrano Moral (University of Barcelona) DTSTART:20200626T143000Z DTEND:20200626T153000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/8 DESCRIPTION:Title: Geometric renormalization unravels the multiscale structure of comp lex networks\nby Mariangeles Serrano Moral (University of Barcelona) a s part of Bristol probability seminar\n\n\nAbstract\nThe renormalization g roup allows a systematic investigation of physical systems when observed a t different length scales. However\, the small-world property of complex n etworks complicates application of the renormalization group by introducin g correlations between coexisting scales. Network geometry offers now a po werful framework where similarity distances between nodes in a latent spac e allow a geometric renormalization (GR) method for exploring the structur e of real networks at lower resolutions. The technique is based on network maps that are progressively coarse-grained and rescaled to unfold real ne tworks into a multilayer shell that shows statistical self-similarity. Int erestingly\, self-similarity of the GR multiscale shell holds for human br ain connectomes\, in agreement with the self-similarity observed when the resolution length is progressively decreased by hierarchical coarse-graini ng of anatomical regions\, suggesting that the same principles organize co nnectivity between brain regions at different length scales. Finally\, sel f-similarity is also found in the evolution of some growing real networks\ , suggesting that evolutionary processes can be modeled by reversing GR.\n LOCATION:https://researchseminars.org/talk/BristolProbSem/8/ END:VEVENT BEGIN:VEVENT SUMMARY:Yinon Spinka DTSTART:20200703T163000Z DTEND:20200703T173000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/9 DESCRIPTION:Title: A short proof of the discontinuity of phase transition in the plana r random-cluster model with q>4\nby Yinon Spinka as part of Bristol pr obability seminar\n\n\nAbstract\nWe give a short proof of the discontinuit y of phase transition for the random-cluster model on the square lattice w ith parameter q>4. This result was recently shown by Duminil-Copin\, Gagne bin\, Harel\, Manolescu and Tassion via the so-called Bethe ansatz for the six-vertex model. Our proof also exploits the connection to the six-verte x model\, but does not rely on the Bethe ansatz. Our argument is soft and only uses very basic properties of the random-cluster model.\nJoint work w ith Gourab Ray\n LOCATION:https://researchseminars.org/talk/BristolProbSem/9/ END:VEVENT BEGIN:VEVENT SUMMARY:Enrique Guerra (University of Chile) DTSTART:20200710T143000Z DTEND:20200710T153000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/10 DESCRIPTION:Title: On the ballistic conjecture in RWRE\nby Enrique Guerra (Univer sity of Chile) as part of Bristol probability seminar\n\n\nAbstract\nWe st art this talk by introducing with two dimensional examples the model of ra ndom walk in a random environment (RWRE). We then define several asymptoti c terminology:\ndirectional transience\, ballisticity conditions and the b allistic regime. The definitions introduced will be sufficient for stating the main conjecture\, delve into its connection with\nthe so-called (T) c ondition and explain in part why we expect an affirmative answer for\nthat open problem. In particular\, we will see the relation between the nickna med atypical\nquenched estimate and ballistic behaviour. Finally\, we will display some known results\nwhich try to fill the gap needed to prove the ballistic conjecture. Results are joint work\nwith A. F. Ram´ırez\, M. E. Vares and G. Valle.\n LOCATION:https://researchseminars.org/talk/BristolProbSem/10/ END:VEVENT BEGIN:VEVENT SUMMARY:Marcelo Hilario (UFMG) DTSTART:20200717T143000Z DTEND:20200717T153000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/11 DESCRIPTION:Title: Percolation on Randomly Stretched Lattice\nby Marcelo Hilario (UFMG) as part of Bristol probability seminar\n\n\nAbstract\nWe consider a stretched version of the square lattice where the distances between neigh boring vertical columns are given by interarrival intervals of a renewal p rocess. Hence\, horizontal edges that link vertices in the same pair of ve rtical columns have a common random length while every vertical edge has a length one. Conditioned on the realization of the lattice\, we define a b ond percolation model where edges are open with probabilities that depend on their length. We relate the question of whether the model undergoes a n on-trivial phase transition to the moments of interarrival times of the re newal process governing the distance among columns. We will also discuss s ome other related percolation models defined on media with similar type of columnar disorder.\n LOCATION:https://researchseminars.org/talk/BristolProbSem/11/ END:VEVENT BEGIN:VEVENT SUMMARY:Noam Lifshitz (Hebrew University) DTSTART:20200724T143000Z DTEND:20200724T153000Z DTSTAMP:20260422T225752Z UID:BristolProbSem/12 DESCRIPTION:Title: Forbidden intersections\, hypercontractivity\, and the random glui ng method\nby Noam Lifshitz (Hebrew University) as part of Bristol pro bability seminar\n\n\nAbstract\nThe following problem was studied by Frank l and Rodl in 1987.\nHow large can a subset $A$ of the multicube $[m]^n$ b e if no two vectors in $A$ agree on exactly $t$-coordinates?\nWe solve the problem for n>n_0(t) and all values of $m$. \nOur approach is based on fi nding multi-cube analogues of recent results in the field of analysis of B oolean functions. \nJoint work with Peter Keevash\, Eoin Long\, and Dor Mi nzer.\n LOCATION:https://researchseminars.org/talk/BristolProbSem/12/ END:VEVENT END:VCALENDAR