Results 1  10
of
65
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
 In Survey in Combinatorics, 2005, volume 327 of London Mathematical Society Lecture Notes
, 2005
"... and matroids ..."
A random walk construction of uniform spanning trees and uniform labelled trees
 SIAM Journal on Discrete Mathematics
, 1990
"... Abstract A random walk on a finite graph can be used to construct a uniformrandom spanning tree. We show how random walk techniques can be applied to the study of several properties of the uniform randomspanning tree: the proportion of leaves, the distribution of degrees, and the diameter. ..."
Abstract

Cited by 81 (3 self)
 Add to MetaCart
Abstract A random walk on a finite graph can be used to construct a uniformrandom spanning tree. We show how random walk techniques can be applied to the study of several properties of the uniform randomspanning tree: the proportion of leaves, the distribution of degrees, and the diameter.
Coalescent Random Forests
 J. COMBINATORIAL THEORY A
, 1998
"... Various enumerations of labeled trees and forests, including Cayley's formula n n\Gamma2 for the number of trees labeled by [n], and Cayley's multinomial expansion over trees, are derived from the following coalescent construction of a sequence of random forests (R n ; R n\Gamma1 ; : : : ; R 1 ..."
Abstract

Cited by 38 (18 self)
 Add to MetaCart
Various enumerations of labeled trees and forests, including Cayley's formula n n\Gamma2 for the number of trees labeled by [n], and Cayley's multinomial expansion over trees, are derived from the following coalescent construction of a sequence of random forests (R n ; R n\Gamma1 ; : : : ; R 1 ) such that R k has uniform distribution over the set of all forests of k rooted trees labeled by [n]. Let R n be the trivial forest with n root vertices and no edges. For n k 2, given that R n ; : : : ; R k have been defined so that R k is a rooted forest of k trees, define R k\Gamma1 by addition to R k of a single edge picked uniformly at random from the set of n(k \Gamma 1) edges which when added to R k yield a rooted forest of k \Gamma 1 trees. This coalescent construction is related to a model for a physical process of clustering or coagulation, the additive coalescent in which a system of masses is subject to binary coalescent collisions, with each pair of masses of magnitude...
The matrixforest theorem and measuring relations in small social groups
 Automation and Remote Control
, 1997
"... We propose a family of graph structural indices related to the matrixforest theorem. The properties of the basic index that expresses the mutual connectivity of two vertices are studied in detail. The derivative indices that measure “dissociation, ” “solitariness, ” and “provinciality ” of vertices ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
We propose a family of graph structural indices related to the matrixforest theorem. The properties of the basic index that expresses the mutual connectivity of two vertices are studied in detail. The derivative indices that measure “dissociation, ” “solitariness, ” and “provinciality ” of vertices are also considered. A nonstandard metric on the set of vertices is introduced, which is determined by their connectivity. The application of these indices in sociometry is discussed. 1.
Parking Functions and Noncrossing Partitions
 Electronic J. Combinatorics
, 1997
"... this paper we will develop a connection between parking functions and another topic, viz., noncrossing partitions ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
this paper we will develop a connection between parking functions and another topic, viz., noncrossing partitions
Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees
"... This paper provides tight bounds for the moments of the width of rooted labeled trees with n nodes, answering an open question of Odlyzko and Wilf (1987). To this aim, we use one of the many onetoone correspondences between trees and parking functions, and also a precise coupling between parking f ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
This paper provides tight bounds for the moments of the width of rooted labeled trees with n nodes, answering an open question of Odlyzko and Wilf (1987). To this aim, we use one of the many onetoone correspondences between trees and parking functions, and also a precise coupling between parking functions and the empirical processes of mathematical statistics. Our result turns out to be a consequence of the strong convergence of empirical processes to the Brownian bridge (Komlos, Major and Tusnady, 1975).
On the Analysis of Linear Probing Hashing
, 1998
"... This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models are considered, that of full tables and that of sparse tables with a fixed filling ratio strictly smaller than one. For full tables, ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models are considered, that of full tables and that of sparse tables with a fixed filling ratio strictly smaller than one. For full tables, the construction cost has expectation O(n3/2), the standard deviation is of the same order, and a limit law of the Airy type holds. (The Airy distribution is a semiclassical distribution that is defined in terms of the usual Airy functions or equivalently in terms of Bessel functions of indices − 1 2 3, 3.) For sparse tables, the construction cost has expectation O(n), standard deviation O ( √ n), and a limit law of the Gaussian type. Combinatorial relations with other problems leading to Airy phenomena (like graph connectivity, tree inversions, tree path length, or area under excursions) are also briefly discussed.
Recursive selfsimilarity for random trees, random triangulations and Brownian excursion
 Ann. Probab
, 1994
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
Random mappings, forests, and subsets associated with AbelCayleyHurwitz multinomial expansions
, 2001
"... Various random combinatorial objects, such as mappings, trees, forests, and subsets of a finite set, are constructed with probability distributions related to the binomial and multinomial expansions due to Abel, Cayley and Hurwitz. Relations between these combinatorial objects, such as Joyal's b ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
Various random combinatorial objects, such as mappings, trees, forests, and subsets of a finite set, are constructed with probability distributions related to the binomial and multinomial expansions due to Abel, Cayley and Hurwitz. Relations between these combinatorial objects, such as Joyal's bijection between mappings and marked rooted trees, have interesting probabilistic interpretations, and applications to the asymptotic structure of large random trees and mappings. An extension of Hurwitz's binomial formula is associated with the probability distribution of the random set of vertices of a fringe subtree in a random forest whose distribution is defined by terms of a multinomial expansion over rooted labeled forests. Research supported in part by N.S.F. Grants DMS 9703961 and DMS0071448 1 Contents 1
Analytic combinatorics  Symbolic Combinatorics
, 2002
"... This booklet develops in nearly 200 pages the basics of combinatorial enumeration through an approach that revolves around generating functions. The major objects of interest here are words, trees, graphs, and permutations, which surface recurrently in all areas of discrete mathematics. The text pre ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
This booklet develops in nearly 200 pages the basics of combinatorial enumeration through an approach that revolves around generating functions. The major objects of interest here are words, trees, graphs, and permutations, which surface recurrently in all areas of discrete mathematics. The text presents the core of the theory with chapters on unlabelled enumeration and ordinary generating functions, labelled enumeration and exponential generating functions, and finally multivariate enumeration and generating functions. It is largely oriented towards applications of combinatorial enumeration to random discrete structures and discrete mathematics models, as they appear in various branches of science, like statistical physics, computational biology, probability theory, and, last not least, computer science and the analysis of algorithms.