اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Approximate Invariance of the Average Number of Connections for the Continuum Percolation of Squares at Criticality
152
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We perform Monte Carlo simulations to determine the average excluded area $<A_{ex}>$ of randomly oriented squares, randomly oriented widthless sticks and aligned squares in two dimensions. We find significant differences between our results for randomly oriented squares and previous analytical results for the same. The sources of these differences are explained. Using our results for $<A_{ex}>$ and Monte Carlo simulation results for the percolation threshold, we estimate the mean number of connections per object $B_c$ at the percolation threshold for squares in 2-D. We study systems of squares that are allowed random orientations within a specified angular interval. Our simulations show that the variation in $B_c$ is within 1.6% when the angular interval is varied from 0 to $pi/2$.
قيم البحث
اقرأ أيضاً
The random Lorentz gas (RLG) is a minimal model for transport in disordered media. Despite the broad relevance of the model, theoretical grasp over its properties remains weak. For instance, the scaling with dimension d of its localization transition
at the void percolation threshold is not well controlled analytically nor computationally. A recent study [Biroli et al. Phys. Rev. E L030104 (2021)] of the caging behavior of the RLG motivated by the mean-field theory of glasses has uncovered physical inconsistencies in that scaling that heighten the need for guidance. Here, we first extend analytical expectations for asymptotic high-d bounds on the void percolation threshold, and then computationally evaluate both the threshold and its criticality in various d. In high-d systems, we observe that the standard percolation physics is complemented by a dynamical slowdown of the tracer dynamics reminiscent of mean-field caging. A simple modification of the RLG is found to bring the interplay between percolation and mean-field-like caging down to d=3.
This work studies the jamming and percolation of parallel squares in a single-cluster growth model. The Leath-Alexandrowicz method was used to grow a cluster from an active seed site. The sites of a square lattice were occupied by addition of the equ
al size $k times k$ squares (E-problem) or a mixture of $k times k$ and $m times m$ ($m leqslant k$) squares (M-problem). The larger $k times k$ squares were assumed to be active (conductive) and the smaller $m times m$ squares were assumed to be blocked (non-conductive). For equal size $k times k$ squares (E-problem) the value of $p_j = 0.638 pm 0.001$ was obtained for the jamming concentration in the limit of $krightarrowinfty$. This value was noticeably larger than that previously reported for a random sequential adsorption model, $p_j = 0.564 pm 0.002$. It was observed that the value of percolation threshold $p_{mathrm{c}}$ (i.e., the ratio of the area of active $k times k$ squares and the total area of $k times k$ squares in the percolation point) increased with an increase of $k$. For mixture of $k times k$ and $m times m$ squares (M-problem), the value of $p_{mathrm{c}}$ noticeably increased with an increase of $k$ at a fixed value of $m$ and approached 1 at $kgeqslant 10m$. This reflects that percolation of larger active squares in M-problem can be effectively suppressed in the presence of smaller blocked squares.
We investigate kinetically constrained models of glassy transitions, and determine which model characteristics are crucial in allowing a rigorous proof that such models have discontinuous transitions with faster than power law diverging length and ti
me scales. The models we investigate have constraints similar to that of the knights model, introduced by Toninelli, Biroli, and Fisher (TBF), but differing neighbor relations. We find that such knights-like models, otherwise known as models of jamming percolation, need a ``No Parallel Crossing rule for the TBF proof of a glassy transition to be valid. Furthermore, most knight-like models fail a ``No Perpendicular Crossing requirement, and thus need modification to be made rigorous. We also show how the ``No Parallel Crossing requirement can be used to evaluate the provable glassiness of other correlated percolation models, by looking at models with more stable directions than the knights model. Finally, we show that the TBF proof does not generalize in any straightforward fashion for three-dimensiona
We investigate the global persistence properties of critical systems relaxing from an initial state with non-vanishing value of the order parameter (e.g., the magnetization in the Ising model). The persistence probability of the global order paramete
r displays two consecutive regimes in which it decays algebraically in time with two distinct universal exponents. The associated crossover is controlled by the initial value m_0 of the order parameter and the typical time at which it occurs diverges as m_0 vanishes. Monte-Carlo simulations of the two-dimensional Ising model with Glauber dynamics display clearly this crossover. The measured exponent of the ultimate algebraic decay is in rather good agreement with our theoretical predictions for the Ising universality class.
We study the very long-range bond-percolation problem on a linear chain with both sites and bonds dilution. Very long range means that the probability $p_{ij}$ for a connection between two occupied sites $i,j$ at a distance $r_{ij}$ decays as a power
law, i.e. $p_{ij} = rho/[r_{ij}^alpha N^{1-alpha}]$ when $ 0 le alpha < 1$, and $p_{ij} = rho/[r_{ij} ln(N)]$ when $alpha = 1$. Site dilution means that the occupancy probability of a site is $0 < p_s le 1$. The behavior of this model results from the competition between long-range connectivity, which enhances the percolation, and site dilution, which weakens percolation. The case $alpha=0$ with $p_s =1 $ is well-known, being the exactly solvable mean-field model. The percolation order parameter $P_infty$ is investigated numerically for different values of $alpha$, $p_s$ and $rho$. We show that in the ranges $ 0 le alpha le 1$ and $0 < p_s le 1$ the percolation order parameter $P_infty$ depends only on the average connectivity $gamma$ of sites, which can be explicitly computed in terms of the three parameters $alpha$, $p_s$ and $rho$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
