Related papers: On Sampling from Ising Models with Spectral Constr…
We consider the problem of finding a dense submatrix of a matrix with i.i.d. Gaussian entries, where density is measured by average value. This problem arose from practical applications in biology and social sciences…
We study the single-site Glauber dynamics for the fugacity $\lambda$, Hard-core model on the random graph $G(n, d/n)$. We show that for the typical instances of the random graph $G(n,d/n)$ and for fugacity $\lambda <…
The dynamics of the one-dimensional random transverse Ising model with both nearest-neighbor (NN) and next-nearest-neighbor (NNN) interactions is studied in the high-temperature limit by the method of recurrence relations. Both the…
Low temperature dynamics of Ising ferromagnets under finite magnetic fields are studied in terms of quantum spin representations of stochastic evolution operators. These are constructed for the Glauber dynamic as well as for a modification…
This paper studies structure detection problems in high temperature ferromagnetic (positive interaction only) Ising models. The goal is to distinguish whether the underlying graph is empty, i.e., the model consists of independent Rademacher…
Sampling methods (e.g., node-wise, layer-wise, or subgraph) has become an indispensable strategy to speed up training large-scale Graph Neural Networks (GNNs). However, existing sampling methods are mostly based on the graph structural…
We consider the densest $k$-subgraph problem, which seeks to identify the $k$-node subgraph of a given input graph with maximum number of edges. This problem is well-known to be NP-hard, by reduction to the maximum clique problem. We…
The replicated field theory of the random field Ising model involves the couplings of replicas of different indices. The resulting correlation functions involve a superposition of different types of long distance behaviours. However the…
Approximate subgraph matching (ASM) is a task that determines the approximate presence of a given query graph in a large target graph. Being an NP-hard problem, ASM is critical in graph analysis with a myriad of applications ranging from…
We develop a new modeling framework for Inter-Subject Analysis (ISA). The goal of ISA is to explore the dependency structure between different subjects with the intra-subject dependency as nuisance. It has important applications in…
The Ising model, in presence of an external magnetic field, is isomorphic to a model of localized interacting particles satisfying the Fermi statistics. By using this isomorphism, we construct a general solution of the Ising model which…
We provide a general framework for computing lower-bounds on the sample complexity of recovering the underlying graphs of Ising models, given i.i.d samples. While there have been recent results for specific graph classes, these involve…
We prove an optimal mixing time bound on the single-site update Markov chain known as the Glauber dynamics or Gibbs sampling in a variety of settings. Our work presents an improved version of the spectral independence approach of Anari et…
Motivated by a sampling problem basic to computational statistical inference, we develop a nearly optimal algorithm for a fundamental problem in spectral graph theory and numerical analysis. Given an $n\times n$ SDDM matrix ${\bf…
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…
The spatial photonic Ising machine (SPIM) [D. Pierangeli et al., Phys. Rev. Lett. 122, 213902 (2019)] is a promising optical architecture utilizing spatial light modulation for solving large-scale combinatorial optimization problems…
We study the computational complexity of approximating the partition function of the ferromagnetic Ising model with the external field parameter $\lambda$ on the unit circle in the complex plane. Complex-valued parameters for the Ising…
In this paper we consider the Glauber dynamics for a disordered ferromagnetic Ising model, in the region of phase coexistence. It was conjectured several decades ago that the spin autocorrelation decays as a negative power of time [Huse and…
Obtaining high certainty in predictive models is crucial for making informed and trustworthy decisions in many scientific and engineering domains. However, extensive experimentation required for model accuracy can be both costly and…
We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…