Related papers: Parameter estimation in a subcritical percolation …
We study random coloring of the hexagons of a honeycomb lattice into $2^{n-1}$ colors (that is the standard Potts model at infinite temperature). It may be considered as a generalization of percolation to $n$ pairwise independent, but…
We conducted Monte Carlo simulations to analyze the percolation transition of a non-symmetric loop model on a regular three-dimensional lattice. We calculated the critical exponents for the percolation transition of this model. The…
A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the sub-net mesh size goes to zero. The validity of this method is tested for bond percolation on filled…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
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…
The problem of vertex coloring in random graphs is studied using methods of statistical physics and probability. Our analytical results are compared to those obtained by exact enumeration and Monte-Carlo simulations. We critically discuss…
We consider bond percolation on the square lattice with perfectly correlated random probabilities. According to scaling considerations, mapping to a random walk problem and the results of Monte Carlo simulations the critical behavior of the…
In this paper, we propose a novel unsupervised color constancy method, called Probabilistic Color Constancy (PCC). We define a framework for estimating the illumination of a scene by weighting the contribution of different image regions…
A simple, discrete, parametric model is proposed to describe conditional (correlated) deposition of particles on a surface and formation of a connecting (percolating) cluster. The surface changes spontaneously its properties (phase…
Simple Monte Carlo is a versatile computational method with a convergence rate of $O(n^{-1/2})$. It can be used to estimate the means of random variables whose distributions are unknown. Bernoulli random variables, $Y$, are widely used to…
A rigourous Monte Carlo method for protein folding simulation on lattice model is introduced. We show that a parameter which can be seen as the rigidity of the conformations has to be introduced in order to satisfy the detailed balance…
We present a detailed description of the idea and procedure for the newly proposed Monte Carlo algorithm of tuning the critical point automatically, which is called the probability-changing cluster (PCC) algorithm [Y. Tomita and Y. Okabe,…
We study inhomogeneous Bernoulli bond percolation on the graph $G \times \mathbb{Z}$, where $G$ is a connected quasi-transitive graph. The inhomogeneity is introduced through a random region $R$ around the origin axis…
We consider a dilute lattice obtained from the usual $\mathbb{Z}^3$ lattice by removing independently each of its columns with probability $1-\rho$. In the remaining dilute lattice independent Bernoulli bond percolation with parameter $p$…
Disordered nanostructures with correlations on the scale of visible wavelengths can show angle-independent structural colors. These materials could replace dyes in some applications because the color is tunable and resists photobleaching.…
The fractions of samples spanning a lattice at its percolation threshold are found by computer simulation of random site-percolation in two- and three-dimensional hypercubic lattices using different boundary conditions. As a byproduct we…
We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…
We consider inhomogeneous non-oriented Bernoulli bond percolation on $\mathbb{Z}^d$, where each edge has a parameter depending on its direction. We prove that, under certain conditions, if the sum of the parameters is strictly greater than…
In regimes of low signal strengths and therefore a small signal-to-noise ratio, standard data analysis methods often fail to accurately estimate system properties. We present a method based on Monte Carlo simulations to effectively restore…
We investigate the problem of percolation of words in a random environment. To each vertex, we independently assign a letter $0$ or $1$ according to Bernoulli r.v.'s with parameter $p$. The environment is the resulting graph obtained from…