Related papers: Long Range Percolation Mixing Time
Emission of anisotropic gravitational radiation from compact binary system leads to a flux of linear momentum. This results in the recoil of the system. We investigate the rate of loss of Linear momentum flux in the far zone of the source…
We consider the percolation problem of sites on an $L\times L$ square lattice with periodic boundary conditions which were unvisited by a random walk of $N=uL^2$ steps, i.e. are vacant. Most of the results are obtained from numerical…
We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th…
We study the asymptotic behavior of the long cycles of a random permutation of $n$ objects with respect to multiplicative measures with polynomial growing cycle weights. We show that the longest cycle and the length differences between the…
We introduce a method to estimate continuum percolation thresholds and illustrate its usefulness by investigating geometric percolation of non-interacting line segments and disks in two spatial dimensions. These examples serve as models for…
In $r$-neighbour bootstrap percolation, vertices (sites) of a graph $G$ are infected, round-by-round, if they have $r$ neighbours already infected. Once infected, they remain infected. An initial set of infected sites is said to percolate…
We report extensive molecular-dynamics simulation results for binary mixtures of hard spheres for different size disparities and different mixing percentages,for packing fractions up to 0.605 and over a characteristic time interval spanning…
We consider first-passage percolation on a ladder, i.e. the graph {0,1,...}*{0,1} where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean 1. We find an appropriate Markov chain to calculate an…
We show that the classical Pollard rho algorithm for discrete logarithms produces a collision in expected time O(sqrt(n)(log n)^3). This is the first nontrivial rigorous estimate for the collision probability for the unaltered Pollard rho…
According to a result of Arkin~\etal~(2016), given $n$ point pairs in the plane, there exists a simple polygonal cycle that separates the two points in each pair to different sides; moreover, a $O(\sqrt{n})$-factor approximation with…
We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations of the solid-on-solid model of statistical physics. This model has been proposed, among other things, as an idealization of the behavior of…
We investigate the motion of two overlapping polymers with self-avoidance confined in a narrow 2d box. A statistical model is constructed using blob free-energy arguments. We find spontaneous segregation under the condition: $L > R_{//}$,…
We study independent long-range percolation on $\mathbb{Z}^d$ where the nearest-neighbor edges are always open and the probability that two vertices $x,y$ with $\|x-y\|>1$ are connected by an edge is proportional to…
We report site percolation thresholds for square lattice with neighbor interactions at various increasing ranges. Using Monte Carlo techniques we found that nearest neighbors (N$^2$), next nearest neighbors (N$^3$), next next nearest…
A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…
We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…
For any stationary $\mZ^d$-Gibbs measure that satisfies strong spatial mixing, we obtain sequences of upper and lower approximations that converge to its entropy. In the case, $d=2$, these approximations are efficient in the sense that the…
Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…
Binary mixtures of hard-spheres with different diameters and square-well attraction between different particles are studied by theory and Monte Carlo simulations. In our mesoscopic theory, local fluctuations of the volume fraction of the…
Lubrication expressions for the friction coefficients of a spherical particle moving in a fluid between and along two parallel solid walls are explicitly evaluated in the low-Reynolds-number regime. They are used to determine lubrication…