相关论文: High-Temperature Structure Detection in Ferromagne…

Given a family $\mathcal{F}$ of graphs, a graph is \emph{$\mathcal{F}$-subgraph-free} if it has no subgraph isomorphic to a member of $\mathcal{F}$. We present a fixed-parameter linear-time algorithm that decides whether a planar graph can…

Room temperature coexistence of ferromagnetism and ferroelectricity in a thin film of a novel material of nominal composition PbTi0.5Fe0.5O3-d is probed by standard ferroelectric and ferromagnetic hysteresis loop measurements and by…

One of the fundamental task in graph data mining is to find a planted community(dense subgraph), which has wide application in biology, finance, spam detection and so on. For a real network data, the existence of a dense subgraph is…

In this paper, we investigate the complexity of Maximum Independent Set (MIS) in the class of $H$-free graphs, that is, graphs excluding a fixed graph as an induced subgraph. Given that the problem remains $NP$-hard for most graphs $H$, we…

The ferromagnetic XY model on sparse random graphs in a randomly oriented field is analyzed via the belief propagation algorithm. At variance with the fully connected case and with the random field Ising model on the same topology, we find…

We consider pairs of few-body Ising models where each spin enters a bounded number of interaction terms (bonds), such that each model can be obtained from the dual of the other after freezing $k$ spins on large-degree sites. Such a pair of…

The antiferromagnetic Ising model in uncorrelated scale-free networks has been studied by means of Monte Carlo simulations. These networks are characterized by a connectivity (or degree) distribution P(k) ~ k^(- gamma). The disorder present…

We study joint estimation of the inverse temperature and magnetization parameters $(\beta,B)$ of an Ising model with a non-negative coupling matrix $A_n$ of size $n\times n$, given one sample from the Ising model. We give a general bound on…

A dilute Ising ferromagnet is considered in this study using renormalization group techniques with a hierarchical lattice. A series of phase diagrams have been produced that probe the effects of varying the temperature and concentration of…

Testing the validity of probabilistic models containing unmeasured (hidden) variables is shown to be a hard task. We show that the task of testing whether models are structurally incompatible with the data at hand, requires an exponential…

We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…

We introduce a planted vertex cover problem on regular random graphs and study it by the cavity method of statistical mechanics. Different from conventional Ising models, the equilibrium ferromagnetic phase transition of this binary-spin…

Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph $F \in \mathcal{F}$. Many graph isomorphism relaxations such as (quantum) isomorphism…

We study the problem of detecting whether an inhomogeneous random graph contains a planted community. Specifically, we observe a single realization of a graph. Under the null hypothesis, this graph is a sample from an inhomogeneous random…

Graphene is a model system for the study of electrons confined to a strictly two-dimensional layer1 and a large number of electronic phenomena have been demonstrated in graphene, from the fractional2, 3 quantum Hall effect to…

We analyze the thermodynamic properties of the random-bond Ising model (RBIM) on closed hyperbolic surfaces using Monte Carlo and high-temperature series expansion techniques. We also analyze the dual-RBIM, that is the model that in the…

Ferromagnetism in carbon-based materials is appealing for both applications and fundamental science purposes because carbon is a light and bio-compatible material that contains only s and p electrons in contrast to traditional ferromagnets…

We study the problem of testing, using only a single sample, between mean field distributions (like Curie-Weiss, Erd\H{o}s-R\'enyi) and structured Gibbs distributions (like Ising model on sparse graphs and Exponential Random Graphs). Our…

Both the antiferromagnetic Ising model and the hard-core model could be said to be tractable on line graphs of bounded degree. For example, Glauber dynamics is rapidly mixing in both cases. In the case of the hard-core model, we know that…

We study theoretically the physical properties of a magnetic impurity in graphene. Within the Anderson model for a very strong Coulomb interaction on the impurity, we start from the Slave-Boson method and introduce a topological picture…