Site and bond percolation thresholds on regular lattices with compact extended-range neighborhoods in two and three dimensions

A Concept of Local Coordination Number for the Characterization of Solute Clusters within Atom Probe Tomography Data

Identifying clusters of solute atoms in a matrix of solvent atoms helps to understand precipitation phenomena in alloys, for example, during the age hardening of certain aluminum alloys. Atom probe tomography datasets can deliver such information, provided that appropriate cluster identification routines are available. We investigate algorithms based on the local composition of the neighborhood of solute atoms and compare them with traditional approaches based on the local solute number density, such as the maximum separation distance method. For an ideal solid solution, the pair correlation functions of the kth nearest solute atom in the coordination number representation are derived, and the percolation threshold and the size distribution of clusters are studied. A criterion for selecting optimal control parameters based on maximizing the phase separation by the degree of clustering is proposed for a two-phase system. A map of phase compositions accessible for cluster analysis is constructed. The coordination number approach reduces the influence of density variations commonly observed in atom probe tomography data. Finally, a practical cluster analysis technique applied to the early stages of aluminum alloy aging is described.

General theory for extended-range percolation on simple and multiplex networks

Extended-range percolation is a robust percolation process that has relevance for quantum communication problems. In extended-range percolation nodes can be trusted or untrusted. Untrusted facilitator nodes are untrusted nodes that can still allow communication between trusted nodes if they lie on a path of distance at most R between two trusted nodes. In extended-range percolation the extended-range giant component (ERGC) includes trusted nodes connected by paths of trusted and untrusted facilitator nodes. Here, based on a message-passing algorithm, we develop a general theory of extended-range percolation, valid for arbitrary values of R as long as the networks are locally treelike. This general framework allows us to investigate the properties of extended-range percolation on interdependent multiplex networks. While the extended-range nature makes multiplex networks more robust, interdependency makes them more fragile. From the interplay between these two effects a rich phase diagram emerges including discontinuous phase transitions and reentrant phases. The theoretical predictions are in excellent agreement with extensive Monte Carlo simulations. The proposed exactly solvable model constitutes a fundamental reference for the study of models defined through properties of extended-range paths.

Universal superdiffusion of random walks in media with embedded fractal networks of low diffusivity

Diffusion in composite media with high contrasts between diffusion coefficients in fractal sets of inclusions and in their embedding matrices is modeled by lattice random walks (RWs) with probabilities p<1 of hops from fractal sites and 1 from matrix sites. Superdiffusion is predicted in time intervals that depend on p and with diffusion exponents that depend on the dimensions of matrix (E) and fractal (D_{F}) as ν=1/(2+D_{F}-E). This contrasts with the nonuniversal subdiffusion of RWs confined to fractal media. Simulations with four fractals show the anomaly at several time decades for p≲10^{-3} and the crossover to the asymptotic normal diffusion. These results show that superdiffusion can be observed in isotropic RWs with finite moments of hop length distributions and allow the estimation of the dimension of the inclusion set from the diffusion exponent. However, displacements within single trajectories have normal scaling, which shows transient ergodicity breaking.

Effect of shape anisotropy on percolation of aligned and overlapping objects on lattices

We investigate the percolation transition of aligned, overlapping, anisotropic shapes on lattices. Using the recently proposed lattice version of excluded volume theory, we show that shape-anisotropy leads to some intriguing consequences regarding the percolation behavior of anisotropic shapes. We consider a prototypical anisotropic shape-rectangle-on a square lattice and show that, for rectangles of width unity (sticks), the percolation threshold is a monotonically decreasing function of the stick length, whereas, for rectangles of width greater than two, it is a monotonically increasing function. Interestingly, for rectangles of width two, the percolation threshold is independent of its length. We show that this independence of threshold on the length of a side holds for d-dimensional hypercubiods as well as for specific integer values for the lengths of the remaining sides. The limiting case of the length of the rectangles going to infinity shows that the limiting threshold value is finite and depends upon the width of the rectangle. This "continuum" limit with the lattice spacing tending to zero only along a subset of the possible directions in d dimensions results in a "semicontinuum" percolation system. We show that similar results hold for other anisotropic shapes and lattices in different dimensions. The critical properties of the aligned and overlapping rectangles are evaluated using Monte Carlo simulations. We find that the threshold values given by the lattice-excluded volume theory are in good agreement with the simulation results, especially for larger rectangles. We verify the isotropy of the percolation threshold and also compare our results with models where rectangles of mixed orientation are allowed. Our simulation results show that alignment increases the percolation threshold. The calculation of critical exponents places the model in the standard percolation universality class. Our results show that shape anisotropy of the aligned, overlapping percolating units has a marked influence on the percolation properties, especially when a subset of the dimensions of the percolation units is made to diverge.

Universality of random-site percolation thresholds for two-dimensional complex noncompact neighborhoods

The phenomenon of percolation is one of the core topics in statistical mechanics. It allows one to study the phase transition known in real physical systems only in a purely geometrical way. In this paper, we determine thresholds p_{c} for random-site percolation in triangular and honeycomb lattices for all available neighborhoods containing sites from the sixth coordination zone. The results obtained (together with the percolation thresholds gathered from the literature also for other complex neighborhoods and also for a square lattice) show the power-law dependence p_{c}∝(ζ/K)^{-γ} with γ=0.526(11), 0.5439(63), and 0.5932(47), for a honeycomb, square, and triangular lattice, respectively, and p_{c}∝ζ^{-γ} with γ=0.5546(67) independently on the underlying lattice. The index ζ=∑_{i}z_{i}r_{i} stands for an average coordination number weighted by distance, that is, depending on the coordination zone number i, the neighborhood coordination number z_{i}, and the distance r_{i} to sites in the ith coordination zone from the central site. The number K indicates lattice connectivity, that is, K=3, 4, and 6 for the honeycomb, square, and triangular lattice, respectively.

Extended-range percolation in complex networks

Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able to communicate is the presence of at least one uninterrupted path of nodes between them. In a variety of more recent data transmission protocols, such as the communication of noisy data via error-correcting repeaters, both in classical and quantum networks, the requirement of an uninterrupted path is too strict: two nodes may be able to communicate even if all paths between them have interruptions or gaps consisting of nodes that may corrupt the message. In such a case a different approach is needed. We develop the theoretical framework for extended-range percolation in networks, describing the fundamental connectivity properties relevant to such models of information transfer. We obtain exact results, for any range R, for infinite random uncorrelated networks and we provide a message-passing formulation that works well in sparse real-world networks. The interplay of the extended range and heterogeneity leads to novel critical behavior in scale-free networks.

Site percolation in distorted square and simple cubic lattices with flexible number of neighbors

This paper exhibits a Monte Carlo study on site percolation using the Newmann-Ziff algorithm in distorted square and simple cubic lattices where each site is allowed to be directly linked with any other site if the Euclidean separation between the pair is at most a certain distance d, called the connection threshold. Distorted lattices are formed from regular lattices by a random but controlled dislocation of the sites with the help of a parameter α, called the distortion parameter. The distinctive feature of this study is the relaxation of the restriction of forming bonds with only the nearest neighbors. Owing to this flexibility and the intricate interplay between the two parameters α and d, the site percolation threshold may either increase or decrease with distortion. The dependence of the percolation threshold on the average degree of a site has been explored to show that the obtained results are consistent with those on percolation in regular lattices with an extended neighborhood and continuum percolation.

Percolation in a simple cubic lattice with distortion

Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular positions. The amount of distortion is tunable by a parameter called the distortion parameter. In this model, two occupied neighboring sites are considered connected only if the distance between them is less than a predefined value called the connection threshold. It is observed that the percolation threshold always increases with distortion if the connection threshold is equal to or greater than the lattice constant of the regular lattice. On the other hand, if the connection threshold is less than the lattice constant, the percolation threshold first decreases and then increases steadily as distortion is increased. It is shown that the variation of the percolation threshold can be well explained by the change in the fraction of occupied bonds with distortion. The values of the relevant critical exponents of the transition strongly indicate that percolation in regular and distorted simple cubic lattices belong to the same universality class. It is also demonstrated that this model is intrinsically distinct from the site-bond percolation model.

Random site percolation on honeycomb lattices with complex neighborhoods

We present a rough estimation-up to four significant digits, based on the scaling hypothesis and the probability of belonging to the largest cluster vs the occupation probability-of the critical occupation probabilities for the random site percolation problem on a honeycomb lattice with complex neighborhoods containing sites up to the fifth coordination zone. There are 31 such neighborhoods with a radius ranging from one to three and containing 3-24 sites. For two-dimensional regular lattices with compact extended-range neighborhoods, in the limit of the large number z of sites in the neighborhoods, the site percolation thresholds _p follow the dependency _p ∝ 1 / z, as recently shown by Xun et al. [Phys. Rev. E 105, 024105 (2022)]. On the contrary, non-compact neighborhoods (with holes) destroy this dependence due to the degeneracy of the percolation threshold (several values of _p corresponding to the same number z of sites in the neighborhoods). An example of a single-value index ζ = ∑ i _{z r}-where _z and _r are the number of sites and radius of the ith coordination zone, respectively-characterizing the neighborhood and allowing avoiding the above-mentioned degeneracy is presented. The percolation threshold obtained follows the inverse square root dependence _p ∝ 1 / ζ. The functions boundaries() (written in C) for basic neighborhoods (for the unique coordination zone) for the Newman and Ziff algorithm [Phys. Rev. E 64, 016706 (2001)] are also presented. The latter may be useful for computer physicists dealing with solid-state physics and interdisciplinary statistical physics applications, where the honeycomb lattice is the underlying network topology.

Catalytic Conversion of Hydrocarbons and Formation of Carbon Nanofilaments in Porous Pellets

Catalytic conversion of hydrocarbons occurring at metal nanoparticles in porous pellets is often accompanied by the formation of coke in the form of growing heterogeneous film-like aggregates or carbon nanofilaments. The latter processes result in deactivation of metal nanoparticles. The corresponding kinetic models imply the formation and growth of film-like coke aggregates. Herein, I present an alternative generic kinetic model focused on the formation and growth of carbon nanofilaments. These processes are considered to deactivate metal nanoparticles and reduce the rate of reactant diffusion in pores. In this framework, the kinetically limited reaction regime is described by simple analytical expressions. The diffusion-limited regime can be described as well but only numerically. The model presented can be used for interpretation of experimental results.

Graphical Abstract