Related papers: The Cavity Approach to Parallel Dynamics of Ising …
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs…
We study the worst-case mixing time of the global Kawasaki dynamics for the fixed-magnetization Ising model on the class of graphs of maximum degree $\Delta$. Proving a conjecture of Carlson, Davies, Kolla, and Perkins, we show that below…
The dynamics of an asymmetric kinetic Ising model is studied. Two schemes for improving the existing mean-field description are proposed. In the first scheme, we derive the formulas for instantaneous magnetization, equal-time correlation,…
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…
We propose a method to identify nonlinear acyclic networks in continuous time when the dynamics are located on the edges and all the nodes are excited. We show that it is necessary and sufficient to measure all the sinks to identify any…
We study a statistical model describing the steady state distribution of the fluxes in a metabolic network. The resulting model on continuous variables can be solved by the cavity method. In particular analytical tractability is possible…
In this paper we study the phase diagram of two Ising planes coupled by a standard spin-spin interaction with bond randomness in each plane. The whole phase diagram is analyzed by help of Monte Carlo simulations and field theory arguments.
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles…
The approximation properties of a quadratic iso-parametric finite element method for a typical cavitation problem in nonlinear elasticity are analyzed. More precisely, (1) the finite element interpolation errors are established in terms of…
We present the results of a numerical simulation aimed at understanding the nature of the `c = 1 barrier' in two dimensional quantum gravity. We study multiple Ising models living on dynamical $\phi^3$ graphs and analyse the behaviour of…
This paper presents an alternative proof of the connection between the partition function of the Ising model on a finite graph $G$ and the set of non-backtracking walks on $G$. The techniques used also give formulas for spin-spin…
We define a 2-dimensional Ising model on a triangulated sphere, $\mathbb S^2$, designed to approach the exact conformal field theory (CFT) in the continuum limit. Surprisingly, the derivation leads to a set of geometric constraints that the…
Nonequilibrium kinetic Ising models evolving under the competing effect of spin flips at zero temperature and nearest neighbour spin exchanges at $T=\infty$ are investigated numerically from the point of view of a phase transition.…
We study dynamic graph algorithms in the Massively Parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of edge insertions and…
Ising model with quenched random magnetic fields is examined for single Gaussian, bimodal and double Gaussian random field distributions by introducing an effective field approximation that takes into account the correlations between…
In this paper we study the problem of dynamically maintaining graph properties under batches of edge insertions and deletions in the massively parallel model of computation. In this setting, the graph is stored on a number of machines, each…
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…
This paper considers the problem of distributed optimization over time-varying graphs. For the case of undirected graphs, we introduce a distributed algorithm, referred to as DIGing, based on a combination of a distributed inexact gradient…
The article deals with the description of the statistical behavior of Gaussian packets on a metric graph. Semiclassical asymptotics of solutions of the Cauchy problem for the Schr\"{o}dinger equation with initial data concentrated in the…