We consider discrete-time Markov chains and study large deviations of the pair empirical
occupation measure, which is useful to compute fluctuations of pure-additive and jump-type …

In 1999, Picciotto described three bijective tree codings: the Dandelion Code, the Happy
Code, and the Blob Code. In this paper, we report three recent advances concerning these …

The critical group of a graph is a finite abelian group whose order is the number of spanning
forests of the graph. This paper provides three basic structural results on the critical group of …

In this paper we present several Bayesian algorithms for learning Tree Augmented Naive
Bayes (TAN) models. We extend the results in Meila & Jaakkola (2000a) to TANs by proving …

Bayesian classifiers such as Naive Bayes or Tree Augmented Naive Bayes (TAN) have
shown excellent performance given their simplicity and heavy underlying independence …

There are many ways to represent spanning trees in genetic algorithms (GAs). Among them
are Cayley codes, which represent each tree on n vertices as a string of (n-2) integers from …

We show that ak‐edge‐connected graph on n vertices has at least spanning trees. This
bound is tight if k is even and the extremal graph is the n‐cycle with edge multiplicities. For k …

Circulant graphs are an extremely well-studied subclass of regular graphs, partially because
they model many practical computer network topologies. It has long been known that the …

We give explicit formulas for resistance distance matrices and Moore-Penrose inverses of
incidence and Laplacian matrices of ladder, circular ladder, and M\"{o} bius ladder graphs …

Graph algorithms previously developed by the authors are adapted to simulate pedigrees
similar to those used in genetic linkage studies which associate disease phenotypes with …