On the degree sequence of random geometric digraphs

Abstract: A random geometric digraph

G_{n}

is constructed by taking

X_{1}, X_{2}, ... X_{n}

in

m a t h b b R^{2}

independently at random with a common bounded density function. Each vertex

X_{i}

is assigned at random a sector

S_{i}

of central angle

a l p h a

with inclination

Y_{i}

, in a circle of radius

r

(with vertex

X_{i}

as the origin). An arc is present from vertex

X_{i}

to

X_{j}

, if

X_{j}

falls in

S_{i}

. Suppose

k

is fixed and

k_{n}

is a sequence with

1 l l k_{n} l l n^{1 / 2}

, as

n o i n f t y

. We prove central limit theorems for

k -

and

k_{n} -

nearest neighbor distance of out- and in-degrees in

G_{n}

. We also show that the degree distribution of this model, which varies with the probability distribution of the underlying point processes, can be either homogeneous or inhomogeneous. Our work should provide valuable insights for alternative mechanisms wrapped in real-world complex networks.

Recommendations

Cited in

(8)

This page was built for publication: On the degree sequence of random geometric digraphs

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