Le modèle de dimères modélise la répartition de molécules diatomiques à la surface d'un cristal. Nous supposons que le réseau vérifie une condition géométrique appelée isoradialité, et que les arêtes du réseau sont munies de la fonction de poids critique. Le modèle a alors un comportement "critique", il n'a que 2 phases possibles, solide ou liquide, au lieu de 3 en général. Nous obtenons 3 résultats pour le modèle de dimères isoradial. Nous prouvons une formule explicite pour le taux de croissance de la fonction de partition de l'exhaustion naturelle, et pour la mesure de Gibbs d'entropie maximale. L'originalité et l'intérêt de ces 2 formules résident dans le fait qu'elles ne dépendent que de la géométrie locale du graphe. Nous pensons que ...
The dimer model, also known as the perfect matching model, is a probabilistic model originally intro...
We study random surfaces which arise as height functions of random perfect matchings (a.k.a. dimer c...
The dimer model on a finite bipartite graph is a uniformly chosen perfect matching, i.e., a set of e...
Le modèle de dimères est un système de mécanique statistique qui modélise l'adsorption de molécules ...
rapporteurs : Reshetikhin Nicolas, Sheffield ScottThe dimer model is a system from statistical mecha...
The dimer model is a probability measure on perfect matchings (or dimer configurations)on a graph. D...
The dimer model is a probability measure on perfect matchings (or dimer configurations)on a graph. D...
32 pages, 4 figures (arXiv version, title has changed)International audienceWe consider dimer models...
32 pages, 4 figures (arXiv version, title has changed)International audienceWe consider dimer models...
32 pages, 4 figures (arXiv version, title has changed)International audienceWe consider dimer models...
32 pages, 4 figures (arXiv version, title has changed)International audienceWe consider dimer models...
32 pages, 4 figures (arXiv version, title has changed)International audienceWe consider dimer models...
22 pagesIsoradial graphs are a natural generalization of regular graphs which give, for many models ...
Le modèle de dimères, également connu sous le nom de modèle de couplage parfait, est un modèle proba...
The dimer model, also known as the perfect matching model, is a probabilistic model originally intro...
The dimer model, also known as the perfect matching model, is a probabilistic model originally intro...
We study random surfaces which arise as height functions of random perfect matchings (a.k.a. dimer c...
The dimer model on a finite bipartite graph is a uniformly chosen perfect matching, i.e., a set of e...
Le modèle de dimères est un système de mécanique statistique qui modélise l'adsorption de molécules ...
rapporteurs : Reshetikhin Nicolas, Sheffield ScottThe dimer model is a system from statistical mecha...
The dimer model is a probability measure on perfect matchings (or dimer configurations)on a graph. D...
The dimer model is a probability measure on perfect matchings (or dimer configurations)on a graph. D...
32 pages, 4 figures (arXiv version, title has changed)International audienceWe consider dimer models...
32 pages, 4 figures (arXiv version, title has changed)International audienceWe consider dimer models...
32 pages, 4 figures (arXiv version, title has changed)International audienceWe consider dimer models...
32 pages, 4 figures (arXiv version, title has changed)International audienceWe consider dimer models...
32 pages, 4 figures (arXiv version, title has changed)International audienceWe consider dimer models...
22 pagesIsoradial graphs are a natural generalization of regular graphs which give, for many models ...
Le modèle de dimères, également connu sous le nom de modèle de couplage parfait, est un modèle proba...
The dimer model, also known as the perfect matching model, is a probabilistic model originally intro...
The dimer model, also known as the perfect matching model, is a probabilistic model originally intro...
We study random surfaces which arise as height functions of random perfect matchings (a.k.a. dimer c...
The dimer model on a finite bipartite graph is a uniformly chosen perfect matching, i.e., a set of e...