Related papers: Long Range Percolation Mixing Time
We consider different problems within the general theme of long-range percolation on oriented graphs. Our aim is to settle the so-called truncation question, described as follows. We are given probabilities that certain long-range oriented…
We study the percolation time of the $r$-neighbour bootstrap percolation model on the discrete torus $(\Z/n\Z)^d$. For $t$ at most a polylog function of $n$ and initial infection probabilities within certain ranges depending on $t$, we…
We perform large scale three-dimensional molecular dynamics simulations of unlinked and unknotted ring polymers diffusing through a background gel, here a three-dimensional cubic lattice. Taking advantage of this architecture, we propose a…
We continue our study of the chemical (graph) distance inside large critical percolation clusters in dimension two. We prove new estimates, which involve the three-arm probability, for the point-to-surface and point-to-point distances. We…
We settle an open problem, raised by Y. Peres and D. Revelle, concerning the $L^2$ mixing time of the random walk on the lamplighter graph. We also provide general bounds relating the entropy decay of a Markov chain to the separation…
We study structural phase transition of polymer-grafted colloidal particles by Monte Carlo simulations on hard spherical particles. The interaction potential, which has a weak repulsive step outside the hard core, was validated with use of…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
For the binary discs packed in two dimensions, the packing fraction of disc assembly becomes lower than that of the monodisperse system when the size ratio is close to unity. We show that the suppressed packing fraction is caused by an…
The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
Computing the LZ factorization (or LZ77 parsing) of a string is a computational bottleneck in many diverse applications, including data compression, text indexing, and pattern discovery. We describe new linear time LZ factorization…
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…
In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include $O_\epsilon(m)$-time algorithms for $(1-\epsilon)$-maximum weight $f$-factor and…
We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…
Percolation phenomena of homopolymer brushes on a planar substrate are simulated using the molecular Monte Carlo method in 3 dimensions. The grafted polymers are isolated from each other at extremely low grafting density, whereas a…
A liquid droplet is fragmented by a sudden pressurized-gas blow, and the resulting droplets, adhered to the window of a flatbed scanner, are counted and sized by computerized means. The use of a scanner plus image recognition software…
In r-neighbour bootstrap percolation on the vertex set of a graph G, vertices are initially infected independently with some probability p. At each time step, the infected set expands by infecting all uninfected vertices that have at least…
We calculate Root Mean Square (RMS) deviations from equilibrium for atoms in a two dimensional crystal with local (e.g. covalent) bonding between close neighbors. Large scale Monte Carlo calculations are in good agreement with analytical…
We ascertain the diffusively scaled limit of a periodic Lorentz process in a strip with an almost reflecting wall at the origin. Here, almost reflecting means that the wall contains a small hole waning in time. The limiting process is a…
In this paper we consider independent site percolation in a triangulation of $\mathbb{R}^2$ given by adding $\sqrt{2}$-long diagonals to the usual graph $\mathbb{Z}^2$. We conjecture that $p_c=\frac{1}{2}$ for any such graph, and prove it…