3D Potts/Ising model. How to identify boundaries of clusters?

  • Context: Graduate 
  • Thread starter Thread starter vassvik
  • Start date Start date
  • Tags Tags
    3d Clusters Model
Click For Summary
SUMMARY

The discussion centers on the application of the 3D Potts model using the Swendsen-Wang algorithm to identify the critical temperature and critical exponent in a temperature gradient scenario. The user reports an error in the critical temperature estimation for Q = 2, obtaining J/(k_b T) ~ 0.226 instead of the known value of 0.2216. The current method for identifying the boundary between ordered and disordered regions is deemed inefficient, prompting inquiries into known algorithms for boundary identification. The user also considers the impact of system size on the accuracy of their results, referencing a study that utilized a 256x256x256 system.

PREREQUISITES
  • Understanding of the 3D Potts model
  • Familiarity with the Swendsen-Wang algorithm
  • Knowledge of the Hoshen-Kopelman algorithm for cluster identification
  • Concept of finite size scaling in statistical physics
NEXT STEPS
  • Research boundary identification algorithms applicable to convex structures
  • Explore advanced techniques for finite size scaling analysis
  • Investigate the effects of system size on critical temperature calculations
  • Examine alternative methods for identifying diffusion fronts in 3D systems
USEFUL FOR

Researchers and practitioners in statistical physics, computational physics, and anyone working on phase transitions and cluster dynamics in complex systems.

vassvik
Messages
2
Reaction score
0
I am currently working on the 3D potts model in a temperature gradient to identify the critical temperature and critical exponent. I use the Swendsen-Wang algorithm to simulate the dynamics of the system, and I use the Hoshen-Kopelman algorithm to identify the clusters of spins.

The problem is: The method I am currently using to identifying the front between the ordered and disordered region is too naive, I think, because I get a slight error in the critical temperature for Q = 2, whose value is known from series expansion.

What I have done: The temperature gradient is along the z-axis, and I use a regular cubic lattice of size (NX x NY x NZ). I have currently used the highest z-value (for each x and y) that corresponds to the cluster spanning most of the ordered region to define the front.

With this method, I get J/(k_b T) ~ 0.226, while the correct value is closer to 0.2216.

What I want to do is the following: Find a way to identify the boundary/contour of the spanning cluster in the ordered region, and use that to define the interface between the ordered and the disordered regions.

I currently have a way to identify these, but I think it is very inefficient and complicated, and it may not be entirely correct. So my question is this: Are there any known algorithms to identify the boundary of a given (generally convex) structure/set of points?
 
Physics news on Phys.org
Are you sure your error in the critical temperature is due to your boundary-finding routine and not system size effects? This paper, perhaps the one you are referring to when you say the critical temperature should be 0.2216, uses a 256x256x256 sized system. Is yours also that large?

(I'm afraid I don't know any good boundary finding algorithms if it's not a system size effect that's causing your discrepancy.)
 
Mute said:
Are you sure your error in the critical temperature is due to your boundary-finding routine and not system size effects? This paper, perhaps the one you are referring to when you say the critical temperature should be 0.2216, uses a 256x256x256 sized system. Is yours also that large?

My reference have been this paper. But they use a different method to identify the diffusion front (damage spreading), so I am not 100% sure I have done everything correctly. I used different sizes and temperature ranges to extrapolate the effective critical temperature due to finite size scaling, like the second to last plot of that paper.

I was thinking of doing something similar to what they are doing this paper, but extended to 3 dimensions. It's a shot in the dark, I guess, and it may not work, but I also find the problem of identifying boundaries to be particularly interesting, so I'll try it anyway. :D

There are so many other things that could be wrong, but I am not sure where to start, or what to check on most things. I may have a subtle mistake in my cluster identification algorithm, or in the Swendsen-Wang algorithm, or anywhere else. :/
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
1
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 13 ·
Replies
13
Views
4K