Related papers: Approximability of the Six-vertex Model
This paper addresses the modeling of fracture in quasi-brittle materials using a phase-field approach to the description of crack topology. Within the computational mechanics community, several studies have treated the issue of modeling…
The exponential family of random graphs represents an important and challenging class of network models. Despite their flexibility, conventionally used exponential random graphs have one shortcoming. They cannot directly model weighted…
We use the order complex corresponding to a symmetric matrix (defined by Giusti et al in 2015). In this note, we use it to define a class of models of random graphs, and show some surprising experimental results, showing sharp phase…
Complex networks has been a hot topic of research over the past several years over crossing many disciplines, starting from mathematics and computer science and ending by the social and biological sciences. Random graphs were studied to…
We study the approximation of stationary processes by a simple class of purely deterministic signals. This has an analytic counterpart in the approximation of symmetric positive definite Toeplitz matrices by submatrices of finite rank. We…
We study the structure of the phase diagram for systems consisting of 2- and 3- level particles dipolarly interacting with a 1-mode electromagnetic field, inside a cavity, paying particular attention to the case of a finite number of…
We apply here methods of inhomogeneous random graphs to a class of random distance graphs. This provides an example outside of the rank 1 models which is still solvable as long as the largest connected component is concerned. In particular,…
Aspects of the phase change of the two-level pairing model are investigated in the semi-classical treatment by using the variational approch with the mixed-mode coherent state. In the classical limit, $hbar \to 0$, the sharp phase…
A Markov process is constructed to numerically study the phase separation in the 6-vertex model with domain wall boundary conditions. It is a random walk on the graph where vertices are states and edges are elementary moves. It converges to…
Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…
The phase transition in the XY model on one-dimensional small-world networks is investigated by means of Monte-Carlo simulations. It is found that long-range order is present at finite temperatures, even for very small values of the…
Many complex networks are only a part of larger systems, where a number of coexisting topologies interact and depend on each other. We introduce a layered model to facilitate the description and analysis of such systems. As an example of…
An overview is given of the methods for treating complicated problems without small parameters, when the standard perturbation theory based on the existence of small parameters becomes useless. Such complicated problems are typical of…
We introduce a complex-extended continuum level density and apply it to one-dimensional scattering problems involving tunneling through finite-range potentials. We show that the real part of the density is proportional to a real "time…
We consider the homogeneous five-vertex model on a rectangle domain of the square lattice with so-called scalar-product boundary conditions. Peculiarity of these boundary conditions is that the configurations of the model are in an…
We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope. We describe properties of the polytope vertices and…
We present a Bethe approximation to study lattice models of linear polymers. The approach is variational in nature and based on the cluster variation method (CVM). We focus on a model with $(i)$ a nearest neighbor attractive energy…
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the independent set, neighborhood, and dominance complexes. We…
We study the stochastic six-vertex model on a strip $$\left\{(x,y)\in\mathbb{Z}^2: 0\leq y\leq x\leq y+N\right\}$$ with two open boundaries. We develop a `matrix product ansatz' method to solve for its stationary measure, based on the…
We study a recent generalization proposed for the XY model in two and three dimensions. Using both, the continuum limit and discrete lattice, we obtained the vortex configuration and shown that out-of-plane vortex solutions are deeply…