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:20260404T110912Z UID:BristolProbSem/1 DESCRIPTION:Title: The scaling limit of a critical random directed graph\nb y Christina Goldschmidt (Oxford University) as part of Bristol probability seminar\n\nAbstract: TBA\n LOCATION:https://stable.researchseminars.org/talk/BristolProbSem/1/ END:VEVENT BEGIN:VEVENT SUMMARY:Tal Orenshtein (TU Berlin) DTSTART:20200501T143000Z DTEND:20200501T153000Z DTSTAMP:20260404T110912Z 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://stable.researchseminars.org/talk/BristolProbSem/2/ END:VEVENT BEGIN:VEVENT SUMMARY:Nina Gantert (TU Berlin) DTSTART:20200522T143000Z DTEND:20200522T153000Z DTSTAMP:20260404T110912Z UID:BristolProbSem/3 DESCRIPTION:Title: The tagged particle in exclusion processes on trees\nby Nina Gantert (TU Berlin) as part of Bristol probability seminar\n\n\nAbstr act\nWe consider exclusion processes on regular trees\, started from an eq uilibrium distribution\, and give a formula for the speed of the tagged pa rticle. Then we consider two different versions of the simple exclusion pr ocess on augmented Galton-Watson trees\, the constant speed model and the variable speed model. We show for both models that the tagged particle has a positive linear speed and we give explicit formulas for the speeds. The talk is based on joint results with Dayue Chen\, Peng Chen and Dominik Sc hmid.\n LOCATION:https://stable.researchseminars.org/talk/BristolProbSem/3/ END:VEVENT BEGIN:VEVENT SUMMARY:Riddhipratim Basu (ICTS) DTSTART:20200529T143000Z DTEND:20200529T153000Z DTSTAMP:20260404T110912Z UID:BristolProbSem/4 DESCRIPTION:Title: Beta-ensembles\, eigenvalue rigidity and last passage percol ation\nby Riddhipratim Basu (ICTS) as part of Bristol probability semi nar\n\n\nAbstract\nConnection between beta ensembles and exactly solvable models of last passage percolation is classical. I shall recall some of th e standard distributional equalities and explain how one can obtain tail e stimates for last passage times using random matrix techniques. We shall a lso discuss how these estimates\, combined with certain rigidity propertie s of eigenvalues\, can be used to answer questions about geometry of geode sics in integrable models of last passage percolation.\n LOCATION:https://stable.researchseminars.org/talk/BristolProbSem/4/ END:VEVENT BEGIN:VEVENT SUMMARY:Celement Cosco (Weizmann Institute) DTSTART:20200605T143000Z DTEND:20200605T153000Z DTSTAMP:20260404T110912Z UID:BristolProbSem/5 DESCRIPTION:Title: Properties of the stochastic heat equation (SHE) and the Kar dar-Parisi-Zhang (KPZ) equation in dimension d ≥ 3\nby Celement Cosc o (Weizmann Institute) as part of Bristol probability seminar\n\n\nAbstrac t\nThere have been recently a few works studying the behavior of the molli fied SHE and KPZ equation in higher dimension as the mollification paramet er is switched off. We will present a selection of these results\, as well as the relation to the directed polymer model that has played a central r ole in the study of these equations.\n LOCATION:https://stable.researchseminars.org/talk/BristolProbSem/5/ END:VEVENT BEGIN:VEVENT SUMMARY:Giambattista Giacomin (LPSM) DTSTART:20200612T143000Z DTEND:20200612T153000Z DTSTAMP:20260404T110912Z UID:BristolProbSem/6 DESCRIPTION:Title: A mathematical viewpoint on disorder relevance and on the in finite disorder renormalization group fixed point.\nby Giambattista Gi acomin (LPSM) as part of Bristol probability seminar\n\nAbstract: TBA\n LOCATION:https://stable.researchseminars.org/talk/BristolProbSem/6/ END:VEVENT BEGIN:VEVENT SUMMARY:Gabor Pete (Rényi Institute) DTSTART:20200619T143000Z DTEND:20200619T153000Z DTSTAMP:20260404T110912Z UID:BristolProbSem/7 DESCRIPTION:Title: The Free Uniform Spanning Forest is disconnected in some vir tually free groups\, depending on the generating set\nby Gabor Pete (R ényi Institute) as part of Bristol probability seminar\n\n\nAbstract\nThe uniform measure on the set of all spanning trees of a finite graph is a c lassical object in probability. In an infinite graph\, one can take an exh austion by finite subgraphs\, with some boundary conditions\, and take the limit measure. The Free Uniform Spanning Forest (FUSF) is one of the natu ral limits\, but it is less understood than the wired version\, the WUSF. If we take a finitely generated group\, then several properties of WUSF an d FUSF have been known to be independent of the Cayley graph of the group: whether WUSF=FUSF\; the average degree in WUSF and in FUSF\; the number o f trees in the WUSF. Lyons and Peres asked if this should also be the case for the FUSF.\nIn recent joint work with Ádám Timár\, we give two diff erent Cayley graphs of the same group such that the FUSF is connected in o ne of them and it has infinitely many trees in the other. Furthermore\, si nce our example is a virtually free group\, we obtained a counterexample t o the general expectation that such "tree-like" graphs would have connecte d FUSF.\n LOCATION:https://stable.researchseminars.org/talk/BristolProbSem/7/ END:VEVENT BEGIN:VEVENT SUMMARY:Mariangeles Serrano Moral (University of Barcelona) DTSTART:20200626T143000Z DTEND:20200626T153000Z DTSTAMP:20260404T110912Z UID:BristolProbSem/8 DESCRIPTION:Title: Geometric renormalization unravels the multiscale structure of complex networks\nby Mariangeles Serrano Moral (University of Barce lona) as part of Bristol probability seminar\n\n\nAbstract\nThe renormaliz ation group allows a systematic investigation of physical systems when obs erved at different length scales. However\, the small-world property of co mplex networks complicates application of the renormalization group by int roducing correlations between coexisting scales. Network geometry offers n ow a powerful framework where similarity distances between nodes in a late nt space allow a geometric renormalization (GR) method for exploring the s tructure of real networks at lower resolutions. The technique is based on network maps that are progressively coarse-grained and rescaled to unfold real networks into a multilayer shell that shows statistical self-similari ty. Interestingly\, self-similarity of the GR multiscale shell holds for h uman brain connectomes\, in agreement with the self-similarity observed wh en the resolution length is progressively decreased by hierarchical coarse -graining of anatomical regions\, suggesting that the same principles orga nize connectivity between brain regions at different length scales. Finall y\, self-similarity is also found in the evolution of some growing real ne tworks\, suggesting that evolutionary processes can be modeled by reversin g GR.\n LOCATION:https://stable.researchseminars.org/talk/BristolProbSem/8/ END:VEVENT BEGIN:VEVENT SUMMARY:Yinon Spinka DTSTART:20200703T163000Z DTEND:20200703T173000Z DTSTAMP:20260404T110912Z UID:BristolProbSem/9 DESCRIPTION:Title: A short proof of the discontinuity of phase transition in th e planar random-cluster model with q>4\nby Yinon Spinka as part of Bri stol probability seminar\n\n\nAbstract\nWe give a short proof of the disco ntinuity of phase transition for the random-cluster model on the square la ttice with parameter q>4. This result was recently shown by Duminil-Copin\ , Gagnebin\, Harel\, Manolescu and Tassion via the so-called Bethe ansatz for the six-vertex model. Our proof also exploits the connection to the si x-vertex model\, but does not rely on the Bethe ansatz. Our argument is so ft and only uses very basic properties of the random-cluster model.\nJoint work with Gourab Ray\n LOCATION:https://stable.researchseminars.org/talk/BristolProbSem/9/ END:VEVENT BEGIN:VEVENT SUMMARY:Enrique Guerra (University of Chile) DTSTART:20200710T143000Z DTEND:20200710T153000Z DTSTAMP:20260404T110912Z UID:BristolProbSem/10 DESCRIPTION:Title: On the ballistic conjecture in RWRE\nby Enrique Guerra (University of Chile) as part of Bristol probability seminar\n\n\nAbstract \nWe start this talk by introducing with two dimensional examples the mode l of random walk in a random environment (RWRE). We then define several as ymptotic terminology:\ndirectional transience\, ballisticity conditions an d the ballistic regime. The definitions introduced will be sufficient for stating the main conjecture\, delve into its connection with\nthe so-calle d (T) condition and explain in part why we expect an affirmative answer fo r\nthat open problem. In particular\, we will see the relation between the nicknamed atypical\nquenched estimate and ballistic behaviour. Finally\, we will display some known results\nwhich try to fill the gap needed to pr ove the ballistic conjecture. Results are joint work\nwith A. F. Ram´ıre z\, M. E. Vares and G. Valle.\n LOCATION:https://stable.researchseminars.org/talk/BristolProbSem/10/ END:VEVENT BEGIN:VEVENT SUMMARY:Marcelo Hilario (UFMG) DTSTART:20200717T143000Z DTEND:20200717T153000Z DTSTAMP:20260404T110912Z UID:BristolProbSem/11 DESCRIPTION:Title: Percolation on Randomly Stretched Lattice\nby Marcelo H ilario (UFMG) as part of Bristol probability seminar\n\n\nAbstract\nWe con sider a stretched version of the square lattice where the distances betwee n neighboring vertical columns are given by interarrival intervals of a re newal process. Hence\, horizontal edges that link vertices in the same pai r of vertical columns have a common random length while every vertical edg e has a length one. Conditioned on the realization of the lattice\, we def ine a bond percolation model where edges are open with probabilities that depend on their length. We relate the question of whether the model underg oes a non-trivial phase transition to the moments of interarrival times of the renewal process governing the distance among columns. We will also di scuss some other related percolation models defined on media with similar type of columnar disorder.\n LOCATION:https://stable.researchseminars.org/talk/BristolProbSem/11/ END:VEVENT BEGIN:VEVENT SUMMARY:Noam Lifshitz (Hebrew University) DTSTART:20200724T143000Z DTEND:20200724T153000Z DTSTAMP:20260404T110912Z UID:BristolProbSem/12 DESCRIPTION:Title: Forbidden intersections\, hypercontractivity\, and the rand om gluing method\nby Noam Lifshitz (Hebrew University) as part of Bris tol probability seminar\n\n\nAbstract\nThe following problem was studied b y Frankl and Rodl in 1987.\nHow large can a subset $A$ of the multicube $[ m]^n$ be if no two vectors in $A$ agree on exactly $t$-coordinates?\nWe so lve the problem for n>n_0(t) and all values of $m$. \nOur approach is base d on finding multi-cube analogues of recent results in the field of analys is of Boolean functions. \nJoint work with Peter Keevash\, Eoin Long\, and Dor Minzer.\n LOCATION:https://stable.researchseminars.org/talk/BristolProbSem/12/ END:VEVENT END:VCALENDAR