Probability that given vertices belong to the same connected component of random equiprobable mapping

被引：0

作者：

Zubkov, Andrey M. ^{[1
]}

Khalipov, Petr V. ^{[2
]}

机构：

[1] Russian Acad Sci, Steklov Math Inst, Moscow, Russia

[2] JSC United Consulting Grp, Moscow, Russia

来源：

DISCRETE MATHEMATICS AND APPLICATIONS | 2024年 / 34卷 / 04期

关键词：

equiprobable random mappings of finite sets; random oriented graphs; connected components; limit theorems;

D O I：

10.1515/dma-2024-0021

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The random equiprobable mappings of finite set S into itself are considered. The probability that k fixed elements of S belong to the same connected component is studied. The limit of this probability as |S| -> infinity is found.

引用

页码：245 / 250

页数：6