اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCalculation of higher-order moments by higher-order tensor renormalization group
71
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A calculation method for higher-order moments of physical quantities, including magnetization and energy, based on the higher-order tensor renormalization group is proposed. The physical observables are represented by impurity tensors. A systematic summation scheme provides coarse-grained tensors including multiple impurities. Our method is compared with the Monte Carlo method on the two-dimensional Potts model. While the nature of the transition of the $q$-state Potts model has been known for a long time owing to the analytical arguments, a clear numerical confirmation has been difficult due to extremely long correlation length in the weakly first-order transitions, e.g., for $q=5$. A jump of the Binder ratio precisely determines the transition temperature. The finite-size scaling analysis provides critical exponents and distinguishes the weakly first-order and the continuous transitions.
قيم البحث
اقرأ أيضاً
We develop calculational method for fermionic Green functions in the framework of Grassmann higher-order tensor renormalization group. The validity of the method is tested by applying it to three-dimensional free Wilson fermion system. We compare the
numerical results for chiral condensate and two-point correlation functions with the exact ones obtained by analytical methods.
We consider the problem of decomposing higher-order moment tensors, i.e., the sum of symmetric outer products of data vectors. Such a decomposition can be used to estimate the means in a Gaussian mixture model and for other applications in machine le
arning. The $d$th-order empirical moment tensor of a set of $p$ observations of $n$ variables is a symmetric $d$-way tensor. Our goal is to find a low-rank tensor approximation comprising $r ll p$ symmetric outer products. The challenge is that forming the empirical moment tensors costs $O(pn^d)$ operations and $O(n^d)$ storage, which may be prohibitively expensive; additionally, the algorithm to compute the low-rank approximation costs $O(n^d)$ per iteration. Our contribution is avoiding formation of the moment tensor, computing the low-rank tensor approximation of the moment tensor implicitly using $O(pnr)$ operations per iteration and no extra memory. This advance opens the door to more applications of higher-order moments since they can now be efficiently computed. We present numerical evidence of the computational savings and show an example of estimating the means for higher-order moments.
A concept of higher order neighborhood in complex networks, introduced previously (PRE textbf{73}, 046101, (2006)), is systematically explored to investigate larger scale structures in complex networks. The basic idea is to consider each higher order
neighborhood as a network in itself, represented by a corresponding adjacency matrix. Usual network indices are then used to evaluate the properties of each neighborhood. Results for a large number of typical networks are presented and discussed. Further, the information from all neighborhoods is condensed in a single neighborhood matrix, which can be explored for visualizing the neighborhood structure. On the basis of such representation, a distance is introduced to compare, in a quantitative way, how far apart networks are in the space of neighborhood matrices. The distance depends both on the network topology and the adopted node numbering. Given a pair of networks, a Monte Carlo algorithm is developed to find the best numbering for one of them, holding fixed the numbering of the second network, obtaining a projection of the first one onto the pattern of the other. The minimal value found for the distance reflects differences in the neighborhood structures of the two networks that arise from distinct topologies. Examples are worked out allowing for a quantitative comparison for distances among a set of distinct networks.
Given a set of variables and the correlations among them, we develop a method for finding clustering among the variables. The method takes advantage of information implicit in higher-order (not just pairwise) correlations. The idea is to define a Pot
ts model whose energy is based on the correlations. Each state of this model is a partition of the variables and a Monte Carlo method is used to identify states of lowest energy, those most consistent with the correlations. A set of the 100 or so lowest such partitions is then used to construct a stochastic dynamics (using the adjacency matrix of each partition) whose observable representation gives the clustering. Three examples are studied. For two of them the 3$^mathrm{rd}$ order correlations are significant for getting the clusters right. The last of these is a toy model of a biological system in which the joint action of several genes or proteins is necessary to accomplish a given process.
We investigate the order of the topological quantum phase transition in a two dimensional quadrupolar topological insulator within a thermodynamic approach. Using numerical methods, we separate the bulk, edge and corner contributions to the grand pot
ential and detect different phase transitions in the topological phase diagram. The transitions from the quadrupolar to the trivial or to the dipolar phases are well captured by the thermodynamic potential. On the other hand, we have to resort to a grand potential based on the Wannier bands to describe the transition from the trivial to the dipolar phase. The critical exponents and the order of the phase transitions are determined and discussed in the light of the Josephson hyperscaling relation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
