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

We consider the problem of sampling from the Ising model when the underlying interaction matrix has eigenvalues lying within an interval of length $\gamma$. Recent work in this setting has shown various algorithmic results that apply…

The data-driven characterization of the ``complexity'' present in dynamical systems remains an open problem with broad applications across the physical sciences. We investigate the ``structural complexity'' of the 2D ferromagnetic Ising…

How complex is an Ising model? Usually, this is measured by the computational complexity of its ground state energy problem. Yet, this complexity measure only distinguishes between planar and non-planar interaction graphs, and thus fails to…

We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the "cavity" prediction for…

We study a ferromagnetic Ising model on random graphs with a power-law degree distribution and compute the thermodynamic limit of the pressure when the mean degree is finite (degree exponent $\tau>2$), for which the random graph has a…

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…

There is proposed a model of scale-free random graphs which are locally close to the uncorrelated complex random networks with divergent $\langle k^2 \rangle$ studied in e.g. S. N. Dorogovtsev {\it et al}, Rev. Mod. Phys. {\bf 80}, 1275…

We study the problem of testing for the presence of random effects in mixed models with high-dimensional fixed effects. To this end, we propose a rank-based graph-theoretic approach to test whether a collection of random effects is zero.…

Thermodynamic properties of the ferromagnetic Ising model on the hierarchical pentagon lattice is studied by means of the tensor network methods. The lattice consists of pentagons, where 3 or 4 of them meet at each vertex. Correlation…

We show using extensive simulation results and physical arguments that an Ising system on a two dimensional square lattice, having interactions of random sign between first neighbors and ferromagnetic interactions between second neighbors,…

We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…

Heat is a familiar form of energy transported from a hot side to a colder side of an object, but not a notion associated with microscopic measurements of electronic properties. A temperature difference within a material causes charge…

We consider the problem of estimating the partition function of the ferromagnetic Ising model in a consistent external magnetic field. The estimation is done via importance sampling in the dual of the Forney factor graph representing the…

The main problem in the area of graph property testing is to understand which graph properties are \emph{testable}, which means that with constantly many queries to any input graph $G$, a tester can decide with good probability whether $G$…

We revisit classical bounds of M. E. Fisher on the ferromagnetic Ising model, and show how to efficiently use them on an arbitrary given graph to rigorously upper-bound the partition function, magnetizations, and correlations. The results…

High-dimensional feature selection is a central problem in a variety of application domains such as machine learning, image analysis, and genomics. In this paper, we propose graph-based tests as a useful basis for feature selection. We…

Graph-based tests are a class of non-parametric two-sample tests useful for analyzing high-dimensional data. The test statistics are constructed from similarity graphs (such as K-minimum spanning tree), and consequently, their performance…

The Ising model in uncorrelated scale-free networks has been studied by means of Monte Carlo simulations. These networks are characterized by a degree (or connectivity) distribution $P(k) \sim k^{-\gamma}$. The ferromagnetic-paramagnetic…

We study the ferromagnetic Ising model on the infinite $d$-regular tree under the free boundary condition. This model is known to be a factor of IID in the uniqueness regime, when the inverse temperature $\beta\ge 0$ satisfies $\tanh \beta…

We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…