2,552 research outputs found
Bijections and symmetries for the factorizations of the long cycle
We study the factorizations of the permutation into factors
of given cycle types. Using representation theory, Jackson obtained for each
an elegant formula for counting these factorizations according to the
number of cycles of each factor. In the cases Schaeffer and Vassilieva
gave a combinatorial proof of Jackson's formula, and Morales and Vassilieva
obtained more refined formulas exhibiting a surprising symmetry property. These
counting results are indicative of a rich combinatorial theory which has
remained elusive to this point, and it is the goal of this article to establish
a series of bijections which unveil some of the combinatorial properties of the
factorizations of into factors for all . We thereby obtain
refinements of Jackson's formulas which extend the cases treated by
Morales and Vassilieva. Our bijections are described in terms of
"constellations", which are graphs embedded in surfaces encoding the transitive
factorizations of permutations
Processes on Unimodular Random Networks
We investigate unimodular random networks. Our motivations include their
characterization via reversibility of an associated random walk and their
similarities to unimodular quasi-transitive graphs. We extend various theorems
concerning random walks, percolation, spanning forests, and amenability from
the known context of unimodular quasi-transitive graphs to the more general
context of unimodular random networks. We give properties of a trace associated
to unimodular random networks with applications to stochastic comparison of
continuous-time random walk.Comment: 66 pages; 3rd version corrects formula (4.4) -- the published version
is incorrect --, as well as a minor error in the proof of Proposition 4.10;
4th version corrects proof of Proposition 7.1; 5th version corrects proof of
Theorem 5.1; 6th version makes a few more minor correction
Creation and Growth of Components in a Random Hypergraph Process
Denote by an -component a connected -uniform hypergraph with
edges and vertices. We prove that the expected number of
creations of -component during a random hypergraph process tends to 1 as
and tend to with the total number of vertices such that
. Under the same conditions, we also show that
the expected number of vertices that ever belong to an -component is
approximately . As an immediate
consequence, it follows that with high probability the largest -component
during the process is of size . Our results
give insight about the size of giant components inside the phase transition of
random hypergraphs.Comment: R\'{e}sum\'{e} \'{e}tend
Random enriched trees with applications to random graphs
We establish limit theorems that describe the asymptotic local and global
geometric behaviour of random enriched trees considered up to symmetry. We
apply these general results to random unlabelled weighted rooted graphs and
uniform random unlabelled -trees that are rooted at a -clique of
distinguishable vertices. For both models we establish a Gromov--Hausdorff
scaling limit, a Benjamini--Schramm limit, and a local weak limit that
describes the asymptotic shape near the fixed root
A Complete Grammar for Decomposing a Family of Graphs into 3-connected Components
Tutte has described in the book "Connectivity in graphs" a canonical
decomposition of any graph into 3-connected components. In this article we
translate (using the language of symbolic combinatorics)
Tutte's decomposition into a general grammar expressing any family of graphs
(with some stability conditions) in terms of the 3-connected subfamily. A key
ingredient we use is an extension of the so-called dissymmetry theorem, which
yields negative signs in the grammar.
As a main application we recover in a purely combinatorial way the analytic
expression found by Gim\'enez and Noy for the series counting labelled planar
graphs (such an expression is crucial to do asymptotic enumeration and to
obtain limit laws of various parameters on random planar graphs). Besides the
grammar, an important ingredient of our method is a recent bijective
construction of planar maps by Bouttier, Di Francesco and Guitter.Comment: 39 page
Probability around the Quantum Gravity. Part 1: Pure Planar Gravity
In this paper we study stochastic dynamics which leaves quantum gravity
equilibrium distribution invariant. We start theoretical study of this dynamics
(earlier it was only used for Monte-Carlo simulation). Main new results concern
the existence and properties of local correlation functions in the
thermodynamic limit. The study of dynamics constitutes a third part of the
series of papers where more general class of processes were studied (but it is
self-contained), those processes have some universal significance in
probability and they cover most concrete processes, also they have many
examples in computer science and biology. At the same time the paper can serve
an introduction to quantum gravity for a probabilist: we give a rigorous
exposition of quantum gravity in the planar pure gravity case. Mostly we use
combinatorial techniques, instead of more popular in physics random matrix
models, the central point is the famous exponent.Comment: 40 pages, 11 figure
- …