University of Cambridge > Talks.cam > Probability > Macroscopic loops in the loop O(n) model

  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

Macroscopic loops in the loop O(n) model

Download to your calendar using vCal

If you have a question about this talk, please contact Perla Sousi .

A loop configuration on the hexagonal (honeycomb) lattice is a finite subgraph of the lattice in which every vertex has degree 0 or 2, so that every connected component is isomorphic to a cycle. The loop O(n) model on the hexagonal lattice is a random loop configuration, where the probability of a loop configuration is proportional to x n(#loops) and x,n>0 are parameters called the edge-weight and loop-weight. I will discuss the phase structure of the loop O(n) model for various parameters of n and x, focusing on recent results about the non-existence of macroscopic loops for large n, and about the existence of macroscopic loops on a critical line when n is between 1 and 2. Based on joint works with Hugo Duminil-Copin, Alexander Glazman, Ron Peled and Wojciech Samotij.

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

The Crisis of Democracy? Evidence from the Post-Communist World djl82's list Computer Laboratory, William Gates Building, LT1

Other talks

LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater Online Causal Inference Seminar Title to be confirmed Talk TBC "That's History. That's Truth. I Seen It Myself": T'tc~tsa (Wailaki) and the Enslavement of California Native Americans. Toward high resolution structure/function analyses of sensorimotor integration in ciliated protists
 

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