Related papers: The six-vertex model on random planar maps revisit…
We make a systematic study of matroidal mixed Eulerian numbers which are certain intersection numbers in the matroid Chow ring generalizing the mixed Eulerian numbers introduced by Postnikov. These numbers are shown to be valuative and obey…
The infinite discrete stable Boltzmann maps are "heavy-tailed" generalisations of the well-known Uniform Infinite Planar Quadrangulation. Very efficient tools to study these objects are Markovian step-by-step explorations of the lattice…
We propose an efficient Markov Chain Monte Carlo method for sampling equilibrium distributions for stochastic lattice models, capable of handling correctly long and short-range particle interactions. The proposed method is a Metropolis-type…
The goal of this paper is to demonstrate the general modeling and practical simulation of random equations with mixture model parameter random variables. Random equations, understood as stationary (non-dynamical) equations with parameters…
We consider estimation of the covariance matrix of a multivariate random vector under the constraint that certain covariances are zero. We first present an algorithm, which we call Iterative Conditional Fitting, for computing the maximum…
We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…
Complex analysis is a powerful tool to study classical integrable systems, statistical physics on the random lattice, random matrix theory, topological string theory,... All these topics share certain relations, called "loop equations" or…
The L1-regularized Gaussian maximum likelihood estimator (MLE) has been shown to have strong statistical guarantees in recovering a sparse inverse covariance matrix, or alternatively the underlying graph structure of a Gaussian Markov…
We present a new combinatorial approach to the Ising model incorporating arbitrary bond weights on planar graphs. In contrast to existing methodologies, the exact free energy is expressed as the determinant of a set of ordered and…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
The characteristic multi-dimensional integrals that represent physical quantities in random-matrix models, when calculated within the supersymmetry method, can be related to a class of integrals introduced in the context of two-dimensional…
The six-vertex model on an $N\times N$ square lattice with domain wall boundary conditions is considered. A Fredholm determinant representation for the partition function of the model is given. The kernel of the corresponding integral…
Recent work has shown that probabilistic models based on pairwise interactions-in the simplest case, the Ising model-provide surprisingly accurate descriptions of experiments on real biological networks ranging from neurons to genes.…
The trigonometric six-vertex model with domain wall boundary conditions and one partially reflecting end on a lattice of size $2n\times m$, $m\leq n$, is considered. The partition function is computed using the Izergin-Korepin method,…
We revisit, in a self contained way, the Markov property on planar maps and decorated planar maps from three perspectives. First, we characterize the laws on these planar maps that satisfy both the Markov property and rerooting invariance,…
The partition function of the symmetric (zero electric field) eight-vertex model on a square lattice can be formulated either in the original "electric" vertex format or in an equivalent "magnetic" Ising-spin format. In this paper, both…
In this paper, a simple proof of the convergence of the recent iterative algorithm by relaxed $(u, v)$-cocoercive mappings due to S. Imnang [S. Imnang, Viscosity iterative method for a new general system of variational inequalities in…
An effective method for optimizing path planning for a specific model of a 6-degree-of-freedom (6-DOF) robot manipulator is presented as part of the motion planning of the manipulator using computer algebra. We assume that we are given a…
We study vector quadrirational Yang-Baxter maps representing the momentum-energy transformation of two particles after elastic relativistic collisions. The collision maps admit Lax representations compatible with an r-matrix Poisson…
The lattice of flats $\mathcal L_M$ of a matroid $M$ is combinatorially well-behaved and, when $M$ is realizable, admits a geometric model in the form of a "Schubert variety of hyperplane arrangement". In contrast, the lattice of flats of a…