|
Problemy Peredachi Informatsii, 2013, Volume 49, Issue 3, Pages 105–111
(Mi ppi2118)
|
|
|
|
Large Systems
Model of random merging of segments
L. G. Mityushin Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Abstract:
We consider a growing set $U$ of segments with integer endpoints on a line. For every pair of adjacent segments, their union is added to $U$ with probability $q$. At the beginning, $U$ contains all segments of length from $1$ to $m$. Let $h_n$ be the probability that the segment $[a,a+n]$ will be created; the critical value $q_c(m)$ is defined as $\sup\{q\mid\lim_{n\to\infty}h_n=0\}$. Lower and upper bounds for $q_c(m)$ are obtained.
Received: 13.11.2012 Revised: 06.02.2013
Citation:
L. G. Mityushin, “Model of random merging of segments”, Probl. Peredachi Inf., 49:3 (2013), 105–111; Problems Inform. Transmission, 49:3 (2013), 292–297
Linking options:
https://www.mathnet.ru/eng/ppi2118 https://www.mathnet.ru/eng/ppi/v49/i3/p105
|
|