arXiv subjects

Yuval Peres

Publications and source records attributed to Yuval Peres.

At least 181 records · Page 10Linked to original sources

arXiv2012

The Isolation Time of Poisson Brownian Motions

Let the nodes of a Poisson point process move independently in $\R^d$ according to Brownian motions. We study the isolation time for a target particle that is placed at the origin, namely how long it takes until there is no node of the Poisson point process within distance $r$ of it. In the case when the target particle does not move, we obtain asymptotics for the tail {probability} which are tight up to constants in the exponent in dimension $d\geq 3$ and tight up to logarithmic factors in the exponent for dimensions $d=1,2$. In the case when the target particle is allowed to move independently of the Poisson point process, we show that the best strategy for the target to avoid isolation is to stay put.

math.PR↗

arXiv2012

Anatomy of the giant component: The strictly supercritical regime

In a recent work of the authors and Kim, we derived a complete description of the largest component of the Erdős-Rényi random graph $G(n,p)$ as it emerges from the critical window, i.e. for $p = (1+ε)/n$ where $ε^3 n \to\infty$ and $ε=o(1)$, in terms of a tractable contiguous model. Here we provide the analogous description for the supercritical giant component, i.e., the largest component of $G(n,p)$ for $p = λ/n$ where $λ>1$ is fixed. The contiguous model is roughly as follows: Take a random degree sequence and sample a random multigraph with these degrees to arrive at the kernel; Replace the edges by paths whose lengths are i.i.d. geometric variables to arrive at the 2-core; Attach i.i.d. Poisson Galton-Watson trees to the vertices for the final giant component. As in the case of the emerging giant, we obtain this result via a sequence of contiguity arguments at the heart of which are Kim's Poisson-cloning method and the Pittel-Wormald local limit theorems.

math.CO↗

arXiv2011

Can extra updates delay mixing?

We consider Glauber dynamics (starting from an extremal configuration) in a monotone spin system, and show that interjecting extra updates cannot increase the expected Hamming distance or the total variation distance to the stationary distribution. We deduce that for monotone Markov random fields, when block dynamics contracts a Hamming metric, single-site dynamics mixes in O(n log n) steps on an n-vertex graph. In particular, our result completes work of Kenyon, Mossel and Peres concerning Glauber dynamics for the Ising model on trees. Our approach also shows that on bipartite graphs, alternating updates systematically between odd and even vertices cannot improve the mixing time by more than a factor of log n compared to updates at uniform random locations on an n-vertex graph. Our result is especially effective in comparing block and single-site dynamics; it has already been used in works of Martinelli, Sinclair, Mossel, Sly, Ding, Lubetzky, and Peres in various combinations.

math.PR↗

arXiv2011

Cover times, blanket times, and majorizing measures

We exhibit a strong connection between cover times of graphs, Gaussian processes, and Talagrand's theory of majorizing measures. In particular, we show that the cover time of any graph $G$ is equivalent, up to universal constants, to the square of the expected maximum of the Gaussian free field on $G$, scaled by the number of edges in $G$. This allows us to resolve a number of open questions. We give a deterministic polynomial-time algorithm that computes the cover time to within an O(1) factor for any graph, answering a question of Aldous and Fill (1994). We also positively resolve the blanket time conjectures of Winkler and Zuckerman (1996), showing that for any graph, the blanket and cover times are within an O(1) factor. The best previous approximation factor for both these problems was $O((\log \log n)^2)$ for $n$-vertex graphs, due to Kahn, Kim, Lovasz, and Vu (2000).

math.PR↗

arXiv2011

Tug-of-war and infinity Laplace equation with vanishing Neumann boundary condition

We study a version of the stochastic "tug-of-war" game, played on graphs and smooth domains, with the empty set of terminal states. We prove that, when the running payoff function is shifted by an appropriate constant, the values of the game after n steps converge in the continuous case and the case of finite graphs with loops. Using this we prove the existence of solutions to the infinity Laplace equation with vanishing Neumann boundary condition.

math.AP↗

arXiv2011

Isolated zeros for Brownian motion with variable drift

It is well known that standard one-dimensional Brownian motion B(t) has no isolated zeros almost surely. We show that for any alpha<1/2 there are alpha-Hölder continuous functions f for which the process B-f has isolated zeros with positive probability. We also prove that for any continuous function f, the zero set of B-f has Hausdorff dimension at least 1/2 with positive probability, and 1/2 is an upper bound if f is 1/2-Hölder continuous or of bounded variation.

math.PR↗

arXiv2011

Local central limit theorems in stochastic geometry

We give a general local central limit theorem for the sum of two independent random variables, one of which satisfies a central limit theorem while the other satisfies a local central limit theorem with the same order variance. We apply this result to various quantities arising in stochastic geometry, including: size of the largest component for percolation on a box; number of components, number of edges, or number of isolated points, for random geometric graphs; covered volume for germ-grain coverage models; number of accepted points for finite-input random sequential adsorption; sum of nearest-neighbour distances for a random sample from a continuous multidimensional distribution.

math.PR↗

arXiv2011

Hausdorff dimension for fractals invariant under the multiplicative integers

We consider subsets of the (symbolic) sequence space that are invariant under the action of the semigroup of multiplicative integers. A representative example is the collection of all 0-1 sequences $(x_k)$ such that $x_k x_{2k}=0$ for all $k$. We compute the Hausdorff and Minkowski dimensions of these sets and show that they are typically different. The proof proceeds via a variational principle for multiplicative subshifts.

math.DS↗

arXiv2011

A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics

The Swendsen-Wang dynamics is a Markov chain widely used by physicists to sample from the Boltzmann-Gibbs distribution of the Ising model. Cooper, Dyer, Frieze and Rue proved that on the complete graph K_n the mixing time of the chain is at most O(n^{1/2}) for all non-critical temperatures. In this paper we show that the mixing time is Theta(1) in high temperatures, Theta(log n) in low temperatures and Theta(n^{1/4}) at criticality. We also provide an upper bound of O(log n) for Swendsen-Wang dynamics for the q-state ferromagnetic Potts model on any tree with n vertices.

math.PR↗

arXiv2011

Mixing of the upper triangular matrix walk

We study a natural random walk over the upper triangular matrices, with entries in the field $\Z_2$, generated by steps which add row $i+1$ to row $i$. We show that the mixing time of the lazy random walk is $O(n^2)$ which is optimal up to constants. Our proof makes key use of the linear structure of the group and extends to walks on the upper triangular matrices over the fields $\Z_q$ for $q$ prime.

math.PR↗

arXiv2011

Hausdorff dimension of the multiplicative golden mean shift

We compute the Hausdorff dimension of the "multiplicative golden mean shift" defined as the set of all reals in $[0,1]$ whose binary expansion $(x_k)$ satisfies $x_k x_{2k}=0$ for all $k\ge 1$, and show that it is smaller than the Minkowski dimension.

math.DS↗

arXiv2011

All-Pairs Shortest Paths in $O(n^2)$ time with high probability

We present an all-pairs shortest path algorithm whose running time on a complete directed graph on $n$ vertices whose edge weights are chosen independently and uniformly at random from $[0,1]$ is $O(n^2)$, in expectation and with high probability. This resolves a long standing open problem. The algorithm is a variant of the dynamic all-pairs shortest paths algorithm of Demetrescu and Italiano. The analysis relies on a proof that the number of \emph{locally shortest paths} in such randomly weighted graphs is $O(n^2)$, in expectation and with high probability. We also present a dynamic version of the algorithm that recomputes all shortest paths after a random edge update in $O(\log^{2}n)$ expected time.

math.CO↗

arXiv2011

Stable Poisson Graphs in One Dimension

Let each point of a homogeneous Poisson process on $\RR$ independently be equipped with a random number of stubs (half-edges) according to a given probability distribution $μ$ on the positive integers. We consider schemes based on Gale-Shapley stable marriage for perfectly matching the stubs to obtain a simple graph with degree distribution $μ$. We prove results on the existence of an infinite component and on the length of the edges, with focus on the case $μ(\{2\})=1$. In this case, for the random direction stable matching scheme introduced by Deijfen and Meester we prove that there is no infinite component, while for the stable matching of Deijfen, Häggström and Holroyd we prove that existence of an infinite component follows from a certain statement involving a {\em finite} interval, which is overwhelmingly supported by simulation evidence.

math.PR↗

arXiv2011

An isoperimetric inequality for the Wiener sausage

Let $(ξ(s))_{s\geq 0}$ be a standard Brownian motion in $d\geq 1$ dimensions and let $(D_s)_{s \geq 0}$ be a collection of open sets in $\R^d$. For each $s$, let $B_s$ be a ball centered at 0 with $\vol(B_s) = \vol(D_s)$. We show that $\E[\vol(\cup_{s \leq t}(ξ(s) + D_s))] \geq \E[\vol(\cup_{s \leq t}(ξ(s) + B_s))]$, for all $t$. In particular, this implies that the expected volume of the Wiener sausage increases when a drift is added to the Brownian motion.

math.PR↗

arXiv2011

Random laminations and multitype branching processes

We consider multitype branching processes arising in the study of random laminations of the disk. We classify these processes according to their subcritical or supercritical behavior and provide Kolmogorov-type estimates in the critical case corresponding to the random recursive lamination process of [1]. The proofs use the infinite dimensional Perron-Frobenius theory and quasi-stationary distributions.

math.PR↗

arXiv2010

Mobile Geometric Graphs: Detection, Coverage and Percolation

We consider the following dynamic Boolean model introduced by van den Berg, Meester and White (1997). At time 0, let the nodes of the graph be a Poisson point process in R^d with constant intensity and let each node move independently according to Brownian motion. At any time t, we put an edge between every pair of nodes if their distance is at most r. We study three features in this model: detection (the time until a target point---fixed or moving---is within distance r from some node of the graph), coverage (the time until all points inside a finite box are detected by the graph), and percolation (the time until a given node belongs to the infinite connected component of the graph). We obtain precise asymptotics for these features by combining ideas from stochastic geometry, coupling and multi-scale analysis.

math.PR↗

arXiv2010

Entropy Rate for Hidden Markov Chains with rare transitions

We consider Hidden Markov Chains obtained by passing a Markov Chain with rare transitions through a noisy memoryless channel. We obtain asymptotic estimates for the entropy of the resulting Hidden Markov Chain as the transition rate is reduced to zero.

cs.IT↗

arXiv2010

Brownian motion with variable drift: 0-1 laws, hitting probabilities and Hausdorff dimension

By the Cameron--Martin theorem, if a function $f$ is in the Dirichlet space $D$, then $B+f$ has the same a.s. properties as standard Brownian motion, $B$. In this paper we examine properties of $B+f$ when $f \notin D$. We start by establishing a general 0-1 law, which in particular implies that for any fixed $f$, the Hausdorff dimension of the image and the graph of $B+f$ are constants a.s. (This 0-1 law applies to any Lévy process.) Then we show that if the function $f$ is Hölder$(1/2)$, then $B+f$ is intersection equivalent to $B$. Moreover, $B+f$ has double points a.s. in dimensions $d\le 3$, while in $d\ge 4$ it does not. We also give examples of functions which are Hölder with exponent less than $1/2$, that yield double points in dimensions greater than 4. Finally, we show that for $d \ge 2$, the Hausdorff dimension of the image of $B+f$ is a.s. at least the maximum of 2 and the dimension of the image of $f$.

math.PR↗