Related papers: Monochromatic path crossing exponents and graph co…
In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially 'infected' vertices spreads by infecting (at each time step) vertices with at least r already-infected neighbours. This process may be viewed as a…
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…
We study the contact process on spatially embedded networks, consisting of a regular square lattice with long-range connections. To generate the networks, a long-range connection is randomly added to each node $i$ of a square lattice,…
We introduce appropriate definitions of dimensions in order to characterize the fractal properties of complex networks. We compute these dimensions in a hierarchically structured network of particular interest. In spite of the nontrivial…
We find that 2-dimensional (2-D) critical branched polymers with no impurities conclusively belong to the same universality class as 2-D random percolation clusters, although pure critical 3-D branched polymers do not belong to the 3-D…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
Directed spiral percolation (DSP), percolation under both directional and rotational constraints, is studied on the triangular lattice in two dimensions (2D). The results are compared with that of the 2D square lattice. Clusters generated…
In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it…
In the previous article (S. Matsutani and Y. Shimosako and Y. Wang, Physica A \bf{391} (2012) 5802-5809) we numerically investigated an electric potential problem with high contrast local conductivities ($\gamma_0$ and $\gamma_1$,…
Self-avoiding polymers in two-dimensional ($d=2$) melts are known to adopt compact configurations of typical size $R(N) \sim N^{1/d}$ with $N$ being the chain length. Using molecular dynamics simulations we show that the irregular shapes of…
We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…
Using Monte Carlo simulations on different system sizes we determine with high precision the critical thresholds of two families of directed percolation models on a square lattice. The thresholds decrease exponentially with the degree of…
If we two-colour a circle, we can always find an inscribed triangle with angles $(\frac{\pi}{7},\frac{2\pi}{7},\frac{4\pi}{7})$ whose three vertices have the same colour. In fact, Bialostocki and Nielsen showed that it is enough to consider…
Chromosomes in the nucleus assemble into hierarchies of 3D domains that, during interphase, share essential features with a knot-free condensed polymer known as the fractal globule (FG). The FG-like chromosome likely affects macromolecular…
We study invasion percolation in two dimensions, focusing on properties of the outlets of the invasion and their relation to critical percolation and to incipient infinite clusters (IIC's). First we compute the exact decay rate of the…
Connections are found between the two-component percolation problem and the conductor/insulator percolation problem. These produce relations between critical exponents, and suggest formulae connecting the conductivity exponents in different…
We perform Monte-Carlo simulations to study the Bernoulli ($p$) bond percolation on the enhanced binary tree which belongs to the class of nonamenable graphs with one end. Our numerical results show that the system has two different…
We study the clusters of loops in a Brownian loop soup in some bounded two-dimensional domain with subcritical intensity $\theta \in (0,1/2]$. We obtain an exact expression for the asymptotic probability of the existence of a cluster…
Bootstrap Percolation is a process defined on a graph which begins with an initial set of infected vertices. In each subsequent round, an uninfected vertex becomes infected if it is adjacent to at least $r$ previously infected vertices. If…
We study spatial clustering in a discrete, one-dimensional, stochastic, toy model of heavy particles in turbulence and calculate the spectrum of multifractal dimensions $D_q$ as functions of a dimensionless parameter, $\alpha$, that plays…