Related papers: A recursive approach to the O(n) model on random m…

Mapping an atomistic configuration to an $N$-point correlation of a field associated with the atomic positions (e.g. an atomic density) has emerged as an elegant and effective solution to represent structures as the input of…

We consider an $O(N)$ scalar field model with quartic interaction in $d$-dimensional Euclidean de Sitter space. In order to avoid the problems of the standard perturbative calculations for light and massless fields, we generalize to the…

We show that the large N expansion in the multi-trace 1 formal hermitian matrix model is governed by the topological recursion of [Eynard and Orantin, 2007] with initial conditions. In terms of a 1d gas of eigenvalues, this model includes -…

We discuss the asymptotic behaviour of random critical Boltzmann planar maps in which the degree of a typical face belongs to the domain of attraction of a stable law with index $\alpha \in (1,2]$. We prove that when conditioning such maps…

We introduce an extension of the diagrammatic rules in random matrix theory and apply it to nonhermitean random matrix models using the 1/N approximation. A number of one- and two-point functions are evaluated on their holomorphic and…

In the classically unbroken phase, 3d $O(N)$ symmetric $\phi^4$ vector models admit two equivalent descriptions connected by a strong-weak duality closely related to the one found by Chang and Magruder long ago. We determine the exact…

The multicritical points of the $O(N)$ invariant $N$ vector model in the large $N$ limit are reexamined. Of particular interest are the subtleties involved in the stability of the phase structure at critical dimensions. In the limit $N \to…

The loop $O(n)$ model is a model for a random collection of non-intersecting loops on the hexagonal lattice, which is believed to be in the same universality class as the spin $O(n)$ model. It has been predicted by Nienhuis that for $0\le…

We initiate the study of the Bipartite Contraction problem from the perspective of parameterized complexity. In this problem we are given a graph $G$ and an integer $k$, and the task is to determine whether we can obtain a bipartite graph…

We study fixed-points of scalar fields that transform in the bifundamental representation of $O(N)\times O(M)$ in $3-\epsilon$ dimensions, generalizing the classic tricritical sextic vector model. In the limit where $N$ is large but $M$ is…

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…

For every integer $n\geq 1$, we consider a random planar map $\mathcal{M}_n$ which is uniformly distributed over the class of all rooted bipartite planar maps with $n$ edges. We prove that the vertex set of $\mathcal{M}_n$ equipped with the…

We study a model of $n$ non-intersecting squared Bessel processes in the confluent case: all paths start at time $t = 0$ at the same positive value $x = a$, remain positive, and are conditioned to end at time $t = T$ at $x = 0$. In the…

In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…

The O(n) loop model on the honeycomb lattice with mixed ordinary and special boundary conditions is solved exactly by means of the Bethe ansatz. The calculation of the dominant finite-size corrections to the eigenspectrum yields the mixed…

We compute the generating functions of a O(n) model (loop gas model) on a random lattice of any topology. On the disc and the cylinder, they were already known, and here we compute all the other topologies. We find that the generating…

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…

We consider the problem of low-rank rectangular matrix completion in the regime where the matrix $M$ of size $n\times m$ is ``long", i.e., the aspect ratio $m/n$ diverges to infinity. Such matrices are of particular interest in the study of…

Given a set of $n$ red and $n$ blue points in the plane, we are interested in matching red points with blue points by straight line segments so that the segments do not cross. We develop a range of tools for dealing with the non-crossing…

Optical diffraction tomography relies on solving an inverse scattering problem governed by the wave equation. Classical reconstruction algorithms are based on linear approximations of the forward model (Born or Rytov), which limits their…