# Báo cáo toán học: "The evolution of uniform random planar graphs"

## Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí Department of Mathematic dành cho các bạn yêu thích môn toán học đề tài: The evolution of uniform random planar graphs. | The evolution of uniform random planar graphs Chris Dowden LIX École Polytechnique 91128 Palaiseau Cedex France dowden@ Submitted Jun 2 2009 Accepted Dec 18 2009 Published Jan 5 2010 Mathematics Subject Classification 05C10 05C80 Abstract Let Pn m denote the graph taken uniformly at random from the set of all planar graphs on 1 2 . n with exactly m n edges. We use counting arguments to investigate the probability that Pn m will contain given components and subgraphs finding that there is different asymptotic behaviour depending on the ratio mm. 1 Introduction Random planar graphs have recently been the subject of much activity and many properties of the standard random planar graph Pn taken uniformly at random from the set of all planar graphs on 1 2 . n are now known. For example in 7 it was shown that Pn will asymptotically almost surely . that is with probability tending to 1 as n tends to infinity contain at least linearly many copies of any given planar graph. By combining the counting methods of 7 with some rather precise results of 5 obtained using generating functions the exact limiting probability for the event that Pn will contain any given comp onent is also known. More recently attention has turned to the graph Pn m taken uniformly at random from the set P n m of all planar graphs on 1 2 . n with exactly m n edges. It is well known that we must have m 3n for planarity to be possible and also that Pn m behaves in exactly the same way as the general random graph Gn m if mm 2 - n2 3 see for example 6 so the interest lies with the region 1 liminf mm c limsup mm c 3. In 4 the case when m qn for fixed q was investigated using counting arguments and it was shown that for all q G 1 3 Pn qn will . contain at least linearly many copies of any given planar graph as with Pn . It was also shown that the probability that Pn _qn will contain an isolated vertex is bounded away from 0 as n X for all q 3 and hence that the probability that .

TÀI LIỆU LIÊN QUAN
32    85    0
45    80    0
6    107    0
4    73    0
6    90    0
6    94    0
6    80    0
5    83    0
7    99    0
6    104    0
TÀI LIỆU XEM NHIỀU
13    41235    2421
3    25182    250
25    24859    4300
16    20339    2847
20    19744    1550
14    19662    2977
1    19557    621
37    16430    2960
3    16389    331
1    14957    135
TỪ KHÓA LIÊN QUAN
TÀI LIỆU MỚI ĐĂNG
126    76    4    13-07-2024
4    266    2    13-07-2024
13    320    2    13-07-2024
889    260    1    13-07-2024
171    284    2    13-07-2024
3    85    1    13-07-2024
32    85    1    13-07-2024
123    132    2    13-07-2024
36    235    1    13-07-2024
151    106    15    13-07-2024
109    571    6    13-07-2024
39    160    10    13-07-2024
111    328    15    13-07-2024
5    102    2    13-07-2024
148    536    1    13-07-2024
101    383    4    13-07-2024
11    236    9    13-07-2024
106    169    5    13-07-2024
8    74    1    13-07-2024
52    89    1    13-07-2024
TÀI LIỆU HOT
3    25182    250
13    41235    2421
3    3015    81
580    5336    363
584    3571    101
62    6925    1
171    5940    721
2    3388    78
51    4693    200
53    4991    189
Đã 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.