اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRoot lattices and quasicrystals
98
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
It is shown how root lattices and their reciprocals might serve as the right pool for the construction of quasicrystalline structure models. All non-periodic symmetries observed so far are covered in minimal embedding with maximal symmetry.
قيم البحث
اقرأ أيضاً
We perform numerical simulations to study the optimal path problem on disordered hierarchical graphs with effective dimension d=2.32. Therein, edge energies are drawn from a disorder distribution that allows for positive and negative energies. This i
nduces a behavior which is fundamentally different from the case where all energies are positive, only. Upon changing the subtleties of the distribution, the scaling of the minimum energy path length exhibits a transition from self-affine to self-similar. We analyze the precise scaling of the path length and the associated ground-state energy fluctuations in the vincinity of the disorder critical point, using a decimation procedure for huge graphs. Further, using an importance sampling procedure in the disorder we compute the negative-energy tails of the ground-state energy distribution up to 12 standard deviations away from its mean. We find that the asymptotic behavior of the negative-energy tail is in agreement with a Tracy-Widom distribution. Further, the characteristic scaling of the tail can be related to the ground-state energy flucutations, similar as for the directed polymer in a random medium.
The principle characteristics of biased greedy random walks (BGRWs) on two-dimensional lattices with real-valued quenched disorder on the lattice edges are studied. Here, the disorder allows for negative edge-weights. In previous studies, considering
the negative-weight percolation (NWP) problem, this was shown to change the universality class of the existing, static percolation transition. In the presented study, four different types of BGRWs and an algorithm based on the ant colony optimization (ACO) heuristic were considered. Regarding the BGRWs, the precise configurations of the lattice walks constructed during the numerical simulations were influenced by two parameters: a disorder parameter rho that controls the amount of negative edge weights on the lattice and a bias strength B that governs the drift of the walkers along a certain lattice direction. Here, the pivotal observable is the probability that, after termination, a lattice walk exhibits a total negative weight, which is here considered as percolating. The behavior of this observable as function of rho for different bias strengths B is put under scrutiny. Upon tuning rho, the probability to find such a feasible lattice walk increases from zero to one. This is the key feature of the percolation transition in the NWP model. Here, we address the question how well the transition point rho_c, resulting from numerically exact and static simulations in terms of the NWP model can be resolved using simple dynamic algorithms that have only local information available, one of the basic questions in the physics of glassy systems.
Spin-spin correlations are calculated in frustrated hierarchical Ising models that exhibit chaotic renormalization-group behavior. The spin-spin correlations, as a function of distance, behave chaotically. The far correlations, but not the near corre
lations, are sensitive to small changes in temperature or frustration, with temperature changes having a larger effect. On the other hand, the calculated free energy, internal energy, and entropy are smooth functions of temperature. The recursion-matrix calculation of thermodynamic densities in a chaotic band is demonstrated. The leading Lyapunov exponents are calculated as a function of frustration.
We study bond percolation on several four-dimensional (4D) lattices, including the simple (hyper) cubic (SC), the SC with combinations of nearest neighbors and second nearest neighbors (SC-NN+2NN), the body-centered cubic (BCC), and the face-centered
cubic (FCC) lattices, using an efficient single-cluster growth algorithm. For the SC lattice, we find $p_c = 0.1601312(2)$, which confirms previous results (based on other methods), and find a new value $p_c=0.035827(1)$ for the SC-NN+2NN lattice, which was not studied previously for bond percolation. For the 4D BCC and FCC lattices, we obtain $p_c=0.074212(1)$ and 0.049517(1), which are substantially more precise than previous values. We also find critical exponents $tau = 2.3135(5)$ and $Omega = 0.40(3)$, consistent with previous numerical results and the recent four-loop series result of Gracey [Phys. Rev. D 92, 025012, (2015)].
We study bond percolation on the simple cubic (SC) lattice with various combinations of first, second, third, and fourth nearest-neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the bond threshol
ds. Correlations between percolation thresholds and lattice properties are discussed, and our results show that the percolation thresholds of these and other three-dimensional lattices decrease monotonically with the coordination number $z$ quite accurately according to a power law $p_{c} sim z^{-a}$, with exponent $a = 1.111$. However, for large $z$, the threshold must approach the Bethe lattice result $p_c = 1/(z-1)$. Fitting our data and data for lattices with additional nearest neighbors, we find $p_c(z-1)=1+1.224 z^{-1/2}$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
