Related papers: Universal features of cluster numbers in percolati…
We investigate the behavior of extended urban traffic networks within the framework of percolation theory by using real and synthetic traffic data. Our main focus shifts from the statistical properties of the cluster size distribution…
This paper proposes a new method for similarity analysis and, consequently, a new algorithm for clustering different types of random attributes, both numerical and nominal. However, in order for nominal attributes to be clustered, their…
We study the scaling behavior of the entanglement entropy of two dimensional conformal quantum critical systems, i.e. systems with scale invariant wave functions. They include two-dimensional generalized quantum dimer models on bipartite…
Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…
Consider Bernoulli bond percolation on a graph nicely embedded in hyperbolic space $\mathbb H^d$ in such a way that it admits a transitive action by isometries of $\mathbb H^d$. Let $p_0$ be the supremum of such percolation parameters that…
We analyze the critical connectivity of systems of penetrable $d$-dimensional spheres having size distributions in terms of weighed random geometrical graphs, in which vertex coordinates correspond to random positions of the sphere centers…
One of the most well-known classical results for site percolation on the square lattice is the equation p_c + p_c^* = 1. In words, this equation means that for all values different from p_c of the parameter p the following holds: Either…
Universal behavior is a typical emergent feature of critical systems. A paramount model of the non-equilibrium critical behavior is the directed bond percolation process that exhibits an active- to-absorbing state phase transition in the…
We study loop percolation models in two and in three space dimensions, in which configurations of occupied bonds are forced to form closed loop. We show that the uncorrelated occupation of elementary plaquettes of the square and the simple…
We present an algorithm to compute the exact probability $R_{n}(p)$ for a site percolation cluster to span an $n\times n$ square lattice at occupancy $p$. The algorithm has time and space complexity $O(\lambda^n)$ with $\lambda \approx…
We investigate the maximal non-critical cluster in a big box in various percolation-type models. We investigate its typical size, and the fluctuations around this typical size. The limit law of these fluctuations are related to maxima of…
I consider a one dimensional system of particles which interact through a hard core of diameter $\si$ and can connect to each other if they are closer than a distance $d$. The mean cluster size increases as a function of the density $\rho$…
The review is a brief description of the state of problems in percolation theory and their numerous applications, which are analyzed on base of interesting papers published in the last 15-20 years. At the submitted papers are studied both…
We examine the percolation model in $\mathbb{Z}^d$ by an approach involving lattice animals, in which their relevant characteristic is surface-area-to-volume ratio. Two critical exponents are introduced. The first is related to the growth…
We consider the Bernoulli percolation model in a finite box and we introduce an automatic control of the percolation probability, which is a function of the percolation configuration. For a suitable choice of this automatic control, the…
Quantum-chaotic systems exhibit several universal properties, ranging from level repulsion in the energy spectrum to wavefunction delocalization. On the other hand, if wavefunctions are localized, the levels exhibit no level repulsion and…
Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| <…
We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds to be $p_c ({\rm bond})=0.248\,811\,82(10)$ and $p_c ({\rm site})=0.311\,607\,7(2)$. By…
We prove rigorously several results about the site-percolation on random recursive trees, observed in the previous work by Kalay and Ben-Naim [J. Phys. A48(2015), no.4, 0405001, 15 pp.]. For a random recursive tree of size $n$, let every…
We study long-range power-law correlated disorder on square and cubic lattices. In particular, we present high-precision results for the percolation thresholds and the fractal dimension of the largest clusters as function of the correlation…