Related papers: Sums of Random Matrices and the Potts Model on Ran…
We present a method for calculating transfer matrices for the $q$-state Potts model partition functions $Z(G,q,v)$, for arbitrary $q$ and temperature variable $v$, on strip graphs $G$ of the square (sq), triangular (tri), and honeycomb (hc)…
We review the problem of BPS state counting described by the generalized quiver matrix model of ADHM type. In four dimensions the generating function of the counting gives the Nekrasov partition function and we obtain generalization in…
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…
We develop a field-theoretic representation for the configurations of an interface between two ordered phases of a q-state Potts model in two dimensions, in the solid-on-solid approximation. The model resembles the field theory of directed…
We present a general, rigorous theory of partition function zeros for lattice spin models depending on one complex parameter. First, we formulate a set of natural assumptions which are verified for a large class of spin models in a…
A generic method to investigate many-body continuous-variable systems is pedagogically presented. It is based on the notion of matrix product states (so-called MPS) and the algorithms thereof. The method is quite versatile and can be…
Scattering amplitudes for colored theories have recently been formulated in a new way, in terms of curves on surfaces. In this note we describe a canonical set of functions we call surface functions, associated to all orders in the…
We consider a Markov evolution of lozenge tilings of a quarter-plane and study its asymptotics at large times. One of the boundary rays serves as a reflecting wall. We observe frozen and liquid regions, prove convergence of the local…
We prove an inequality on decision trees on monotonic measures which generalizes the OSSS inequality on product spaces. As an application, we use this inequality to prove a number of new results on lattice spin models and their…
The $i$-dimensional plaquette random-cluster model on a finite cubical complex is the random complex of $i$-plaquettes with each configuration having probability proportional to $$p^{\text{# of plaquettes}}(1-p)^{\text{# of complementary…
We analyze a probabilistic algorithm for matching shapes modeled by planar regions under translations and rigid motions (rotation and translation). Given shapes $A$ and $B$, the algorithm computes a transformation $t$ such that with high…
This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general…
Using the random-cluster representation of the $q$-state Potts models we consider the pooling of data from cluster-update Monte Carlo simulations for different thermal couplings $K$ and number of states per spin $q$. Proper combination of…
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…
In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…
We find limit shapes for a family of multiplicative measures on the set of partitions, induced by exponential generating functions with expansive parameters, $a_k\sim Ck^{p-1}, k\to\infty, p>0$,where $C$ is a positive constant. The measures…
I review recent results and unsolved problems concerning the hard-core lattice gas and the q-coloring model (antiferromagnetic Potts model at zero temperature). For each model, I consider its equilibrium properties (uniqueness/nonuniqueness…
A connected component of a vertex-coloured graph is said to be colourful if all its vertices have different colours. By extension, a graph is colourful if all its connected components are colourful. Given a vertex-coloured graph $G$ and an…
Given a simple undirected graph $G=(V,E)$ and a partition of the vertex set $V$ into $p$ parts, the \textsc{Partition Coloring Problem} asks if we can select one vertex from each part of the partition such that the chromatic number of the…
We propose a new method of the analytical computation of the spectral dimension which is based on the equivalence of the random walk and the q-state Potts model with non-zero magnetic field in the limit $q\to 0$. Calculating the critical…