tailieunhanh - Báo cáo toán học: "Intersections of Randomly Embedded Sparse Graphs are Poisson Edward"

Tuyển tập các báo cáo nghiên cứu khoa học trên tạp chí toán học quốc tế đề tài: Intersections of Randomly Embedded Sparse Graphs are Poisson Edward . | Intersections of Randomly Embedded Sparse Graphs are Poisson Edward A. Bender Department of Mathematics University of California San Diego La Jolla CA 92093-0112 ebender@ E. Rodney Canfield Department of Computer Science The University of Georgia Athens GA 30602 USA erc@ Submitted August 3 1999 Accepted September 26 1999 Abstract Suppose that t 2 is an integer and randomly label t graphs with the integers 1. n. We give sufficient conditions for the number of edges common to all t of the labelings to be asymptotically Poisson as n 1. We show by example that our theorem is in a sense best possible. For Gn a sequence of graphs of bounded degree each having at most n vertices Tomescu 7 has shown that the number of spanning trees of Kn having k edges in common with Gn is asymptotically e-2s n 2s n k k X nn-2 where s s n is the number of edges in Gn. As an application of our Poisson-intersection theorem we extend this result to the case in which maximum degree is only restricted to be o n log log n log n . We give an inversion theorem for falling moments which we use to prove our Poisson-intersection theorem. AMS-MOS Subject Classification 1990 05C30 Secondary 05A16 05C05 60C05 THE ELECTRONIC JOURNAL OF COMBINATORICS 6 1999 R36 2 1. Introduction and Statement of Graphical Results This paper considers random embeddings of an m-vertex graph G into the complete graph Kn where m n. With no loss assume the vertices of G are 1 2 . .mg. The number of injections of an m-set into an n-set is n m the falling factorial n m n n 1 n m 1 . By a random embedding of G into Kn we mean that one of the above injections is chosen from the uniform distribution. Tomescu 7 showed that the number of edges a randomly embedded graph Gn has in common with a random spanning tree of Kn is asymptotically Poisson when the degree of the graph is bounded. The result had been conjectured in 6 and proven there for a special case. This can be interpreted in terms of random embeddings

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
TÀI LIỆU MỚI ĐĂNG
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.