Petrovskaya and Leontovich (1982) proved a central limit theorem for sums of dependent random variables indexed by a graph. We apply this theorem to obtain asymptotic normality for the number of local maxima of a random function on certain graphs and for the number of edges having the same color at both endpoints in randomly colored graphs. We briefly motivate these problems, and conclude with ...

The Edwards model in one dimension is a transformed path measure for standard Brownian motion discouraging self-intersections. We prove a central limit theorem for the endpoint of the path, extending a law of large numbers proved by Westwater (1984). The scaled variance is characterized in terms of the largest eigenvalue of a one-parameter family of diierential operators, introduced and analyze...

In this research, we continue studying limit theorems for combinatorial numbers satisfying a class of triangular arrays. Using the general results Hwang and Bender, obtain constructive proof central theorem, specifying rate convergence to limiting (normal) distribution, as well new local theorem tribonacci triangle.