I have a weighted graph as my data and lots of random graphs with the same size that are generated with uniform distribution over edges, I want to eliminate the edges of my graph that are random, but I don't know how to compare these graphs. I think p-value is a good way, but I only have one graph with lots of edges as input, how can I compute p-value for every single edge? Or is there any other ideas?
My problem is not link prediction. Actually, I have extra links. I have a dataset of links that are recorded with Hi-C technology, I know that some of the edges are random, but I don't know which of them. I tried to implement permutation test or calculating p-value, for this purpose I generated random graphs based on real data, but I don't know how to compare real graph and randoms.