Eigenvalue distribution of a large weighted bipartite random graph

Abstract: We study eigenvalue distribution of the adjacency matrix

A^{(N, p, a l p h a)}

of weighted random bipartite graphs

G a m m a = G a m m a_{N, p}

. We assume that the graphs have

N

vertices, the ratio of parts is

f r a c a l p h a 1 - a l p h a

and the average number of edges attached to one vertex is

a l p h a c d o t p

or

(1 - a l p h a) c d o t p

. To each edge of the graph

e_{i j}

we assign a weight given by a random variable

a_{i j}

with all moments finite. We consider the moments of normalized eigenvalue counting measure

s i g m a_{N, p, a l p h a}

of

A^{(N, p, a l p h a)}

. The weak convergence in probability of normalized eigenvalue counting measures is proved.

Recommendations

Cited in

(8)

This page was built for publication: Eigenvalue distribution of a large weighted bipartite random graph