Increasing forests and quadrangulations via a bijective approach

نویسنده

  • Jérémie Bettinelli
چکیده

In this work, we expose four bijections each allowing to increase (or decrease) one parameter in either uniform random forests with a fixed number of edges and trees, or quadrangulations with a boundary having a fixed number of faces and a fixed boundary length. In particular, this gives a way to sample a uniform quadrangulation with n + 1 faces from a uniform quadrangulation with n faces or a uniform forest with n + 1 edges and p trees from a uniform forest with n edges and p trees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generic Method for Bijections between Blossoming Trees and Planar Maps

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our method generalizes a previous construction of Bernardi by loosening its conditions of application so as to include annular maps, that is maps embedded in the p...

متن کامل

A unified bijective method for maps: application to two classes with boundaries

Based on a construction of the first author, we present a general bijection between certain decorated plane trees and certain orientations of planar maps with no counterclockwise circuit. Many natural classes of maps (e.g. Eulerian maps, simple triangulations,...) are in bijection with a subset of these orientations, and our construction restricts in a simple way on the subset. This gives a gen...

متن کامل

A Bijective Proof for Reciprocity Theorem

In this paper, we study the graph polynomial that records spanning rooted forests fG of a given graph. This polynomial has a remarkable reciprocity property. We give a new bijective proof for this theorem which has Prüfer coding as a special case.

متن کامل

Uniform random sampling of simple branched coverings of the sphere by itself

We present the first polynomial uniform random sampling algorithm for simple branched coverings of the sphere by itself of degree n. More precisely, our algorithm generates in linear time increasing quadrangulations, which are equivalent combinatorial structures. Our result is based on the identification of some canonical labelled spanning trees, and yields a constructive proof of a celebrated ...

متن کامل

Monitoring Land Cover Changes of Forests and Coastal Areas of Northern Iran (1988-2010): A Remote Sensing Approach

Caspian Sea coastline in the Mazandaran province has been altered as a result of activities of developers attracted to aesthetic and coastal recreational aspects of forest ecosystems. Advances in GIS and RS techniques, has made it possible to study the coastal areas for better management. Hence, the present study was undertaken to determine land cover changes via applying cross classificat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 122  شماره 

صفحات  -

تاریخ انتشار 2014