Related papers: Efficient subgraph-based sampling of Ising-type mo…

Reducing a graph while preserving its overall properties is an important problem with many applications. Typically, reduction approaches either remove edges (sparsification) or merge nodes (coarsening) in an unsupervised way with no…

A simple model of a frustrated disordered system is presented. Apart from the (very different) physical interpretation, the model shares many features with that of Sherrington-Kirkpatrick for spin glasses, but, as a consequence of its…

A method is presented, which allows to sample directly low-temperature configurations of glassy systems, like spin glasses. The basic idea is to generate ground states and low lying excited configurations using a heuristic algorithm. Then,…

A disordered spin glass model where both static and dynamical properties depend on macroscopic magnetizations is presented. These magnetizations interact via random couplings and, therefore, the typical quenched realization of the system…

The scaling of fluctuations in the distribution of ground-state energies or costs with the system size N for Ising spin glasses is considered using an extensive set of simulations with the Extremal Optimization heuristic across a range of…

Sampling from distributions of implicitly defined shapes enables analysis of various energy functionals used for image segmentation. Recent work describes a computationally efficient Metropolis-Hastings method for accomplishing this task.…

Identifying the underlying models in a set of data points contaminated by noise and outliers, leads to a highly complex multi-model fitting problem. This problem can be posed as a clustering problem by the projection of higher order…

We propose a snapshots-based method to compute reduction subspaces for physics-based simulations. Our method is applicable to any mesh with some artistic prior knowledge of the solution and only requires a record of existing solutions…

Structural balance modeling for signed graph networks presents how to model the sources of conflicts. The state-of-the-art focuses on computing the frustration index of a signed graph, a critical step toward solving problems in social and…

We consider whether it is possible to find ground states of frustrated spin systems by solving them locally. Using spin glass physics and Imry-Ma arguments in addition to numerical benchmarks we quantify the power of such local solution…

By applying a recently proposed mapping, we derive exactly the upper phase boundary of several Ising spin glass models defined over static graphs and random graphs, generalizing some known results and providing new ones.

Inductive Recommender Systems are capable of recommending for new users and with new items thus avoiding the need to retrain after new data reaches the system. However, these methods are still trained on all the data available, requiring…

The Ising spin glass in two dimensions exhibits rich behavior with subtle differences in the scaling for different coupling distributions. We use recently developed mappings to graph-theoretic problems together with highly efficient…

Graph sampling via crawling has become increasingly popular and important in the study of measuring various characteristics of large scale complex networks. While powerful, it is known to be challenging when the graph is loosely connected…

As spin glass materials have extremely slow dynamics, devious numerical methods are needed to study low-temperature states. A simple and fast optimization version of the classical Kasteleyn treatment of the Ising model is described and…

Network (or graph) sparsification compresses a graph by removing inessential edges. By reducing the data volume, it accelerates or even facilitates many downstream analyses. Still, the accuracy of many sparsification methods, with…

Generalized Ising models, also known as cluster expansions, are an important tool in many areas of condensed-matter physics and materials science, as they are often used in the study of lattice thermodynamics, solid-solid phase transitions,…

The study of frustrated spin systems often requires time-consuming numerical simulations. As the simplest approach, the classical Ising model is often used to investigate the thermodynamic behavior of such systems. Exploiting the small…

Many scientific problems seek to find the ground state in a rugged energy landscape, a task that becomes prohibitively difficult for large systems. Within a particular class of problems, however, the short-range correlations within energy…

Graphs are naturally used to describe the structures of various real-world systems in biology, society, computer science etc., where subgraphs or motifs as basic blocks play an important role in function expression and information…