Spectral properties near the Mott transition in the two-dimensional t-J model with next-nearest-neighbor hopping

2018 ◽  
Vol 536 ◽  
pp. 447-449 ◽  
Author(s):  
Masanori Kohno
2021 ◽  
Vol 10 (4) ◽  
pp. 246
Author(s):  
Vagan Terziyan ◽  
Anton Nikulin

Operating with ignorance is an important concern of geographical information science when the objective is to discover knowledge from the imperfect spatial data. Data mining (driven by knowledge discovery tools) is about processing available (observed, known, and understood) samples of data aiming to build a model (e.g., a classifier) to handle data samples that are not yet observed, known, or understood. These tools traditionally take semantically labeled samples of the available data (known facts) as an input for learning. We want to challenge the indispensability of this approach, and we suggest considering the things the other way around. What if the task would be as follows: how to build a model based on the semantics of our ignorance, i.e., by processing the shape of “voids” within the available data space? Can we improve traditional classification by also modeling the ignorance? In this paper, we provide some algorithms for the discovery and visualization of the ignorance zones in two-dimensional data spaces and design two ignorance-aware smart prototype selection techniques (incremental and adversarial) to improve the performance of the nearest neighbor classifiers. We present experiments with artificial and real datasets to test the concept of the usefulness of ignorance semantics discovery.


2004 ◽  
Vol 15 (10) ◽  
pp. 1425-1438 ◽  
Author(s):  
A. SOLAK ◽  
B. KUTLU

The two-dimensional BEG model with nearest neighbor bilinear and positive biquadratic interaction is simulated on a cellular automaton, which is based on the Creutz cellular automaton for square lattice. Phase diagrams characterizing phase transitions of the model are presented for comparison with those obtained from other calculations. We confirm the existence of the tricritical points over the phase boundary for D/K>0. The values of static critical exponents (α, β, γ and ν) are estimated within the framework of the finite size scaling theory along D/K=-1 and 1 lines. The results are compatible with the universal Ising critical behavior except the points over phase boundary.


2001 ◽  
Vol 131 (5) ◽  
pp. 1065-1089
Author(s):  
Daniel M. Elton

We develop a spectral theory for the equation (∇ + ieA) × u = ±mu on Minkowski 3-space (one time variable and two space variables); here, A is a real vector potential and the vector product is defined with respect to the Minkowski metric. This equation was formulated by Elton and Vassiliev, who conjectured that it should have properties similar to those of the two-dimensional Dirac equation. Our equation contains a large parameter c (speed of light), and this motivates the study of the asymptotic behaviour of its spectrum as c → +∞. We show that the essential spectrum of our equation is the same as that of Dirac (theorem 3.1), whereas the discrete spectrum agrees with Dirac to a relative accuracy δλ/mc2 ~ O(c−4) (theorem 3.3). In other words, we show that our equation has the same accuracy as the two-dimensional Pauli equation, its advantage over Pauli being relativistic invariance.


1992 ◽  
Vol 165 (3) ◽  
pp. 266-270 ◽  
Author(s):  
Kazuyuki Tanaka ◽  
Tsuyoshi Horiguchi ◽  
Tohru Morita

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Tai-Xiang Jiang ◽  
Ting-Zhu Huang ◽  
Xi-Le Zhao ◽  
Tian-Hui Ma

We have proposed a patch-based principal component analysis (PCA) method to deal with face recognition. Many PCA-based methods for face recognition utilize the correlation between pixels, columns, or rows. But the local spatial information is not utilized or not fully utilized in these methods. We believe that patches are more meaningful basic units for face recognition than pixels, columns, or rows, since faces are discerned by patches containing eyes and noses. To calculate the correlation between patches, face images are divided into patches and then these patches are converted to column vectors which would be combined into a new “image matrix.” By replacing the images with the new “image matrix” in the two-dimensional PCA framework, we directly calculate the correlation of the divided patches by computing the total scatter. By optimizing the total scatter of the projected samples, we obtain the projection matrix for feature extraction. Finally, we use the nearest neighbor classifier. Extensive experiments on the ORL and FERET face database are reported to illustrate the performance of the patch-based PCA. Our method promotes the accuracy compared to one-dimensional PCA, two-dimensional PCA, and two-directional two-dimensional PCA.


2012 ◽  
Vol 112 (4) ◽  
pp. 585-593 ◽  
Author(s):  
S. Ya. Vetrov ◽  
N. V. Rudakova ◽  
I. V. Timofeev ◽  
V. P. Timofeev

2014 ◽  
Author(s):  
Kolea Zimmerman ◽  
Daniel Levitis ◽  
Ethan Addicott ◽  
Anne Pringle

We present a novel algorithm for the design of crossing experiments. The algorithm identifies a set of individuals (a ?crossing-set?) from a larger pool of potential crossing-sets by maximizing the diversity of traits of interest, for example, maximizing the range of genetic and geographic distances between individuals included in the crossing-set. To calculate diversity, we use the mean nearest neighbor distance of crosses plotted in trait space. We implement our algorithm on a real dataset ofNeurospora crassastrains, using the genetic and geographic distances between potential crosses as a two-dimensional trait space. In simulated mating experiments, crossing-sets selected by our algorithm provide better estimates of underlying parameter values than randomly chosen crossing-sets.


Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 1066
Author(s):  
Gehad Sadiek ◽  
Samaher Almalki

Recently new novel magnetic phases were shown to exist in the asymptotic steady states of spin systems coupled to dissipative environments at zero temperature. Tuning the different system parameters led to quantum phase transitions among those states. We study, here, a finite two-dimensional Heisenberg triangular spin lattice coupled to a dissipative Markovian Lindblad environment at finite temperature. We show how applying an inhomogeneous magnetic field to the system at different degrees of anisotropy may significantly affect the spin states, and the entanglement properties and distribution among the spins in the asymptotic steady state of the system. In particular, applying an inhomogeneous field with an inward (growing) gradient toward the central spin is found to considerably enhance the nearest neighbor entanglement and its robustness against the thermal dissipative decay effect in the completely anisotropic (Ising) system, whereas the beyond nearest neighbor ones vanish entirely. The spins of the system in this case reach different steady states depending on their positions in the lattice. However, the inhomogeneity of the field shows no effect on the entanglement in the completely isotropic (XXX) system, which vanishes asymptotically under any system configuration and the spins relax to a separable (disentangled) steady state with all the spins reaching a common spin state. Interestingly, applying the same field to a partially anisotropic (XYZ) system does not just enhance the nearest neighbor entanglements and their thermal robustness but all the long-range ones as well, while the spins relax asymptotically to very distinguished spin states, which is a sign of a critical behavior taking place at this combination of system anisotropy and field inhomogeneity.


Sign in / Sign up

Export Citation Format

Share Document