Related papers: A recursive approach to the O(n) model on random m…
We propose an $O(\log n)$-approximation algorithm for the bipartiteness ratio of undirected graphs introduced by Trevisan (SIAM Journal on Computing, vol. 41, no. 6, 2012), where $n$ is the number of vertices. Our approach extends the…
We compute the beta functions for the $O(N)^3$-invariant general sextic tensor model up to cubic order in the coupling constant, and at leading order in the $1/N$ expansion. Our method is a direct, explicit one, in the sense that we…
Linear mixed models with large imbalanced crossed random effects structures pose severe computational problems for maximum likelihood estimation and for Bayesian analysis. The costs can grow as fast as $N^{3/2}$ when there are N…
We use a tensor unfolding technique to prove a new identifiability result for discrete bipartite graphical models, which have a bipartite graph between an observed and a latent layer. This model family includes popular models such as…
Bipartite incidence graph sampling provides a unified representation of many sampling situations for the purpose of estimation, including the existing unconventional sampling methods, such as indirect, network or adaptive cluster sampling,…
The self-energy of the critical 3-dimensional O(N) model is calculated. The analysis is performed in the context of the Non-Perturbative Renormalization Group, by exploiting an approximation which takes into account contributions of an…
We calculate the relaxational dynamical critical behavior of systems of $O(n_\|)\oplus O(n_\perp)$ symmetry by renormalization group method within the minimal subtraction scheme in two loop order. The three different bicritical static…
We use scale invariant scattering theory to exactly determine the lines of renormalization group fixed points for $O(N)$-symmetric models with quenched disorder in two dimensions. Random fixed points are characterized by two disorder…
We first rephrase and unify known bijections between bipartite plane maps and labelled trees with the formalism of looptrees, which we argue to be both more relevant and technically simpler since the geometry of a looptree is explicitly…
We consider a generalized Riemann-Hurwitz formula as it may be applied to rational maps between projective varieties having an indeterminacy set and fold-like singularities. The case of a holomorphic branched covering map is recalled. Then…
We study the posterior distribution of the Bayesian multiple change-point regression problem when the number and the locations of the change-points are unknown. While it is relatively easy to apply the general theory to obtain the…
We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…
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…
A recent paper due to Duminil-Copin and Tassion from $2019$ introduces a novel argument for obtaining estimates on horizontal crossing probabilities of the Random-Cluster model, in which a range of four possible behaviors, through a…
We further explore the connection between holographic $O(n)$ tensor models and random matrices. First, we consider the simplest non-trivial uncolored tensor model and show that the results for the density of states, level spacing and…
In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be…
The effectiveness of the perturbative renormalization group approach at fixed space dimension d in the theory of critical phenomena is analyzed. Three models are considered: the O(N) model, the cubic model and the antiferromagnetic model…
In this paper we consider graph algorithms in models of computation where the space usage (random accessible storage, in addition to the read only input) is sublinear in the number of edges $m$ and the access to input data is constrained.…
We study the phase diagram of random outerplanar maps sampled according to non-negative Boltzmann weights that are assigned to each face of a map. We prove that for certain choices of weights the map looks like a rescaled version of its…
We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…