University of Cambridge > Talks.cam > Probability > Reinforced Random Walk and a Supersymmetric Spin System on the Tree

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Reinforced Random Walk and a Supersymmetric Spin System on the Tree

Download to your calendar using vCal

  • UserPeter Wildemann (Cambridge)
  • ClockTuesday 28 May 2024, 15:30-16:30
  • HouseMR12.

If you have a question about this talk, please contact Jason Miller .

Motivated by predictions about the Anderson transition, we study two distinct but related models on regular tree graphs: The vertex-reinforced jump process (VRJP), a random walk preferring to jump to previously visited sites, and the H^{2|2}-model, a lattice spin system whose spins take values in a supersymmetric extension of the hyperbolic plane. Both models undergo a phase transition, and our work provides detailed information about the supercritical phase up to the critical point: We show that their order parameter has an essential singularity as one approaches the critical point, in contrast to algebraic divergences typically expected for statistical mechanics models. Moreover, we identify a previously unexpected multifractal intermediate regime in the supercritical phase. This talk is based on arxiv:2309.01221 and is joint work with R??my Poudevigne.

This talk is part of the Probability series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Seminar Room SG1, Alison Richard Building, 7 West Road Betty & Gordon Moore Library Leadership for Learning: The Cambridge Network

Other talks

Group Presentation 4 Afternoon Break Polar Oceans Seminar Talk Using A Function-Centric Lens to Re-consider Regularisation, Representation Transfer and Geometric Properties of Neural Networks Director's Briefing Feedback and the circumgalactic medium
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity