Berestycki, N. and Pymar, Richard (2012) Effect of scale on longrange random graphs and chromosomal inversions. The Annals of Applied Probability 22 (4), pp. 13281361. ISSN 10505164.

Text
19543.pdf  Published Version of Record Download (327kB)  Preview 
Abstract
We consider bond percolation on n vertices on a circle where edges are permitted between vertices whose spacing is at most some number L=L(n). We show that the resulting random graph gets a giant component when L≫(logn)2 (when the mean degree exceeds 1) but not when L≪logn. The proof uses comparisons to branching random walks. We also consider a related process of random transpositions of n particles on a circle, where transpositions only occur again if the spacing is at most L. Then the process exhibits the meanfield behavior described by Berestycki and Durrett if and only if L(n) tends to infinity, no matter how slowly. Thus there are regimes where the random graph has no giant component but the random walk nevertheless has a phase transition. We discuss possible relevance of these results for a dataset coming from D. repleta and D. melanogaster and for the typical length of chromosomal inversions.
Metadata
Item Type:  Article 

School:  Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences 
Depositing User:  Richard Pymar 
Date Deposited:  05 Sep 2017 12:59 
Last Modified:  09 Aug 2023 12:42 
URI:  https://eprints.bbk.ac.uk/id/eprint/19543 
Statistics
Additional statistics are available via IRStats2.