相关论文: High-Temperature Structure Detection in Ferromagne…
This paper develops results for the next nearest neighbour Ising model on random graphs. Besides being an essential ingredient in classic models for frustrated systems, second neighbour interactions interactions arise naturally in several…
A review is given on some recent developments in the theory of the Ising model in a random field. This model is a good representation of a large number of impure materials. After a short repetition of earlier arguments, which prove the…
We consider the problem of reconstructing the graph underlying an Ising model from i.i.d. samples. Over the last fifteen years this problem has been of significant interest in the statistics, machine learning, and statistical physics…
In this paper, we study the effect of dependence on detecting a class of signals in Ising models, where the signals are present in a structured way. Examples include Ising Models on lattices, and Mean-Field type Ising Models…
The arguments supporting the existence of the intrinsic magnetism in carbon-based materials including pure graphene were analyzed critically together with the numerous experimental evidences denying the magnetism in these materials. The…
We study the problem of detecting the presence of an underlying high-dimensional geometric structure in a random graph. Under the null hypothesis, the observed graph is a realization of an Erd\H{o}s-R\'enyi random graph $G(n,p)$. Under the…
We present a detailed study of the phase diagram of the Ising model in random graphs with arbitrary degree distribution. By using the replica method we compute exactly the value of the critical temperature and the associated critical…
This paper deals with the fault detection and isolation (FDI) problem for linear structured systems in which the system matrices are given by zero/nonzero/arbitrary pattern matrices. In this paper, we follow a geometric approach to verify…
We analyze the ferromagnetic Ising model on a scale-free tree; the growing random network model with the linear attachment kernel $A_k=k+\alpha$ introduced by [Krapivsky et al.: Phys. Rev. Lett. {\bf 85} (2000) 4629-4632]. We derive an…
We consider the task of learning Ising models when the signs of different random variables are flipped independently with possibly unequal, unknown probabilities. In this paper, we focus on the problem of robust estimation of…
In this paper, we study the task of detecting the edge dependency between two weighted random graphs. We formulate this task as a simple hypothesis testing problem, where under the null hypothesis, the two observed graphs are statistically…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
We consider the ferromagnetic Ising model on a sequence of graphs $G_n$ converging locally weakly to a rooted random tree. Generalizing [Montanari, Mossel, Sly '11], under an appropriate "continuity" property, we show that the Ising…
We study ground states of Ising models with random ferromagnetic couplings, proving the triviality of all zero-temperature metastates. This unexpected result sheds a new light on the properties of these systems, putting strong restrictions…
Correlation analysis is a fundamental problem in statistics. In this paper, we consider the correlation detection problem between a pair of Erdos-Renyi graphs. Specifically, the problem is formulated as a hypothesis testing problem: under…
Theoretical calculations, based on hybrid exchange density functional theory, are used to show that in graphene a periodic array of defects generates a ferromagnetic ground state at room temperature for unexpectedly large defect…
We consider the following two algorithmic problems: given a graph $G$ and a subgraph $H\subseteq G$, decide whether $H$ is an isometric or a geodesically convex subgraph of $G$. It is relatively easy to see that the problems can be solved…
We consider the problem of high-dimensional Ising (graphical) model selection. We propose a simple algorithm for structure estimation based on the thresholding of the empirical conditional variation distances. We introduce a novel criterion…
We consider the Ising systems in $d$ dimensions with nearest-neighbor ferromagnetic interactions and long-range repulsive (antiferromagnetic) interactions which decay with a power, $s$, of the distance. The physical context of such models…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…