BOOK : "Computational Physics", 2nd edition, by Nicholas Giordano and Hisao Nakanishi

Please run the code a, b, and c to check if there is any error. Thanks

.1 2D Percolation and Critical Exponents _ Write PYTHON program to simulate the percolation transition on a. N > 1)?). Include snapshots of the occupation on the grid for a single run for p=0.2, 0.55, 0.65 and 0.8. Do several runs (keeping N xed) and average them to obtain a reasonably smooth result for Lctot(p). Determine the critical probability pC by checking, after each new entry, for the appearance of a spanning cluster, and plot the latter when it rst appears (once for each value of N) Perform this procedure for various lattice sizes N (e.g. N =5,10,15,20,30,50,80) using an average over ca. 50 simulations for each N, and plot pc(N_1) to extrapolate to the innite-size limit, paw). For xed lattice size (as large as possible, e.g., N 2100), compute the fraction no. of sites in spanning cluster no. of occupied sites F(P >pc) E (1) as a function of p above the critical 13C (for chosen N) Average your results for each p over ca. 50 simulations. Fit your results to a power-law ansatz F = Fi? Pay} (2) by plotting the logarithm of both sides and extracting the slope of a straight- line t (note that the power-law only applies for 3) not \"too far\" above pc)