نتایج جستجو برای: percolation problem
تعداد نتایج: 889553 فیلتر نتایج به سال:
We study the temporal percolation properties of temporal networks by taking as a representative example the recently proposed activity-driven-network model [N. Perra et al., Sci. Rep. 2, 469 (2012)]. Building upon an analytical framework based on a mapping to hidden variables networks, we provide expressions for the percolation time Tp marking the onset of a giant connected component in the int...
Let F1 and F2 be independent copies of one-dimensional correlated fractal percolation, with almost sure Hausdorff dimensions dimH(F1) and dimH(F2). Consider the following question: does dimH(F1)+ dimH(F2) > 1 imply that their algebraic difference F1 − F2 will contain an interval? The well known Palis conjecture states that ‘generically’ this should be true. Recent work by Kuijvenhoven and the f...
The location and nature of the percolation transition in random networks is a subject of intense interest. Recently, a series of graph evolution processes have been introduced that lead to discontinuous percolation transitions where the addition of a single edge causes the size of the largest component to exhibit a significant macroscopic jump in the thermodynamic limit. These processes can hav...
One goal of this paper is to prove that dynamical critical site percolation on the planar triangular lattice has exceptional times at which percolation occurs. In doing so, new quantitative noise sensitivity results for percolation are obtained. The latter is based on a novel method for controlling the “level k” Fourier coefficients via the construction of a randomized algorithm which looks at ...
Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson localisation. Here, we consider a directed discrete-time quantum walk as a model to study quantum percolation of a two-state particle on a two-dimensional latti...
We study the behavior of center sectors in pure SU(4) lattice gauge theory at finite temperature. The center sectors are defined as spatial clusters of neighboring sites with values of their local Polyakov loops near the same center elements. We study the connectedness and percolation properties of the center clusters across the deconfinement transition. We show that for SU(4) gauge theory deco...
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
We describe in detail an efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation probability from zero to one in an amount of time that scales linearly with the size of the system. We demonstrate our algorithm by using it to investigate a number of issues in p...
In this note we investigate the last passage percolation model in the presence of macroscopic inhomogeneity. We analyze how this affects the scaling limit of the passage time, leading to a variational problem that provides an ODE for the deterministic limiting shape of the maximal path. We obtain a sufficient analytical condition for uniqueness of the solution for the variational problem. Conse...
Consider the standard continuous percolation in R 4 , and choose the parameters so that the induced percolation on a xed two dimensional linear subspace is critical. Although two dimensional critical percolation dies, we show that there are exceptional two dimensional linear subspaces, in which percolation occurs.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید