Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

One-dimensional long-range percolation: A numerical study

One-dimensional long-range percolation: A numerical study In this paper we study bond percolation on a one-dimensional chain with power-law bond probability C/rd+σ, where r is the distance length between distinct sites and d=1. We introduce and test an order-N Monte Carlo algorithm and we determine as a function of σ the critical value Cc at which percolation occurs. The critical exponents in the range 0<σ<1 are reported. Our analysis is in agreement, up to a numerical precision ≈10−3, with the mean-field result for the anomalous dimension η=2−σ, showing that there is no correction to η due to correlation effects. The obtained values for Cc are compared with a known exact bound, while the critical exponent ν is compared with results from mean-field theory, from an expansion around the point σ=1 and from the ɛ-expansion used with the introduction of a suitably defined effective dimension deff relating the long-range model with a short-range one in dimension deff. We finally present a formulation of our algorithm for bond percolation on general graphs, with order N efficiency on a large class of graphs including short-range percolation and translationally invariant long-range models in any spatial dimension d with σ>0. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Physical Review E American Physical Society (APS)

One-dimensional long-range percolation: A numerical study

One-dimensional long-range percolation: A numerical study

Physical Review E , Volume 96 (1) – Jul 5, 2017

Abstract

In this paper we study bond percolation on a one-dimensional chain with power-law bond probability C/rd+σ, where r is the distance length between distinct sites and d=1. We introduce and test an order-N Monte Carlo algorithm and we determine as a function of σ the critical value Cc at which percolation occurs. The critical exponents in the range 0<σ<1 are reported. Our analysis is in agreement, up to a numerical precision ≈10−3, with the mean-field result for the anomalous dimension η=2−σ, showing that there is no correction to η due to correlation effects. The obtained values for Cc are compared with a known exact bound, while the critical exponent ν is compared with results from mean-field theory, from an expansion around the point σ=1 and from the ɛ-expansion used with the introduction of a suitably defined effective dimension deff relating the long-range model with a short-range one in dimension deff. We finally present a formulation of our algorithm for bond percolation on general graphs, with order N efficiency on a large class of graphs including short-range percolation and translationally invariant long-range models in any spatial dimension d with σ>0.

Loading next page...
 
/lp/aps_physical/one-dimensional-long-range-percolation-a-numerical-study-60qAmTvEmK

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
American Physical Society (APS)
Copyright
Copyright © ©2017 American Physical Society
ISSN
1539-3755
eISSN
550-2376
DOI
10.1103/PhysRevE.96.012108
pmid
29347133
Publisher site
See Article on Publisher Site

Abstract

In this paper we study bond percolation on a one-dimensional chain with power-law bond probability C/rd+σ, where r is the distance length between distinct sites and d=1. We introduce and test an order-N Monte Carlo algorithm and we determine as a function of σ the critical value Cc at which percolation occurs. The critical exponents in the range 0<σ<1 are reported. Our analysis is in agreement, up to a numerical precision ≈10−3, with the mean-field result for the anomalous dimension η=2−σ, showing that there is no correction to η due to correlation effects. The obtained values for Cc are compared with a known exact bound, while the critical exponent ν is compared with results from mean-field theory, from an expansion around the point σ=1 and from the ɛ-expansion used with the introduction of a suitably defined effective dimension deff relating the long-range model with a short-range one in dimension deff. We finally present a formulation of our algorithm for bond percolation on general graphs, with order N efficiency on a large class of graphs including short-range percolation and translationally invariant long-range models in any spatial dimension d with σ>0.

Journal

Physical Review EAmerican Physical Society (APS)

Published: Jul 5, 2017

There are no references for this article.