Log in

Relevant bibliographies by topics / Percolation algorithms / Journal articles

To see the other types of publications on this topic, follow the link: Percolation algorithms.

Journal articles on the topic 'Percolation algorithms'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Percolation algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Moukarzel, C. "A Fast Algorithm for Backbones." International Journal of Modern Physics C 09, no. 06 (1998): 887–95. http://dx.doi.org/10.1142/s0129183198000844.

Full text

Abstract:

A matching algorithm for the identification of backbones in percolation problems is introduced. Using this procedure, percolation backbones are studied in two- to five-dimensional systems containing 1.7×107 sites, two orders of magnitude larger than was previously possible using burning algorithms.

APA, Harvard, Vancouver, ISO, and other styles

2

Sheppard, Adrian P., Mark A. Knackstedt, W. V. Pinczewski, and Muhammad Sahimi. "Invasion percolation: new algorithms and universality classes." Journal of Physics A: Mathematical and General 32, no. 49 (1999): L521—L529. http://dx.doi.org/10.1088/0305-4470/32/49/101.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Tumurbaatar, Altansuren, and Matthew J. Sottile. "Algebraic Algorithms for Betweenness and Percolation Centrality." Journal of Graph Algorithms and Applications 25, no. 1 (2021): 241–61. http://dx.doi.org/10.7155/jgaa.00558.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

YIN, WEI-GUO, and RUIBAO TAO. "RAPID ALGORITHM FOR IDENTIFYING BACKBONES IN THE TWO-DIMENSIONAL PERCOLATION MODEL." International Journal of Modern Physics C 14, no. 10 (2003): 1427–37. http://dx.doi.org/10.1142/s0129183103005509.

Full text

Abstract:

We present a rapid algorithm for identifying the current-carrying backbone in the two-dimensional percolation model. Taking advantage of the modified Hoshen–Kopelman cluster labeling algorithm, our algorithm identifies dangling parts using their local properties. For planar graphs, it finds the backbone almost four times as fast as the commonly-used Tarjan's depth-first-search algorithm. Comparison with other algorithms for backbone identification is also addressed.

APA, Harvard, Vancouver, ISO, and other styles

5

Adler, Joan, Ronen Gross, and Ron Warmund. "Comparison of two algorithms for bootstrap percolation models." Physica A: Statistical Mechanics and its Applications 163, no. 2 (1990): 440–46. http://dx.doi.org/10.1016/0378-4371(90)90135-f.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Zhang, Aiping, Guang Ren, Yejin Lin, et al. "Detecting Community Structures in Networks by Label Propagation with Prediction of Percolation Transition." Scientific World Journal 2014 (2014): 1–14. http://dx.doi.org/10.1155/2014/148686.

Full text

Abstract:

Though label propagation algorithm (LPA) is one of the fastest algorithms for community detection in complex networks, the problem of trivial solutions frequently occurring in the algorithm affects its performance. We propose a label propagation algorithm with prediction of percolation transition (LPAp). After analyzing the reason for multiple solutions of LPA, by transforming the process of community detection into network construction process, a trivial solution in label propagation is considered as a giant component in the percolation transition. We add a prediction process of percolation t

APA, Harvard, Vancouver, ISO, and other styles

7

Malarz, Krzysztof, та Ana Maria Vidales. "Universal Ratio χ in Two-Dimensional Square Random-Site Percolation". International Journal of Modern Physics C 09, № 01 (1998): 147–55. http://dx.doi.org/10.1142/s0129183198000121.

Full text

Abstract:

The percolation phenomena on two-dimensional square lattice is considered. The quotient χ of connectivity length ξ> above percolation threshold pc and ξ< below pc at the same small distance Δp is discussed. The results of two different algorithms and programs and agreement with theoretical/mathematical predications is presented, in contrast to previous contradictory Monte Carlo simulation results.

APA, Harvard, Vancouver, ISO, and other styles

8

Aleshkin, Anton. "The Influence of Transport Link Density on Conductivity If Junctions and/or Links Are Blocked." Mathematics 9, no. 11 (2021): 1278. http://dx.doi.org/10.3390/math9111278.

Full text

Abstract:

This paper examines some approaches to modeling and managing traffic flows in modern megapolises and proposes using the methods and approaches of the percolation theory. The author sets the task of determining the properties of the transport network (percolation threshold) when designing such networks, based on the calculation of network parameters (average number of connections per crossroads, road network density). Particular attention is paid to the planarity and nonplanarity of the road transport network. Algorithms for building a planar random network (for modeling purposes) and calculati

APA, Harvard, Vancouver, ISO, and other styles

9

Meester, Ronald, Massimo Franceschetti, Jehoshua Bruck, and Lorna Booth. "Covering algorithms, continuum percolation and the geometry of wireless networks." Annals of Applied Probability 13, no. 2 (2003): 722–41. http://dx.doi.org/10.1214/aoap/1050689601.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Khvatova, Tatiana, Madeleine Block, Dmitry Zhukov, and Sergey Lesko. "How to measure trust: the percolation model applied to intra-organisational knowledge sharing networks." Journal of Knowledge Management 20, no. 5 (2016): 918–35. http://dx.doi.org/10.1108/jkm-11-2015-0464.

Full text

Abstract:

Purpose The present paper aims to explore how to measure trust as a receptivity force in an intra-organisational knowledge-sharing network with the help of self-developed algorithms of modelling percolations. Design/methodology/approach In this paper, a completely new methodology is applied by using a sample study of an international company’s financial centre as an example. Computer software has been developed to simulate the network and calculate the percolation thresholds by combining its characteristics, thereby revealing what and to what extent connectivity and trust, respectively, influe

APA, Harvard, Vancouver, ISO, and other styles

11

WOLFF, ULLI. "CLUSTER ALGORITHMS FOR NONLINEAR SIGMA MODELS." International Journal of Modern Physics C 03, no. 01 (1992): 213–19. http://dx.doi.org/10.1142/s012918319200018x.

Full text

Abstract:

Percolation cluster Monte Carlo algorithms for nonlinear σ-models on the lattice are reviewed with special emphasis on their possible generalizations. While they have been found to practically eliminate critical slowing down for the standard O(n) invariant vector models, their extension to other physically similar models — like RPn−1 and SU(n)×SU(n) chiral models — is less straight forward than one might have thought. I outline the present situation in this area of research. In the second part of my talk I described a numerical calculation of a physical running coupling constant in the O(3) mo

APA, Harvard, Vancouver, ISO, and other styles

12

APOSTOLAKIS, JOHN, PAUL CODDINGTON, and ENZO MARINARI. "NEW SIMD ALGORITHMS FOR CLUSTER LABELING ON PARALLEL COMPUTERS." International Journal of Modern Physics C 04, no. 04 (1993): 749–63. http://dx.doi.org/10.1142/s0129183193000628.

Full text

Abstract:

Cluster algorithms are non-local Monte Carlo update schemes which can greatly increase the efficiency of computer simulations of spin models of magnets. The major computational task in these algorithms is connected component labeling, to identify clusters of connected sites on a lattice. We have devised some new SIMD component labeling algorithms, and implemented them on the Connection Machine. We investigate their performance when applied to the cluster update of the two-dimensional Ising spin model. These algorithms could also be applied to other problems which use connected component labeli

APA, Harvard, Vancouver, ISO, and other styles

13

Hartmann, Alexander, Oliver Melchert, and Christoph Norrenbrock. "From Spin Glasses to Negative-Weight Percolation." Entropy 21, no. 2 (2019): 193. http://dx.doi.org/10.3390/e21020193.

Full text

Abstract:

Spin glasses are prototypical random systems modelling magnetic alloys. One important way to investigate spin glass models is to study domain walls. For two dimensions, this can be algorithmically understood as the calculation of a shortest path, which allows for negative distances or weights. This led to the creation of the negative weight percolation (NWP) model, which is presented here along with all necessary basics from spin glasses, graph theory and corresponding algorithms. The algorithmic approach involves a mapping to the classical matching problem for graphs. In addition, a summary o

APA, Harvard, Vancouver, ISO, and other styles

14

Langovoy, Mikhail, and Olaf Wittich. "Randomized algorithms for statistical image analysis and site percolation on square lattices." Statistica Neerlandica 67, no. 3 (2013): 337–53. http://dx.doi.org/10.1111/stan.12010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

MACHTA, J. "CLUSTER METHODS FOR ISING SYSTEMS WITH FIELDS." International Journal of Modern Physics C 10, no. 08 (1999): 1427–32. http://dx.doi.org/10.1142/s0129183199001200.

Full text

Abstract:

Efficient cluster algorithms for Ising systems with fields are described. Cluster are grown between two replicas of the system in the same field. As is the case for other successful cluster approaches, the critical point of the spin system coincides with the percolation threshold of the clusters. Applications are discussed.

APA, Harvard, Vancouver, ISO, and other styles

16

Tenreiro Machado, J. A. "Fractional Dynamics of Genetic Algorithms Using Hexagonal Space Tessellation." Abstract and Applied Analysis 2013 (2013): 1–7. http://dx.doi.org/10.1155/2013/739464.

Full text

Abstract:

The paper formulates a genetic algorithm that evolves two types of objects in a plane. The fitness function promotes a relationship between the objects that is optimal when some kind of interface between them occurs. Furthermore, the algorithm adopts an hexagonal tessellation of the two-dimensional space for promoting an efficient method of the neighbour modelling. The genetic algorithm produces special patterns with resemblances to those revealed in percolation phenomena or in the symbiosis found in lichens. Besides the analysis of the spacial layout, a modelling of the time evolution is perf

APA, Harvard, Vancouver, ISO, and other styles

17

Yan, Yongjie, Guang Yu, Xiangbin Yan, and Hui Xie. "Community cores expansion for overlapping community detection in complex networks." Modern Physics Letters B 32, no. 33 (2018): 1850405. http://dx.doi.org/10.1142/s0217984918504055.

Full text

Abstract:

The identification of communities has attracted considerable attentions in the last few years. We propose a novel heuristic algorithm for overlapping community detection based on community cores in complex networks. We introduce a novel clique percolation algorithm and maximize cliques in the finding overlapping communities (node covers) in graphs. We show how vertices can be used to quantify types of local structure presented in a community and identify group nodes that have similar roles in relation to their neighbors. We compare the approach with other three common algorithms in the analysi

APA, Harvard, Vancouver, ISO, and other styles

18

REBOLLO, ISRAEL, MANUEL GRAÑA, and BLANCA CASES. "EFFECT OF SPATIAL PERCOLATION ON THE CONVERGENCE OF A GRAPH COLORING BOID SWARM." International Journal on Artificial Intelligence Tools 21, no. 06 (2012): 1250015. http://dx.doi.org/10.1142/s0218213012500157.

Full text

Abstract:

Graph Coloring Boid Swarm (GCBS) is the successful application of Reynolds' Boid Swarm to solve the graph coloring problem, following appropriate mapping of the problem into boids' behaviors and interpretation of the global swarm states as problem solutions. A population P of boids moves in a closed torus-shaped space S. Each individual boid perceives a disk of radius R of its surrounding space, being able to exchange information with other boids lying inside this area of perception. Two mutually perceiving boids exchanging information are connected. In this paper we show that the ratio of the

APA, Harvard, Vancouver, ISO, and other styles

19

De Santis, Emilio, Fabrizio Grandoni, and Alessandro Panconesi. "Low degree connectivity of ad-hoc networks via percolation." Advances in Applied Probability 42, no. 02 (2010): 559–76. http://dx.doi.org/10.1017/s0001867800004195.

Full text

Abstract:

Consider the following classical problem in ad-hoc networks. Suppose that n devices are distributed uniformly at random in a given region. Each device is allowed to choose its own transmission radius, and two devices can communicate if and only if they are within the transmission radius of each other. The aim is to (quickly) establish a connected network of low average and maximum degree. In this paper we present the first efficient distributed protocols that, in poly-logarithmically many rounds and with high probability, set up a connected network with O(1) average degree and O(log n) maximum

APA, Harvard, Vancouver, ISO, and other styles

20

De Santis, Emilio, Fabrizio Grandoni, and Alessandro Panconesi. "Low degree connectivity of ad-hoc networks via percolation." Advances in Applied Probability 42, no. 2 (2010): 559–76. http://dx.doi.org/10.1239/aap/1275055242.

Full text

Abstract:

Consider the following classical problem in ad-hoc networks. Suppose that n devices are distributed uniformly at random in a given region. Each device is allowed to choose its own transmission radius, and two devices can communicate if and only if they are within the transmission radius of each other. The aim is to (quickly) establish a connected network of low average and maximum degree. In this paper we present the first efficient distributed protocols that, in poly-logarithmically many rounds and with high probability, set up a connected network with O(1) average degree and O(log n) maximum

APA, Harvard, Vancouver, ISO, and other styles

21

Niu, Hongli, and Yunfan Lu. "Multiscale entropy and asynchronies of percolation-based price model and Chinese stock market." International Journal of Modern Physics C 32, no. 06 (2021): 2150073. http://dx.doi.org/10.1142/s012918312150073x.

Full text

Abstract:

In recent years, the concept of entropy is widely used to measure the degree of uncertainty or complexity of dynamics system. In our work, we utilize the composite multiscale entropy (CMSE) and the composite multiscale cross-sample entropy (CMSCE) which are two modified algorithms of SampEn and Cross-SampEn by considering multiscale factors, to, respectively, investigate the multiscale complexities and asynchronies (correlations) in the Chinese stock market (SSZ, SZSE and HSI) as well as in our established financial stock price model. The price model is given based on a greatly important stati

APA, Harvard, Vancouver, ISO, and other styles

22

Choi, Gary P. T., Siheng Chen, and Lakshminarayanan Mahadevan. "Control of connectivity and rigidity in prismatic assemblies." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 476, no. 2244 (2020): 20200485. http://dx.doi.org/10.1098/rspa.2020.0485.

Full text

Abstract:

How can we manipulate the topological connectivity of a three-dimensional prismatic assembly to control the number of internal degrees of freedom and the number of connected components in it? To answer this question in a deterministic setting, we use ideas from elementary number theory to provide a hierarchical deterministic protocol for the control of rigidity and connectivity. We then show that it is possible to also use a stochastic protocol to achieve the same results via a percolation transition. Together, these approaches provide scale-independent algorithms for the cutting or gluing of

APA, Harvard, Vancouver, ISO, and other styles

23

Tronin, I. V. "New algorithm to test percolation conditions within the Newman–Ziff algorithm." International Journal of Modern Physics C 25, no. 11 (2014): 1450064. http://dx.doi.org/10.1142/s0129183114500648.

Full text

Abstract:

A new algorithm to test percolation conditions for the solution of percolation problems on a lattice and continuum percolation for spaces of an arbitrary dimension has been proposed within the Newman–Ziff algorithm. The algorithm is based on the use of bitwise operators and does not reduce the efficiency of the operation of the Newman–Ziff algorithm as a whole. This algorithm makes it possible to verify the existence of both clusters touching boundaries at an arbitrary point and single-loop clusters continuously connecting the opposite boundaries in a percolating system with periodic boundary

APA, Harvard, Vancouver, ISO, and other styles

24

Uthamacumaran, Abicumaran, Narjara Gonzalez Suarez, Abdoulaye Baniré Diallo, and Borhane Annabi. "Computational Methods for Structure-to-Function Analysis of Diet-Derived Catechins-Mediated Targeting of In Vitro Vasculogenic Mimicry." Cancer Informatics 20 (January 2021): 117693512110092. http://dx.doi.org/10.1177/11769351211009229.

Full text

Abstract:

Background: Vasculogenic mimicry (VM) is an adaptive biological phenomenon wherein cancer cells spontaneously self-organize into 3-dimensional (3D) branching network structures. This emergent behavior is considered central in promoting an invasive, metastatic, and therapy resistance molecular signature to cancer cells. The quantitative analysis of such complex phenotypic systems could require the use of computational approaches including machine learning algorithms originating from complexity science. Procedures: In vitro 3D VM was performed with SKOV3 and ES2 ovarian cancer cells cultured on

APA, Harvard, Vancouver, ISO, and other styles

25

Volkov, Vladimir. "Adaptive multi-threshold object selection in remote sensing images." Information and Control Systems, no. 3 (June 15, 2020): 12–24. http://dx.doi.org/10.31799/1684-8853-2020-3-12-24.

Full text

Abstract:

Introduction: Detection, selection and analysis of objects of interest in digital images is a major problem for remote sensing and technical vision systems. The known methods of threshold detection and selection of objects avoid using the processing results, therefore not providing a low probability of false alarms, and not keeping the shape of the selected objects well enough. There are only few results from the studies about quantifying the quality of such algorithms on either model or real images. Purpose: Studying the effectiveness of algorithms for detecting, selecting, and localizing obj

APA, Harvard, Vancouver, ISO, and other styles

26

LI, CHUNYU, and TSU-WEI CHOU. "PRECISE DETERMINATION OF BACKBONE STRUCTURE AND CONDUCTIVITY OF 3D PERCOLATION NETWORKS BY THE DIRECT ELECTRIFYING ALGORITHM." International Journal of Modern Physics C 20, no. 03 (2009): 423–33. http://dx.doi.org/10.1142/s0129183109013777.

Full text

Abstract:

This paper confirms the applicability of a newly developed efficient algorithm, the direct electrifying method, for identifying backbone for 3D site and bond percolating networks. This algorithm is based on the current-carrying definition of backbone and carried out on the predetermined spanning cluster, which is assumed to be a resistor network. The scaling exponents so obtained for backbone mass, red bonds, and conductivity are in very good agreement with some existing results. The perfectly balanced bonds in 3D backbone structures are predicted first time to be 0.00179 ± 0.00009 and 0.00604

APA, Harvard, Vancouver, ISO, and other styles

27

Rai, Anjani, and Ashish Sharma. "Hybrid Cluster Algorithm and Task Allocation Optimization for Improving Percolation of Multi-targets in Wireless Sensor Networks." Journal of Advanced Research in Dynamical and Control Systems 11, no. 10-SPECIAL ISSUE (2019): 655–65. http://dx.doi.org/10.5373/jardcs/v11sp10/20192855.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

SCHOLDER, OLIVIER. "ANTI-RED BOND CALCULATION ALGORITHM IN PERCOLATION." International Journal of Modern Physics C 20, no. 02 (2009): 267–72. http://dx.doi.org/10.1142/s0129183109013595.

Full text

Abstract:

This paper presents an algorithm, which computes the number of anti-red bonds in a simple cubic lattice (site percolation) for different sizes and densities. Our interest was the fractal dimension of anti-red bonds at the percolation threshold. The value is found to be 1.18 ± 0.01. Two different theories proposed by Conigilio resp. Gouyet suggested a fractal dimension of 1.25 resp. 0.9. Thus, we can exclude the theory of Gouyet and are consistent with the one by Coniglio.

APA, Harvard, Vancouver, ISO, and other styles

29

Masson, Yder, and Steven R. Pride. "A Fast Algorithm for Invasion Percolation." Transport in Porous Media 102, no. 2 (2014): 301–12. http://dx.doi.org/10.1007/s11242-014-0277-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Kotwica, M., P. Gronek, and K. Malarz. "Efficient space virtualization for the Hoshen–Kopelman algorithm." International Journal of Modern Physics C 30, no. 08 (2019): 1950055. http://dx.doi.org/10.1142/s0129183119500554.

Full text

Abstract:

In this paper, the efficient space virtualisation for the Hoshen–Kopelman algorithm is presented. We observe minimal parallel overhead during computations, due to negligible communication costs. The proposed algorithm is applied for computation of random-site percolation thresholds for four dimensional simple cubic lattice with sites’ neighborhoods containing next–next–nearest neighbors (3NN). The obtained percolation thresholds are [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], where 2NN and NN

APA, Harvard, Vancouver, ISO, and other styles

31

Brower, R. C., Pablo Tamayo, and Bryant York. "A parallel multigrid algorithm for percolation clusters." Journal of Statistical Physics 63, no. 1-2 (1991): 73–88. http://dx.doi.org/10.1007/bf01026593.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Babalievski, F. "Cluster Counting: The Hoshen–Kopelman Algorithm Versus Spanning Tree Approaches." International Journal of Modern Physics C 09, no. 01 (1998): 43–60. http://dx.doi.org/10.1142/s0129183198000054.

Full text

Abstract:

Two basic approaches to the cluster counting task in the percolation and related models are discussed. The Hoshen–Kopelman multiple labeling technique for cluster statistics is redescribed. Modifications for random and aperiodic lattices are sketched as well as some parallelized versions of the algorithm are mentioned. The graph-theoretical basis for the spanning tree approaches is given by describing the breadth first search and depth first search procedures. Examples are given for extracting the elastic and geometric "backbone" of a percolation cluster. An implementation of the "pebble game"

APA, Harvard, Vancouver, ISO, and other styles

33

Meester, Ronald W. J. "An algorithm for calculating critical probabilities and percolation functions in percolation models defined by rotations." Ergodic Theory and Dynamical Systems 9, no. 3 (1989): 495–509. http://dx.doi.org/10.1017/s0143385700005137.

Full text

Abstract:

AbstractA class of percolation models on ℤd is developed in which the stochastic structure is provided by means of a d-parameter dynamical system. Of particular interest are those models generated by circle rotations. Unlike for independent models, the critical value and the percolation function can be explicitly calculated. These calculations lead to a conjecture concerning the behaviour of a related dynamical system.

APA, Harvard, Vancouver, ISO, and other styles

34

Altun, Mustafa, and Marc D. Riedel. "Robust Computation through Percolation." International Journal of Nanotechnology and Molecular Computation 3, no. 2 (2011): 12–30. http://dx.doi.org/10.4018/jnmc.2011040102.

Full text

Abstract:

This paper proposes a probabilistic framework for digital computation with lattices of nanoscale switches based on the mathematical phenomenon of percolation. With random connectivity, percolation gives rise to a sharp non-linearity in the probability of global connectivity as a function of the probability of local connectivity. This phenomenon is exploited to compute Boolean functions robustly in the presence of defects. It is shown that the margins, defined in terms of the steepness of the non-linearity, translate into the degree of defect tolerance. Achieving good margins entails a mapping

APA, Harvard, Vancouver, ISO, and other styles

35

Srivastava, Anurag, Joan Q. Wu, William J. Elliot, Erin S. Brooks, and Dennis C. Flanagan. "Modeling Streamflow in a Snow-Dominated Forest Watershed Using the Water Erosion Prediction Project (WEPP) Model." Transactions of the ASABE 60, no. 4 (2017): 1171–87. http://dx.doi.org/10.13031/trans.12035.

Full text

Abstract:

Abstract. The Water Erosion Prediction Project (WEPP) model was originally developed for hillslope and small watershed applications. Recent improvements to WEPP have led to enhanced computations for deep percolation, subsurface lateral flow, and frozen soil. In addition, the incorporation of channel routing has made the WEPP model well suited for large watersheds with perennial flows. However, WEPP is still limited in modeling forested watersheds where groundwater baseflow is substantial. The objectives of this study were to (1) incorporate nonlinear algorithms into WEPP (v2012.8) for estimati

APA, Harvard, Vancouver, ISO, and other styles

36

TIGGEMANN, DANIEL. "PERCOLATION ON GROWING LATTICES." International Journal of Modern Physics C 17, no. 08 (2006): 1141–50. http://dx.doi.org/10.1142/s012918310600962x.

Full text

Abstract:

In order to investigate the dependence on lattice size of several observables in percolation, the Hoshen–Kopelman algorithm was modified so that growing lattices could be simulated. By this way, when simulating a lattice of size L, lattices of smaller sizes can be simulated in the same run for free, saving computing time. Here, site percolation in three dimensions was studied. Lattices of up to L = 5000, with many L-steps in between, have been simulated, for occupation probabilities of p = 0.25, p = 0.3, p = pc = 0.311608, and p = 0.35.

APA, Harvard, Vancouver, ISO, and other styles

37

Yin, Wei-Guo, and Ruibao Tao. "Algorithm for finding two-dimensional site percolation backbones." Physica B: Condensed Matter 279, no. 1-3 (2000): 84–86. http://dx.doi.org/10.1016/s0921-4526(99)00675-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Fortin, Dominique, and Ider Tsevendorj. "Global optimization and multi knapsack: A percolation algorithm." European Journal of Operational Research 154, no. 1 (2004): 46–56. http://dx.doi.org/10.1016/s0377-2217(02)00858-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Ebrahimi, Fatemeh. "Invasion Percolation: A Computational Algorithm for Complex Phenomena." Computing in Science & Engineering 12, no. 2 (2010): 84–93. http://dx.doi.org/10.1109/mcse.2010.42.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Gotsman, Craig. "A cluster detection algorithm based on percolation theory." Pattern Recognition Letters 12, no. 4 (1991): 199–202. http://dx.doi.org/10.1016/0167-8655(91)90032-h.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

de FREITAS, JOAQUIM E., and LIACIR S. LUCENA. "EQUIVALENCE BETWEEN THE FLR TIME DEPENDENT PERCOLATION MODEL AND THE NEWMAN–ZIFF ALGORITHM." International Journal of Modern Physics C 11, no. 08 (2000): 1581–84. http://dx.doi.org/10.1142/s0129183100001425.

Full text

Abstract:

We compare the results of a very efficient algorithm that we have proposed to study the time evolution of percolation clusters when the occupation probability swept through the critical value in the same sample and in a single run with another algorithm proposed by Newman and Ziff to allow fast calculations of the standard percolation model. Both have a complexity per site that is roughly independent of the size of the system. Our results show that for the derivative threshold distribution, the results ( exponent = 1.8 ± 0.2) are closer to Wester while for the cumulative distribution ( exponen

APA, Harvard, Vancouver, ISO, and other styles

42

TIGGEMANN, DANIEL. "SIMULATION OF PERCOLATION ON MASSIVELY-PARALLEL COMPUTERS." International Journal of Modern Physics C 12, no. 06 (2001): 871–78. http://dx.doi.org/10.1142/s012918310100205x.

Full text

Abstract:

A novel approach to parallelize the well-known Hoshen–Kopelman algorithm has been chosen, suitable for simulating huge lattices in high dimensions on massively-parallel computers with distributed memory and message passing. This method consists of domain decomposition of the simulated lattice into strips perpendicular to the hyperplane of investigation that is used in the Hoshen–Kopelman algorithm. Systems of world record sizes, up to L = 4 000 256 in two dimensions, L = 20 224 in three, and L = 1036 in four, gave precise estimates for the Fisher exponent τ, the corrections to scaling Δ1, and

APA, Harvard, Vancouver, ISO, and other styles

43

García, Rafael, and Eduardo Rozo. "Halo exclusion criteria impacts halo statistics." Monthly Notices of the Royal Astronomical Society 489, no. 3 (2019): 4170–75. http://dx.doi.org/10.1093/mnras/stz2458.

Full text

Abstract:

ABSTRACT Every halo-finding algorithm must make a critical yet relatively arbitrary choice: it must decide which structures are parent haloes, and which structures are subhaloes of larger haloes. We refer to this choice as percolation. We demonstrate that the choice of percolation impacts the statistical properties of the resulting halo catalogue. Specifically, we modify the halo-finding algorithm rockstar to construct three different halo catalogues from the same simulation data, each with identical mass definitions, but different choice of percolation. The resulting haloes exhibit significan

APA, Harvard, Vancouver, ISO, and other styles

44

Edvinsson, T., P. J. Råsmark, and C. Elvingson. "Cluster Identification and Percolation Analysis Using a Recursive Algorithm." Molecular Simulation 23, no. 3 (1999): 169–90. http://dx.doi.org/10.1080/08927029908022121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

TIGGEMANN, DANIEL. "FLUCTUATIONS OF CLUSTER NUMBERS IN PERCOLATION." International Journal of Modern Physics C 13, no. 06 (2002): 777–81. http://dx.doi.org/10.1142/s0129183102003504.

Full text

Abstract:

In order to study fluctuations in percolating systems, lattices for sizes up to L = 100 000 have been simulated several thousand times using the Hoshen–Kopelman algorithm. Distributions of cluster numbers are Gaussians for small clusters and half-sided quasi-Gaussians for large clusters. The variance of cluster numbers is proportional to the mean, with power-law deviations for small clusters. Higher moments like skewness and kurtosis were also studied.

APA, Harvard, Vancouver, ISO, and other styles

46

TODO, S., K. KATO, H. TAKAYAMA, K. HARADA, N. KAWASHIMA, and S. MIYASHITA. "QUANTUM MONTE CARLO STUDY OF SITE-DILUTED HEISENBERG ANTIFERROMAGNET ON A SQUARE LATTICE." International Journal of Modern Physics C 10, no. 08 (1999): 1399–407. http://dx.doi.org/10.1142/s0129183199001170.

Full text

Abstract:

Ground-state phase transition of site-diluted Heisenberg antiferromagnets on a square lattice is studied. By using the continuous-time loop algorithm, we perform large-scale quantum Monte Carlo simulation on large systems at quite low temperatures. It is found that the critical concentration of magnetic sites is independent of the spin size S, and equal to the classical percolation threshold. However, the existence of quantum fluctuations makes the critical exponents deviate from those of the classical percolation transition. It is found that the transition is not universal, i.e., the critical

APA, Harvard, Vancouver, ISO, and other styles

47

Qiu, J., Y. B. Yi, and X. Guo. "Computational prediction of electrical and thermal conductivities of disklike particulate composites." International Journal of Computational Materials Science and Engineering 04, no. 03 (2015): 1550013. http://dx.doi.org/10.1142/s204768411550013x.

Full text

Abstract:

The effective conductivities are determined for randomly oriented disklike particles using an efficient computational algorithm based on the finite element method. The pairwise intersection criteria of disks are developed using a set of vector operations. An element partition scheme has been implemented to connect the elements on different disks across the lines of intersection. The computed conductivity is expressed as a function of the disk density and size. It is further expressed in a power-law form with the key parameters determined from curve fitting. The particle number and the trial nu

APA, Harvard, Vancouver, ISO, and other styles

48

KAWASHIMA, N., MARK JARRELL, and J. E. GUBERNATIS. "CLUSTER MONTE CARLO STUDY OF THE QUANTUM XY MODEL IN TWO DIMENSIONS." International Journal of Modern Physics C 07, no. 03 (1996): 433–40. http://dx.doi.org/10.1142/s0129183196000387.

Full text

Abstract:

The recent generalization of the Fortuin-Kasteleyn percolation representation and the Swendsen-Wang (SW) cluster algorithm is reviewed. The new representation yields cluster algorithm for the XYZ model with arbitrary magnitude of spins, with arbitrary anisotropies, and in any dimensions. The new algorithm often reduces computational autocorrelation times by several orders of magnitude. By using the new algorithm together with methods of Bayesian statistical inference, we obtained the dynamical structure factor S (k, ω) for the S =1/2 XY model in two dimensions.

APA, Harvard, Vancouver, ISO, and other styles

49

Chen, Hui Su, Piet Stroeven, Guang Ye, and Martijn Stroeven. "Influence of Boundary Conditions on Pore Percolation in Model Cement Paste." Key Engineering Materials 302-303 (January 2006): 486–92. http://dx.doi.org/10.4028/www.scientific.net/kem.302-303.486.

Full text

Abstract:

Fresh model cement mixtures, with the same w/c ratio and particle size distribution, were simulated by the SPACE system that is based on a dynamic mixing algorithm. Thereupon, they were hydrated by the HYMOSTRUC 3D system. Boundary conditions were varied, rendering possible assessment of their influence on percolation of capillary porosity by serial sectioning and using the overlap of slices. Simulation results revealed increases in total porosity and in connected fraction of capillary pores due to the existence of aggregate. The de-percolation threshold of capillary porosity was found not onl

APA, Harvard, Vancouver, ISO, and other styles

50

SADIQ, A., K. YALDRAM, and M. DAD. "PHASE DIAGRAM OF A DILUTE BINARY SYSTEM." International Journal of Modern Physics C 03, no. 02 (1992): 297–305. http://dx.doi.org/10.1142/s0129183192000245.

Full text

Abstract:

Phase diagram of a binary system with quenched impurities has been studied with Monte Carlo computer simulation technique. Use of Swendsen-Wang algorithm makes it possi-ble to explore the vicinity of percolation transition which was difficult to explore with the traditional Metropolis method. For small vacancy concentration υ(υ=1−p, where p is the spin concentration) the critical temperature, Tc, decreases linearly with υ consistent with earlier results on this system. For larger values of v departure from linearity is observed with Tc decreasing to zero sharply near the percolation threshold.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!