Related papers: The simplest nearest-neighbor spin system on regul…
We study random dynamical systems of certain continuous functions on the unit interval. We use bounded variation to provide sufficient conditions for unique ergodicity of these systems. Several classes of examples are provided.
A dynamic graph algorithm is a data structure that answers queries about a property of the current graph while supporting graph modifications such as edge insertions and deletions. Prior work has shown strong conditional lower bounds for…
We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Omega(n/psi(n)) for some function psi(n)=omega(1) of the instance size. We design new…
The frustrated spin-1/2 chain with weakly anisotropic ferromagnetic nearest-neighbor and antiferromagnetic next-nearest-neighbor exchanges is studied. We focus on the excitation spectrum and the low-temperature thermodynamics in the…
We study a nearest neighbors ferromagnetic spin system on the square lattice in which the spin field is constrained to take values in a discretization of the unit circle consisting of $N$ equi-spaced vectors, also known as $N$-clock model.…
We study the stochastic dynamics of Ising spin models with random bonds, interacting on finitely connected Poissonnian random graphs. We use the dynamical replica method to derive closed dynamical equations for the joint spin-field…
In this paper we determine the unique graph with minimum distance spectral radius among all connected graphs of fixed order and given edge connectivity.
The static and dynamic susceptibilities for a general class of mean field random orthogonal spherical spin glass models are studied. We show how the static and dynamical properties of the linear and nonlinear susceptibilities depend on the…
We analyze the collective spin noise in interacting spin systems. General expressions are derived for the short time behaviour of spin systems with general spin-spin interactions, and we suggest optimum experimental conditions for the…
We study the optimal estimation of probability matrices of random graph models generated from graphons. This problem has been extensively studied in the case of step-graphons and H\"older smooth graphons. In this work, we characterize the…
Fine-grained complexity theory is the area of theoretical computer science that proves conditional lower bounds based on the Strong Exponential Time Hypothesis and similar conjectures. This area has been thriving in the last decade, leading…
The approximation of nearest neighbor interaction (NNI) is widely used in short-time spin dynamics with dipole-dipole interactions (DDI) when the intensity of spin-spin interaction is $\sim 1/r^3$, where $r$ is a distance between those…
Global variational approximation methods in graphical models allow efficient approximate inference of complex posterior distributions by using a simpler model. The choice of the approximating model determines a tradeoff between the…
Graphs are ubiquitous to model the irregular (non-Euclidean) structure of complex data, but they are limited to pairwise relationships and fail to model the complexities of the datasets exhibiting higher-order interactions. In that context,…
We provide a new constant factor approximation algorithm for the (connected) distance-$r$ dominating set problem on graph classes of bounded expansion. Classes of bounded expansion include many familiar classes of sparse graphs such as…
A new expression for the Green's function of a finite one-dimensional lattice with nearest neighbor interaction is derived via discrete Fourier transform. Solution of the Heisenberg spin chain with periodic and open boundary conditions is…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
In this paper, we prove the existence of classical solutions for second order stationary mean-field game systems. These arise in ergodic (mean-field) optimal control, convex degenerate problems in calculus of variations, and in the study of…
The edge clique cover number $ecc(G)$ of a graph $G$ is the size of the smallest set of complete subgraphs whose union covers all edges of $G$. It has been conjectured that all the simple graphs with independence number two satisfy…
In this paper we calculate the mean number of metastable states for spin glasses on so called random thin graphs with couplings taken from a symmetric binary distribution $\pm J$. Thin graphs are graphs where the local connectivity of each…