Mendes Oulamara
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Mendes Oulamara has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Marc Lelarge
DI/ENS INRIA PSL Research University Paris France
2 shared publications - Alex Karrila
Department of Mathematics and Systems Analysis, Aalto University School of Science, Finland
1 shared publication - Arnaud J. Venet
Carnegie Mellon University
1 shared publication - Hugo Duminil-Copin
Institut des Hautes Études Scientifiques, Bures-sur-Yvette, France
1 shared publication - Ioan Manolescu
Université de Fribourg, Fribourg, Switzerland
1 shared publication
Latest Publications
- 7 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Random geometry and free energy of critical planar lattice models
Géométrie aléatoire et énergie libre de modèles critiques sur réseau planaire: Dans cette thèse, nous nous intéressons aux conséquences de l'expression de l'énergie libre du modèle six-vertex sur deux modèles planaires, la percolation de Fortuin-Kasteleyn (FK) et la fonction de hauteur du modèle six-vertex. Nous prouvons l'invariance par rotation macroscopique de la percolation FK critique sur le réseau carré pour q ε [1,4]. Pour cela, nous prouvons l'universalité de ce modèle sur les graphes isoradiaux rectangulaires. L'Incipient Infinite Cluster nous permet alors l'étude locale de la géométrie des composantes connexes macroscopiques. Nous démontrons ensuite la délocalisation logarithmique de la fonction de hauteur du modèle six-vertex pour a = b = 1 et 1 ≤ c ≤ 2. Pour cela, nous construisons une théorie de Russo-Seymmour-Welsh pour ses ensembles de niveau. Dans une section bibliographique, nous exposons le formalisme de lignes de rapidité des graphes isoradiaux et les équations q-Knizhnik-Zamolodchikov.
- 7 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Random geometry and free energy of critical planar lattice models
Géométrie aléatoire et énergie libre de modèles critiques sur réseau planaire: Dans cette thèse, nous nous intéressons aux conséquences de l'expression de l'énergie libre du modèle six-vertex sur deux modèles planaires, la percolation de Fortuin-Kasteleyn (FK) et la fonction de hauteur du modèle six-vertex. Nous prouvons l'invariance par rotation macroscopique de la percolation FK critique sur le réseau carré pour q ε [1,4]. Pour cela, nous prouvons l'universalité de ce modèle sur les graphes isoradiaux rectangulaires. L'Incipient Infinite Cluster nous permet alors l'étude locale de la géométrie des composantes connexes macroscopiques. Nous démontrons ensuite la délocalisation logarithmique de la fonction de hauteur du modèle six-vertex pour a = b = 1 et 1 ≤ c ≤ 2. Pour cela, nous construisons une théorie de Russo-Seymmour-Welsh pour ses ensembles de niveau. Dans une section bibliographique, nous exposons le formalisme de lignes de rapidité des graphes isoradiaux et les équations q-Knizhnik-Zamolodchikov.
- Open Access
- 27 February 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of the European Mathematical Society
- Vol. 26 (11) , 4131-4190
Delocalization of the height function of the six-vertex model
We show that the height function of the six-vertex model, in the parameter range \mathbf{a}=\mathbf{b}=1 and \mathbf{c}\ge1 , is delocalized with logarithmic variance when \mathbf{c}\le 2 . This complements the earlier proven localization for \mathbf{c}>2 . Our proof relies on Russo–Seymour–Welsh type arguments, and on the local behaviour of the free energy of the cylindrical six-vertex model, as a function of the unbalance between the number of up and down arrows.
- 27 February 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of the European Mathematical Society
- Vol. 26 (11) , 4131-4190
Open AccessDelocalization of the height function of the six-vertex model
We show that the height function of the six-vertex model, in the parameter range \mathbf{a}=\mathbf{b}=1 and \mathbf{c}\ge1 , is delocalized with logarithmic variance when \mathbf{c}\le 2 . This complements the earlier proven localization for \mathbf{c}>2 . Our proof relies on Russo–Seymour–Welsh type arguments, and on the local behaviour of the free energy of the cylindrical six-vertex model, as a function of the unbalance between the number of up and down arrows.
- 3 February 2018
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 173 (3-4) , 917-940
Replica Bounds by Combinatorial Interpolation for Diluted Spin Systems
- 3 February 2018
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 173 (3-4) , 917-940
Replica Bounds by Combinatorial Interpolation for Diluted Spin Systems
- Open Access
Replica Bounds by Combinatorial Interpolation for Diluted Spin Systems
In two papers Franz, Leone and Toninelli proved bounds for the free energy of diluted random constraints satisfaction problems, for a Poisson degree distribution [5] and a general distribution [6]. Panchenko and Talagrand [16] simplified the proof and generalized the result of [5] for the Poisson case. We provide a new proof for the general degree distribution case and as a corollary, we obtain new bounds for the size of the largest independent set (also known as hard core model) in a large random regular graph. Our proof uses a combinatorial interpolation based on biased random walks [21] and allows to bypass the arguments in [6] based on the study of the Sherrington-Kirkpatrick (SK) model.
Open AccessReplica Bounds by Combinatorial Interpolation for Diluted Spin Systems
In two papers Franz, Leone and Toninelli proved bounds for the free energy of diluted random constraints satisfaction problems, for a Poisson degree distribution [5] and a general distribution [6]. Panchenko and Talagrand [16] simplified the proof and generalized the result of [5] for the Poisson case. We provide a new proof for the general degree distribution case and as a corollary, we obtain new bounds for the size of the largest independent set (also known as hard core model) in a large random regular graph. Our proof uses a combinatorial interpolation based on biased random walks [21] and allows to bypass the arguments in [6] based on the study of the Sherrington-Kirkpatrick (SK) model.
- 16 July 2015
- Published by Springer Nature
- p. 415-430
Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation
- 16 July 2015
- Published by Springer Nature
- p. 415-430
Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation