相关论文: High-Temperature Structure Detection in Ferromagne…
We prove that the pressure (or free energy) of the finite range ferromagnetic Ising model on $\mathbb{Z}^d$ is analytic as a function of both the inverse temperature $\beta$ and the magnetic field $h$ whenever the model has the exponential…
Ferromagnetism emerges when the Moire superlattice formed by stacking two graphene monolayers in a magic twist angle are filled with integer number electrons. This work investigates the ferromagnetism based on the Ising models for a…
We study classical Ising spin-$\frac{1}{2}$ models on the 2D square lattice with ferromagnetic or antiferromagnetic nearest-neighbor interactions, under the effect of a pure imaginary magnetic field. The complex Boltzmann weights of spin…
The planted densest subgraph detection problem refers to the task of testing whether in a given (random) graph there is a subgraph that is unusually dense. Specifically, we observe an undirected and unweighted graph on $n$ vertices. Under…
The emergence of complex modulated structures in the magnetization pattern of thin films is a well-established experimental phenomenology caused by the frustrating effects of competing interactions. Using a coarse-grained version of the…
We find the exact critical temperature $T_c$ of the nearest-neighbor ferromagnetic Ising model on an `equilibrium' random graph with an arbitrary degree distribution $P(k)$. We observe an anomalous behavior of the magnetization, magnetic…
The Ising model on ``thin'' graphs (standard Feynman diagrams) displays several interesting properties. For ferromagnetic couplings there is a mean field phase transition at the corresponding Bethe lattice transition point. For…
Vertex integrity is a graph parameter that measures the connectivity of a graph. Informally, its meaning is that a graph has small vertex integrity if it has a small separator whose removal disconnects the graph into connected components…
Graph structure learning aims to learn connectivity in a graph from data. It is particularly important for many computer vision related tasks since no explicit graph structure is available for images for most cases. A natural way to…
The high-transition-temperature (high-Tc) superconductivity discovered recently in iron pnictides is analyzed within a perturbation theory. Specifically, the probable pairing symmetry, the doping dependence of the transition temperature and…
We study two fundamental problems related to finding subgraphs: (1) given graphs G and H, Subgraph Test asks if H is isomorphic to a subgraph of G, (2) given graphs G, H, and an integer t, Packing asks if G contains t vertex-disjoint…
The chaotic properties of the three-site antiferromagnetic Ising model on Husimi tree are investigated in magnetic field. Macroscopic quantity of three-site antiferromagnetic Ising model is generated by one dimensional map. It is shown that…
Three dimensional Ising model ferromagnets on different lattices with nearest neighbor interactions, and on simple cubic lattices with equivalent interactions out to further neighbors, are studied numerically. The susceptibility data for…
At low temperatures, the classical two-dimensional random bond Ising model undergoes a frustration-driven ferromagnet-to-paramagnet transition controlled by a zero-temperature fixed point separating ferromagnet and spin glass phases. We…
The parallel-tempering method has been applied to numerically study the thermodynamic behavior of a three-dimensional disordered antiferromagnetic Ising model with random fields at spin concentrations corresponding to regions of both weak…
The problem of structure estimation in graphical models with latent variables is considered. We characterize conditions for tractable graph estimation and develop efficient methods with provable guarantees. We consider models where the…
Graph connectivity is a fundamental combinatorial optimization problem that arises in many practical applications, where usually a spanning subgraph of a network is used for its operation. However, in the real world, links may fail…
We study numerically the region above the critical temperature of the four dimensional Random Field Ising Model. Using a cluster dynamic we measure the connected and disconnected magnetic susceptibility and the connected and disconnected…
In this article we shortly review previous and recently published experimental results that provide evidence for intrinsic, magnetic-impurity-free ferromagnetism and for high-temperature superconductivity in carbon-based materials. The…
We introduce a weighed-loop algorithm that is applicable to any weighed graph network. It is designed to prefer a route of energetically unfavourable bonds in the lattice that can then be flipped without changing the structure inside and…