相关论文: High-Temperature Structure Detection in Ferromagne…
The $H$-Induced Minor Containment problem ($H$-IMC) consists in deciding if a fixed graph $H$ is an induced minor of a graph $G$ given as input, that is, whether $H$ can be obtained from $G$ by deleting vertices and contracting edges.…
The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general…
Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \cite{Goodman1949} and Frank \cite{Frank1978}. We revisit a problem formulated by Frank…
Understanding and predicting thermal transport in disordered materials remains a significant challenge due to the absence of periodicity and the complex nature of medium-range structural motifs. In this work, we investigate amorphous…
Experimental advances in condensed matter physics and material science have enabled ready access to atomic-resolution images, with resolution of modern tools often sufficient to extract minute details of symmetry-breaking distortions such…
In many statistical applications, the dimension is too large to handle for standard high-dimensional machine learning procedures. This is particularly true for graphical models, where the interpretation of a large graph is difficult and…
We give an isomorphism test that runs in time $n^{\operatorname{polylog}(h)}$ on all $n$-vertex graphs excluding some $h$-vertex vertex graph as a topological subgraph. Previous results state that isomorphism for such graphs can be tested…
Finite 3D Ising ferromagnets are studied in periodic magnetic fields both by computer simulations and mean-field theoretical approaches. The phenomenon of stochastic resonance is revealed. The characteristic peak obtained for the…
The magnetic properties of disordered graphene and irradiated graphite are systematically studied using a combination of mean-field Hubbard model and first-principles calculations. By considering large-scale disordered models of graphene, I…
We study the two and three-dimensional Antiferromagnetic Ising Model with an imaginary magnetic field $i\theta$ at $\theta = \pi$. We use a new geometric algorithm which does not present a sign problem. This allows us to perform efficient…
Activated transitions have rates that are often exponentially small in system size. Extracting the associated activation barriers is challenging in practice, especially in the deeply metastable regimes and in the presence of disorder. Here,…
The one-dimensional Ising model in an external magnetic field with uniform long-range interactions and random short-range interactions satisfying bimodal annealed distributions is studied. This generalizes the random model discussed by…
The emergence of bulk carbon ferromagnetism is long-expected over years. At nanoscale, carbon ferromagnetism was detected by analyzing the magnetic edge states via scanning tunneling microscopy(STM), and its origin can be explained by local…
We prove the existence of spontaneous symmetry breaking in suitably low-energy eigenstates of certain gapless and frustrated many-body quantum systems, namely symmetric quantum perturbations to classical models which exhibit spontaneous…
We calculate the temperature dependent conductivity of graphene in the presence of randomly distributed Coulomb impurity charges arising from the temperature dependent screening of the Coulomb disorder without any phonons. The purely…
Low-rank matrix completion is the task of recovering unknown entries of a matrix by assuming that the true matrix admits a good low-rank approximation. Sometimes additional information about the variables is known, and incorporating this…
Property Testing is a formal framework to study the computational power and complexity of sampling from combinatorial objects. A central goal in standard graph property testing is to understand which graph properties are testable with…
We study a model of fully-packed dimer configurations (or perfect matchings) on a bipartite periodic graph that is two-dimensional but not planar. The graph is obtained from $\mathbb Z^2$ via the addition of an extensive number of extra…
We report new results on complex-temperature properties of Ising models. These include studies of the $s=1/2$ model on triangular, honeycomb, kagom\'e, $3 \cdot 12^2$, and $4 \cdot 8^2$ lattices. We elucidate the complex--$T$ phase diagrams…
We provide a simple characterization of the critical temperature for the Ising model on an arbitrary planar doubly periodic weighted graph. More precisely, the critical inverse temperature \beta for a graph G with coupling constants…