Results 231 to 240 of about 23,603 (268)
Phase Separation of Nucleic Acids: Mechanisms, Properties, and Applications. [PDF]
Chen W, Fritzen J, Walther A.
europepmc +1 more source
Network analysis of anxiety, depression and insomnia in the elderly in Jiangsu Province. [PDF]
Han W +9 more
europepmc +1 more source
Geometrically Optimized FDM-Printed Conductive TPU Bend Sensors for Hand Rehabilitation. [PDF]
Özkurt A +4 more
europepmc +1 more source
Enhanced Absorption Dominated Electromagnetic Interference Shielding Enabled by Carbon Nanotube and Graphene Reinforced Electrospun PVDF Nanocomposite. [PDF]
Bamufleh H +7 more
europepmc +1 more source
Frequency Dependence of Microwave Permeability in Composite Materials Filled with Gadolinium Particles: Effects of Temperature and Filler Fraction. [PDF]
Komarov IV +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Invasion percolation into a percolating cluster
Physical Review A, 1992Results are presented for two-dimensional invasion-percolation simulations into percolating clusters. The fractal dimensions of the invading clusters are calculated for different occupation fractions. If the percolating cluster is above the percolation threshold, the fractal dimension is 1.81.
, Paredes V, , Octavio
openaire +2 more sources
Annales de l'Institut Henri Poincare (B) Probability and Statistics, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Häggström, Olle +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Häggström, Olle +2 more
openaire +1 more source
Percolation and invasion percolation as fractal growth problems
Physical Review A, 1990We apply the fixed-scale transformation method, developed for Laplacian fractal growth, to compute the fractal dimension of standard percolating clusters and of clusters generated by invasion percolation with and without trapping. In all cases we obtain values within 1% from the exact or numerical results.
L. PIETRONERO +2 more
openaire +2 more sources
Random Structures & Algorithms, 2013
AbstractLet G be an infinite connected graph with minimum degree δ and maximum degree Δ. Let Gp be a random induced subgraph of G obtained by selecting each vertex of G independently with probability p, , and let be the induced subgraph of Gp obtained by deleting all vertices of Gp with degree greater than k in Gp.
Paul Balister, Béla Bollobás
openaire +1 more source
AbstractLet G be an infinite connected graph with minimum degree δ and maximum degree Δ. Let Gp be a random induced subgraph of G obtained by selecting each vertex of G independently with probability p, , and let be the induced subgraph of Gp obtained by deleting all vertices of Gp with degree greater than k in Gp.
Paul Balister, Béla Bollobás
openaire +1 more source

