|
A strong law of large numbers for random biased connected graphs
Zhonghao Xua, Ya. Higuchib, Chunhuac a School of Finance and Statistics, East China Normal
University, Shanghai, China
b Department of Mathematics,
Kobe University, Kobe, Japan
c School of Applied Mathematics,
Beijing Normal University, Zhuhai, China
Abstract:
We consider a class of random connected graphs with random vertices and random edges in which the randomness of the vertices is determined by a continuous probability distribution and the randomness of the edges is determined by a connection function. We derive a strong law of large numbers on the total lengths of all random edges for a random biased connected graph that is a generalization of a directed $k$-nearest-neighbor graph.
Keywords:
random connected graph, random biased connected graph, law of large numbers.
Received: 17.01.2012
Citation:
Zhonghao Xu, Ya. Higuchi, Chunhua, “A strong law of large numbers for random biased connected graphs”, TMF, 172:3 (2012), 344–354; Theoret. and Math. Phys., 172:3 (2012), 1177–1186
Linking options:
https://www.mathnet.ru/eng/tmf6962https://doi.org/10.4213/tmf6962 https://www.mathnet.ru/eng/tmf/v172/i3/p344
|
Statistics & downloads: |
Abstract page: | 356 | Full-text PDF : | 153 | References: | 45 | First page: | 9 |
|