Effect of scale on long-range random graphs and chromosomal inversions
From MaRDI portal
(Redirected from Publication:453237)
Abstract: We consider bond percolation on 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 (when the mean degree exceeds 1) but not when . The proof uses comparisons to branching random walks. We also consider a related process of random transpositions of particles on a circle, where transpositions only occur again if the spacing is at most . Then the process exhibits the mean-field 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3584785 (Why is no real title available?)
- scientific article; zbMATH DE number 1761225 (Why is no real title available?)
- scientific article; zbMATH DE number 3892344 (Why is no real title available?)
- Discontinuity of the percolation density in one dimensional \(1/| x- y| ^ 2\) percolation models
- Emergence of giant cycles and slowdown transition in random transpositions and \(k\)-cycles
- Limiting behavior for the distance of a random walk
- Line-of-sight percolation
- On the spread-out limit for bond and continuum percolation
- Random graph dynamics
- Shuffling chromosomes
- Statistical mechanics of crabgrass
- Transforming cabbage into turnip
This page was built for publication: Effect of scale on long-range random graphs and chromosomal inversions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453237)