渗流相变实验

基于渗流相变理论设计了可重复使用的渗流实验仪器。在大学物理甚至高中物理一次实验课的时间内,利用渗流实验仪进行测量不同随机占据概率下的电流,对四次实验结果进行平均后,绘制相对电导率与占据概率曲线,可以获得与文献[9]相似的结果,再现渗流相变的存在。     

Deterministic Percolation

This paper examines percolation questions in a deterministic setting. In particular, I consider , the set of elements of Z ² with greatest common divisor equal to 1, where two sites are connected if they are at distance 1. The main result of the paper proves that the infinite component has an asymptotic density. An “almost everywhere” sieve of J. Friedlander is used to obtain the result. Received: 1 November 1998 / Accepted: 1 April 1999     

Target-Searching on Percolation

We study target-searching processes on a percolation, on which a hunter tracks a target by smelling odors it emits. The odor intensity is supposed to be inversely proportional to the distance it propagates. The Monte Carlo simulation is performed on a 2-dimensional bond-percolation above the threshold. Having no idea of the location of the target, the hunter determines its moves only by random attempts in each direction. For lager percolation connectivity p (＞～) 0.90, it reveals a scaling law for the searching time versus the distance to the position of the target. The scaling exponent is dependent on the sensitivity of the hunter. For smaller p, the scaling law is broken and the probability of finding out the target significantly reduces. The hunter seems trapped in the cluster of the percolation and can hardly reach the goal.     

Target-Searching on Percolation

We study target-searching processes on a percolation, on which a hunter tracks a target by smelling odors it emits. The odor intensity is supposed to be inversely proportional to the distance it propagates. The Monte Carlo simulation is performed on a 2-dimensional bond-percolation above the threshold. Having no idea of the location of the target, the hunter determines its moves only by random attempts in each direction. For lager percolation connectivity p 〉 0.90, it reveals a scaling law for the searching time versus the distance to the position of the target. The scaling exponent is dependent on the sensitivity of the hunter. For smaller p, the scaling law is broken and the probability of finding out the target significantly reduces. The hunter seems trapped in the cluster of the percolation and can hardly reach the goal.     

Tricritical Directed Percolation

We consider a modification of the contact process incorporating higher-order reaction terms. The original contact process exhibits a non-equilibrium phase transition belonging to the universality class of directed percolation. The incorporated higher-order reaction terms lead to a non-trivial phase diagram. In particular, a line of continuous phase transitions is separated by a tricritical point from a line of discontinuous phase transitions. The corresponding tricritical scaling behavior is analyzed in detail, i.e., we determine the critical exponents, various universal scaling functions as well as universal amplitude combinations. PACS numbers: 05.70.Ln, 05.50.+q, 05.65.+b     

Percolation cluster numbers

It has recently been suggested that there may be an infinite number of independent exponents hidden in the tails of the probability distribution of average percolation cluster numbers. A simple approximation of non-Gaussian effects was used to deduce this result and we show that this approximation is questionable. Extensive simulations of the cluster distribution have been made and an interesting dependence of the cumulants on concentration and range of summation has been observed.     

First-Passage Percolation, Semi-Directed Bernoulli Percolation, and Failure in Brittle Materials

We present a two-dimensional, quasistatic model of fracture in disordered brittle materials that contains elements of first-passage percolation, i.e., we use a minimum-energy-consumption criterion for the fracture path. The first-passage model is employed in conjunction with a semi-directed Bernoulli percolation model, for which we calculate critical properties such as the correlation length exponent v ^sdir and the percolation threshold p _c ^sdir . Among other results, our numerics suggest that v ^sdir is exactly 3/2, which lies between the corresponding known values in the literature for usual and directed Bernoulli percolation. We also find that the well-known scaling relation between the wandering and energy fluctuation exponents breaks down in the vicinity of the threshold for semi-directed percolation. For a restricted class of materials, we study the dependence of the fracture energy (toughness) on the width of the distribution of the specific fracture energy and find that it is quadratic in the width for small widths for two different random fields, suggesting that this dependence may be universal.     

Percolation and Julia sets

The types of Julia sets for the renormalization group (RG) transformation for percolation on the hierarchial model are derived. The RG transformation for the concentration for two-dimensional triangular lattice site percolation problems and two-dimensional square lattice bond percolation problems are generalized to the complex plane. Julia sets for both cases are found.     

Knotted Paths in Percolation

We study the topology of doubly-infinite paths in the bond percolation model on the three-dimensional cubic lattice. We propose a natural definition of a knotted doubly-infinite path. We prove the existence of a critical probability p _k satisfying p _c < p _k < 1 (where p _c is the usual percolation critical probability), such that for p _c < p < p _k , all doubly-infinite open paths are knotted, while for p > p _k there are unknotted doubly-infinite paths.     

Percolation with Constant Freezing

We introduce and study a model of percolation with constant freezing (PCF) where edges open at constant rate $1$ , and clusters freeze at rate $\alpha $ independently of their size. Our main result is that the infinite volume process can be constructed on any amenable vertex transitive graph. This is in sharp contrast to models of percolation with freezing previously introduced, where the limit is known not to exist. Our interest is in the study of the percolative properties of the final configuration as a function of $\alpha $ . We also obtain more precise results in the case of trees. Surprisingly the algebraic exponent for the cluster size depends on the degree, suggesting that there is no lower critical dimension for the model. Moreover, even for $\alpha <\alpha _c$ , it is shown that finite clusters have algebraic tail decay, which is a signature of self organised criticality. Partial results are obtained on $\mathbb {Z}^d$ , and many open questions are discussed.     

Inequalities in Entanglement Percolation

We present proofs of two results concerning entanglement in three-dimensional bond percolation. Firstly, the critical probability for entanglement with free boundary conditions is strictly less than the critical probability for connectivity percolation. (The proof presented here is a detailed justification of the ideas sketched in Aizenman and Grimmett.) Secondly, under the hypothesis that the critical probabilities for entanglement with free and wired boundary conditions are different, for p between the two critical probabilities, the size of the entangled cluster at the origin with free boundary conditions does not have exponentially decaying tails.     

Multi-Type Directed Scale-Free Percolation

In this paper,we study a long-range percolation model on the lattice Z d with multi-type vertices and directed edges.Each vertex x ∈ Z d is independently assigned a non-negative weight Wx and a type ψx,where(Wx) x∈Z d are i.i.d.random variables,and(ψx) x∈Z d are also i.i.d.Conditionally on weights and types,and given λ,α 0,the edges are independent and the probability that there is a directed edge from x to y is given by pxy = 1 exp(λφψ x ψ y WxWy /| x-y | α),where φij 's are entries from a type matrix Φ.We show that,when the tail of the distribution of Wx is regularly varying with exponent τ-1,the tails of the out/in-degree distributions are both regularly varying with exponent γ = α(τ-1) /d.We formulate conditions under which there exist critical values λ WCC c ∈(0,∞) and λ SCC c ∈(0,∞) such that an infinite weak component and an infinite strong component emerge,respectively,when λ exceeds them.A phase transition is established for the shortest path lengths of directed and undirected edges in the infinite component at the point γ = 2,where the out/in-degrees switch from having finite to infinite variances.The random graph model studied here features some structures of multi-type vertices and directed edges which appear naturally in many real-world networks,such as the SNS networks and computer communication networks.     

Percolation in self-similar networks

We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering, scale-free graphs with finite clustering and metric structure, growing scale-free networks, and many real networks. The proof and the derivation of the giant component size do not require the assumption that networks are treelike. Our results rely only on the observation that self-similar networks possess a hierarchy of nested subgraphs whose average degree grows with their depth in the hierarchy. We conjecture that this property is pivotal for percolation in networks.     

Mean Field Frozen Percolation

We define a modification of the Erd?s-Rényi random graph process which can be regarded as the mean field frozen percolation process. We describe the behavior of the process using differential equations and investigate their solutions in order to show the self-organized critical and extremum properties of the critical frozen percolation model. We prove two limit theorems about the distribution of the size of the component of a typical frozen vertex.     

Backbends in Directed Percolation

When directed percolation in a bond percolation process does not occur, any path to infinity on the open bonds will zigzag back and forth through the lattice. Backbends are the portions of the zigzags that go against the percolation direction. They are important in the physical problem of particle transport in random media in the presence of a field, as they act to limit particle flow through the medium. The critical probability for percolation along directed paths with backbends no longer than a given length n is defined as p _n. We prove that (p _n) is strictly decreasing and converges to the critical probability for undirected percolation p _c. We also investigate some variants of the basic model, such as by replacing the standard d-dimensional cubic lattice with a (d–1)-dimensional slab or with a Bethe lattice; and we discuss the mathematical consequences of alternative ways to formalize the physical concepts of percolation and backbend.     

Percolation in living neural networks

We study living neural networks by measuring the neurons' response to a global electrical stimulation. Neural connectivity is lowered by reducing the synaptic strength, chemically blocking neurotransmitter receptors. We use a graph-theoretic approach to show that the connectivity undergoes a percolation transition. This occurs as the giant component disintegrates, characterized by a power law with an exponent beta approximately or = 0.65. Beta is independent of the balance between excitatory and inhibitory neurons and indicates that the degree distribution is Gaussian rather than scale free.     

A Note on Anisotropic Percolation

We consider an anisotropic independent bond percolation model on , i.e. we suppose that the vertical edges of are open with probability p and closed with probability 1–p, while the horizontal edges of are open with probability p and closed with probability 1– p, with 0 < p, < 1. Let , with x₁ < x₂, and . It is natural to ask how the two point connectivity function P_p,({0 x}) behaves, and whether anisotropy in percolation probabilities implies the strict inequality P_p,({0 x})> P_p,({0 x}). In this note we give affirmative answer at least for some regions of the parameters involved.Mathematics Subject Classifications (2000). 82B20, 82B41, 82B43.