Related papers: Colored Percolation
In the colour string model the impact of string percolation on multiplicities, their long-range correlations and average transverse momentum is studied. The multiplicities are shown to be damped by a simple factor which follows from the…
In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…
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…
In order to investigate the dependence on lattice size of several observables in percolation, the Hoshen-Kopelman algorithm was modified so that growing lattices could be simulated. By this way, when simulating a lattice of size L, lattices…
In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
Given a graphical degree sequence ${\bf d}=(d_1,\ldots, d_n)$, let $G(n, {\bf d})$ denote a uniformly random graph on vertex set $[n]$ where vertex $ i$ has degree $d_i$ for every $1\le i\le n$. We give upper and lower bounds on the joint…
The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In this paper, we determine the order of magnitude of the clique chromatic number of the random graph…
Controlled experimental studies of percolation are challenging due to difficulties in tuning site connectivity, isolating local interactions, and mitigating finite-size effects. In this work, we experimentally investigate percolation with a…
We consider a directed percolation process on an ${\cal M}$ x ${\cal N}$ rectangular lattice whose vertical edges are directed upward with an occupation probability y and horizontal edges directed toward the right with occupation…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
One of the essential issues in decision problems and preference modeling is the number of comparisons and their pattern to ask from the decision maker. We focus on the optimal patterns of pairwise comparisons and the sequence including the…
In this article, we revisit random site and bond percolation in square lattice focusing primarily on the behavior of entropy and order parameter. In the case of traditional site percolation, we find that both the quantities are zero at…
The statistical properties of spectra of a three-dimensional quantum bond percolation system is studied in the vicinity of the metal insulator transition. In order to avoid the influence of small clusters, only regions of the spectra in…
Coloring the vertices of a graph G subject to given conditions can be considered as a random experiment and corresponding to this experiment, a discrete random variable X can be defined as the colour of a vertex chosen at random, with…
Three-dimensional quantum percolation problems are studied by analyzing energy level statistics of electrons on maximally connected percolating clusters. The quantum percolation threshold $\pq$, which is larger than the classical…
We give a characterization of finite sets of triples of elements (e.g., positive integers) that can be colored with two colors such that for every element $i$ in each color class there exists a triple which does not contain $i$. We give a…
Any quantum algorithm can be implemented by an adaptive sequence of single node measurements on an entangled cluster of qubits in a square lattice topology. Photons are a promising candidate for encoding qubits but assembling a photonic…
In the first part of this paper, we consider weighted domination in the case where the vertices of the complete graph on~\(n\) vertices are equipped with independent and identically distributed (i.i.d.) weights. We use the probabilistic…
We explore a bond percolation model on slabs $\mathbb{S}^+_k=\mathbb{Z}_+\times \mathbb{Z}_+\times\{0,\dots,k\}$ featuring one-dimensional inhomogeneities. In this context, a vertical column on the slab comprises the set of vertical edges…