38 research outputs found
Fully Analyzing an Algebraic Polya Urn Model
This paper introduces and analyzes a particular class of Polya urns: balls
are of two colors, can only be added (the urns are said to be additive) and at
every step the same constant number of balls is added, thus only the color
compositions varies (the urns are said to be balanced). These properties make
this class of urns ideally suited for analysis from an "analytic combinatorics"
point-of-view, following in the footsteps of Flajolet-Dumas-Puyhaubert, 2006.
Through an algebraic generating function to which we apply a multiple
coalescing saddle-point method, we are able to give precise asymptotic results
for the probability distribution of the composition of the urn, as well as
local limit law and large deviation bounds.Comment: LATIN 2012, Arequipa : Peru (2012
Laws relating runs, long runs, and steps in gambler's ruin, with persistence in two strata
Define a certain gambler's ruin process \mathbf{X}_{j}, \mbox{ \ }j\ge 0,
such that the increments
take values and satisfy ,
all , where if , and if .
Here denote persistence parameters and with
. The process starts at and terminates when
. Denote by , , and ,
respectively, the numbers of runs, long runs, and steps in the meander portion
of the gambler's ruin process. Define and let for some . We show exists in an explicit form. We obtain a
companion theorem for the last visit portion of the gambler's ruin.Comment: Presented at 8th International Conference on Lattice Path
Combinatorics, Cal Poly Pomona, Aug., 2015. The 2nd version has been
streamlined, with references added, including reference to a companion
document with details of calculations via Mathematica. The 3rd version has 2
new figures and improved presentatio
Random Planar Lattices and Integrated SuperBrownian Excursion
In this paper, a surprising connection is described between a specific brand
of random lattices, namely planar quadrangulations, and Aldous' Integrated
SuperBrownian Excursion (ISE). As a consequence, the radius r_n of a random
quadrangulation with n faces is shown to converge, up to scaling, to the width
r=R-L of the support of the one-dimensional ISE. More generally the
distribution of distances to a random vertex in a random quadrangulation is
described in its scaled limit by the random measure ISE shifted to set the
minimum of its support in zero.
The first combinatorial ingredient is an encoding of quadrangulations by
trees embedded in the positive half-line, reminiscent of Cori and Vauquelin's
well labelled trees. The second step relates these trees to embedded (discrete)
trees in the sense of Aldous, via the conjugation of tree principle, an
analogue for trees of Vervaat's construction of the Brownian excursion from the
bridge.
From probability theory, we need a new result of independent interest: the
weak convergence of the encoding of a random embedded plane tree by two contour
walks to the Brownian snake description of ISE.
Our results suggest the existence of a Continuum Random Map describing in
term of ISE the scaled limit of the dynamical triangulations considered in
two-dimensional pure quantum gravity.Comment: 44 pages, 22 figures. Slides and extended abstract version are
available at http://www.loria.fr/~schaeffe/Pub/Diameter/ and
http://www.iecn.u-nancy.fr/~chassain
Lattice Green's Functions of the Higher-Dimensional Face-Centered Cubic Lattices
We study the face-centered cubic lattice (fcc) in up to six dimensions. In
particular, we are concerned with lattice Green's functions (LGF) and return
probabilities. Computer algebra techniques, such as the method of creative
telescoping, are used for deriving an ODE for a given LGF. For the four- and
five-dimensional fcc lattices, we give rigorous proofs of the ODEs that were
conjectured by Guttmann and Broadhurst. Additionally, we find the ODE of the
LGF of the six-dimensional fcc lattice, a result that was not believed to be
achievable with current computer hardware.Comment: 16 pages, final versio
On FPL configurations with four sets of nested arches
The problem of counting the number of Fully Packed Loop (FPL) configurations
with four sets of a,b,c,d nested arches is addressed. It is shown that it may
be expressed as the problem of enumeration of tilings of a domain of the
triangular lattice with a conic singularity. After reexpression in terms of
non-intersecting lines, the Lindstr\"om-Gessel-Viennot theorem leads to a
formula as a sum of determinants. This is made quite explicit when
min(a,b,c,d)=1 or 2. We also find a compact determinant formula which generates
the numbers of configurations with b=d.Comment: 22 pages, TeX, 16 figures; a new formula for a generating function
adde
Inhomogeneous loop models with open boundaries
We consider the crossing and non-crossing O(1) dense loop models on a
semi-infinite strip, with inhomogeneities (spectral parameters) that preserve
the integrability. We compute the components of the ground state vector and
obtain a closed expression for their sum, in the form of Pfaffian and
determinantal formulas.Comment: 42 pages, 31 figures, minor corrections, references correcte
Analysis of an exhaustive search algorithm in random graphs and the n^{c\log n} -asymptotics
We analyze the cost used by a naive exhaustive search algorithm for finding a
maximum independent set in random graphs under the usual G_{n,p} -model where
each possible edge appears independently with the same probability p. The
expected cost turns out to be of the less common asymptotic order n^{c\log n},
which we explore from several different perspectives. Also we collect many
instances where such an order appears, from algorithmics to analysis, from
probability to algebra. The limiting distribution of the cost required by the
algorithm under a purely idealized random model is proved to be normal. The
approach we develop is of some generality and is amenable for other graph
algorithms.Comment: 35 page