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

共 5 条

[1] THE LARGEST CONNECTED COMPONENT IN A RANDOM MAPPING
JAWORSKI, J
MUTAFCHIEV, L
RANDOM STRUCTURES & ALGORITHMS, 1994, 5 (01) : 73 - 94
[2] Limit distributions of the number of vertices of given degree in the forest of a random mapping with a given number of cycles
Pavlov, Yu. L.
Myllari, T. B.
DISCRETE MATHEMATICS AND APPLICATIONS, 2012, 22 (02): : 225 - 234
[3] The size of the largest strongly connected component of a random digraph with a given degree sequence
Cooper, C
Frieze, A
COMBINATORICS PROBABILITY & COMPUTING, 2004, 13 (03): : 319 - 337
[4] Generating random networks that consist of a single connected component with a given degree distribution
Tishby, Ido
Biham, Ofer
Katzav, Eytan
Kuehn, Reimer
PHYSICAL REVIEW E, 2019, 99 (04)
[5] Lower estimates for probability of connectivity in the classes of random graphs generated by double-connected graphs with given basic spectrum
Polesskij, V.P.
Problemy Peredachi Informatsii, 1992, 28 (02): : 86 - 95

← 1 →