Laws of large numbers of subgraphs in directed random geometric networks

zbMATH Open1399.05202arXiv0909.2948MaRDI QIDQ2836282FDOQ2836282

Publication date: 12 December 2016

Published in: International Electronic Journal of Pure and Applied Mathematics (Search for Journal in Brave)

Abstract: Given independent random points

m a t h c a l X_{n} = X_{1}, ..., X_{n}

in

m a t h b b R^{2}

, drawn according to some probability density function

f

on

m a t h b b R^{2}

, and a cutoff

r_{n} > 0

we construct a random geometric digraph

G (m a t h c a l X_{n}, m a t h c a l Y_{n}, r_{n})

with vertex set

m a t h c a l X_{n}

. Each vertex

X_{i}

is assigned uniformly at random a sector

S_{i}

, of central angle

a l p h a

with inclination

Y_{i}

, in a circle of radius

r_{n}

(with vertex

X_{i}

as the origin). An arc is present from

X_{i}

to

X_{j}

, if

X_{j}

falls in

S_{i}

. We also introduce another random geometric digraph

G (m a t h c a l X_{n}, m a t h c a l R_{n})

with vertex set

m a t h c a l X_{n} = X_{1}, ..., X_{n}

in

m a t h b b R^{d}

,

d g e 1

and an arc present from

X_{i}

to

X_{j}

if

| | X_{i} - X_{j} | | < R_{n, i}

. Here

{R_{n, i}}_{i g e 1}

are i.i.d. random variables and we may take an arbitrary norm

| | c d o t | |

. In this paper we investigate two kinds of small subgraphs--induced and isolated--in the above two directed networks, which contribute to understanding the local topology of many spatial networks, such as wireless communication networks. We give some strong laws of large numbers of subgraph counts thus extending those results of Penrose [Random Geometric Graphs, Oxford University Press, 2003].

Full work available at URL: https://arxiv.org/abs/0909.2948

zbMATH Keywords

random geometric graph law of large number Azuma's inequality random scaled sector graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cited In (1)

On the number of weakly connected subdigraphs in random \(k\)NN digraphs

This page was built for publication: Laws of large numbers of subgraphs in directed random geometric networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836282)