arXiv subjects

Omer Angel

Publications and source records attributed to Omer Angel.

At least 73 records · Page 4Linked to original sources

arXiv2012

The TASEP speed process

In the multi-type totally asymmetric simple exclusion process (TASEP) on the line, each site of Z is occupied by a particle labeled with some number, and two neighboring particles are interchanged at rate one if their labels are in increasing order. Consider the process with the initial configuration where each particle is labeled by its position. It is known that in this case a.s. each particle has an asymptotic speed which is distributed uniformly on [-1,1]. We study the joint distribution of these speeds: the TASEP speed process. We prove that the TASEP speed process is stationary with respect to the multi-type TASEP dynamics. Consequently, every ergodic stationary measure is given as a projection of the speed process measure. This generalizes previous descriptions restricted to finitely many classes. By combining this result with known stationary measures for TASEPs with finitely many types, we compute several marginals of the speed process, including the joint density of two and three consecutive speeds. One striking property of the distribution is that two speeds are equal with positive probability and for any given particle there are infinitely many others with the same speed. We also study the partially asymmetric simple exclusion process (ASEP). We prove that the states of the ASEP with the above initial configuration, seen as permutations of Z, are symmetric in distribution. This allows us to extend some of our results, including the stationarity and description of all ergodic stationary measures, also to the ASEP.

math.PR↗

arXiv2012

Random Orderings and Unique Ergodicity of Automorphism Groups

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random graph. We give similar theorems for other structures, including, for example, metric spaces. These give the first examples of uniquely ergodic groups, other than compact groups and extremely amenable groups, after Glasner and Weiss's example of the group of all permutations of the integers. We also contrast these results to those for certain special classes of graphs and metric spaces in which such random orderings can be found that are not uniform.

math.DS↗

arXiv2012

The Phase Transition for Dyadic Tilings

A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that for p sufficiently close to 1, there exists a set of pairwise disjoint available tiles whose union is the unit square, with probability tending to 1 as n->infinity, as conjectured by Joel Spencer in 1999. In particular we prove that if p=7/8, such a tiling exists with probability at least 1-(3/4)^n. The proof involves a surprisingly delicate counting argument for sets of unavailable tiles that prevent tiling.

math.PR↗

arXiv2012

Deterministic approximations of random reflectors

Within classical optics, one may add microscopic "roughness" to a macroscopically flat mirror so that parallel rays of a given angle are reflected at different outgoing angles. Taking the limit (as the roughness becomes increasingly microscopic) one obtains a flat surface that reflects randomly, i.e., the transition from incoming to outgoing ray is described by a probability kernel (whose form depends on the nature of the microscopic roughness). We consider two-dimensional optics (a.k.a. billiards) and show that every random reflector on a line that satisfies a necessary measure-preservation condition (well established in the theory of billiards) can be approximated by deterministic reflectors in this way.

math.PR↗

arXiv2012

Localization for Linearly Edge Reinforced Random Walks

We prove that the linearly edge reinforced random walk (LRRW) on any graph with bounded degrees is recurrent for sufficiently small initial weights. In contrast, we show that for non-amenable graphs the LRRW is transient for sufficiently large initial weights, thereby establishing a phase transition for the LRRW on non-amenable graphs. While we rely on the description of the LRRW as a mixture of Markov chains, the proof does not use the magic formula. We also derive analogous results for the vertex reinforced jump process.

math.PR↗

arXiv2011

Amenability of linear-activity automaton groups

We prove that every linear-activity automaton group is amenable. The proof is based on showing that a sufficiently symmetric random walk on a specially constructed degree 1 automaton group -- the mother group -- has asymptotic entropy 0. Our result answers an open question by Nekrashevich in the Kourovka notebook, and gives a partial answer to a question of Sidki.

math.GR↗

arXiv2011

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks

In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity. We consider spanning trees constrained to have depth bounded by k from a specified root. We prove that if k > log_2 log n+omega(1), where omega(1) is any function going to infinity with n, then the minimum bounded-depth spanning tree still has weight tending to zeta(3) as n -> infinity, and that if k < log_2 log n, then the weight is doubly-exponentially large in log_2 log n - k. It is NP-hard to find the minimum bounded-depth spanning tree, but when k < log_2 log n - omega(1), a simple greedy algorithm is asymptotically optimal, and when k > log_2 log n+omega(1), an algorithm which makes small changes to the minimum (unbounded depth) spanning tree is asymptotically optimal. We prove similar results for minimum bounded-depth Steiner trees, where the tree must connect a specified set of m vertices, and may or may not include other vertices. In particular, when m = const * n, if k > log_2 log n+omega(1), the minimum bounded-depth Steiner tree on the complete graph has asymptotically the same weight as the minimum Steiner tree, and if 1 <= k <= log_2 log n-omega(1), the weight tends to (1-2^{-k}) sqrt{8m/n} [sqrt{2mn}/2^k]^{1/(2^k-1)} in both expectation and probability. The same results hold for minimum bounded-diameter Steiner trees when the diameter bound is 2k; when the diameter bound is increased from 2k to 2k+1, the minimum Steiner tree weight is reduced by a factor of 2^{1/(2^k-1)}.

math.PR↗

arXiv2011

Recurrent Rotor-Router Configurations

We prove the existence of recurrent initial configurations for the rotor walk on many graphs, including Z^d, and planar graphs with locally finite embeddings. We also prove that recurrence and transience of rotor walks are invariant under changes in the starting vertex and finite changes in the initial configuration.

math.CO↗

arXiv2010

Rotor walks on general trees

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an infinite rooted tree, restarted from the root after each escape to infinity. We prove that the limiting proportion of escapes to infinity equals the escape probability for random walk, provided only finitely many rotors send the walker initially towards the root. For i.i.d. random initial rotor directions on a regular tree, the limiting proportion of escapes is either zero or the random walk escape probability, and undergoes a discontinuous phase transition between the two as the distribution is varied. In the critical case there are no escapes, but the walker's maximum distance from the root grows doubly exponentially with the number of visits to the root. We also prove that there exist trees of bounded degree for which the proportion of escapes eventually exceeds the escape probability by arbitrarily large o(1) functions. No larger discrepancy is possible, while for regular trees the discrepancy is at most logarithmic.

math.CO↗

arXiv2010

Discrete low-discrepancy sequences

Holroyd and Propp used Hall's marriage theorem to show that, given a probability distribution pi on a finite set S, there exists an infinite sequence s_1,s_2,... in S such that for all integers k >= 1 and all s in S, the number of i in [1,k] with s_i = s differs from k pi(s) by at most 1. We prove a generalization of this result using a simple explicit algorithm. A special case of this algorithm yields an extension of Holroyd and Propp's result to the case of discrete probability distributions on infinite sets.

math.CO↗

arXiv2010

Global divergence of spatial coalescents

We study several fundamental properties of a class of stochastic processes called spatial Lambda-coalescents. In these models, a number of particles perform independent random walks on some underlying graph G. In addition, particles on the same vertex merge randomly according to a given coalescing mechanism. A remarkable property of mean-field coalescent processes is that they may come down from infinity, meaning that, starting with an infinite number of particles, only a finite number remains after any positive amount of time, almost surely. We show here however that, in the spatial setting, on any infinite and bounded-degree graph, the total number of particles will always remain infinite at all times, almost surely. Moreover, if G=Z^d, and the coalescing mechanism is Kingman's coalescent, then starting with N particles at the origin, the total number of particles remaining is of order (log* N)^d at any fixed positive time (where log* is the inverse tower function). At sufficiently large times the total number of particles is of order (log* N)^{d-2}, when d>2. We provide parallel results in the recurrent case d=2. The spatial Beta-coalescents behave similarly, where log log N is replacing log* N.

math.PR↗

arXiv2009

Random Subnetworks of Random Sorting Networks

A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbor swaps. For m<=n, consider the random m-particle sorting network obtained by choosing an n-particle sorting network uniformly at random and then observing only the relative order of m particles chosen uniformly at random. We prove that the expected number of swaps in location j in the subnetwork does not depend on n, and we provide a formula for it. Our proof is probabilistic, and involves a Polya urn with non-integer numbers of balls. From the case m=4 we obtain a proof of a conjecture of Warrington. Our result is consistent with a conjectural limiting law of the subnetwork as n->infinity implied by the great circle conjecture Angel, Holroyd, Romik and Virag.

math.PR↗

arXiv2009

Deterministic Thinning of Finite Poisson Processes

Let Pi and Gamma be homogeneous Poisson point processes on a fixed set of finite volume. We prove a necessary and sufficient condition on the two intensities for the existence of a coupling of Pi and Gamma such that Gamma is a deterministic function of Pi, and all points of Gamma are points of Pi. The condition exhibits a surprising lack of monotonicity. However, in the limit of large intensities, the coupling exists if and only if the expected number of points is at least one greater in Pi than in Gamma.

math.PR↗

arXiv2009

One-dimensional long-range diffusion-limited aggregation I

We examine diffusion-limited aggregation generated by a random walk on Z with long jumps. We derive upper and lower bounds on the growth rate of the aggregate as a function of the number moments a single step of the walk has. Under various regularity conditions on the tail of the step distribution, we prove that the diameter grows as n^{beta+o(1)}, with an explicitly given beta. The growth rate of the aggregate is shown to have three phase transitions, when the walk steps have finite third moment, finite variance, and, conjecturally, finite half moment.

math.PR↗

arXiv2009

The oriented swap process

Particles labelled $1,...,n$ are initially arranged in increasing order. Subsequently, each pair of neighboring particles that is currently in increasing order swaps according to a Poisson process of rate 1. We analyze the asymptotic behavior of this process as $n\to\infty$. We prove that the space--time trajectories of individual particles converge (when suitably scaled) to a certain family of random curves with two points of non-differentiability, and that the permutation matrix at a given time converges to a certain deterministic measure with absolutely continuous and singular parts. The absorbing state (where all particles are in decreasing order) is reached at time $(2+o(1))n$. The finishing times of individual particles converge to deterministic limits, with fluctuations asymptotically governed by the Tracy--Widom distribution.

math.PR↗

arXiv2009

Sums and products along sparse graphs

In their seminal paper from 1983, Erdős and Szemerédi showed that any $n$ distinct integers induce either $n^{1+ε}$ distinct sums of pairs or that many distinct products, and conjectured a lower bound of $n^{2-o(1)}$. They further proposed a generalization of this problem, in which the sums and products are taken along the edges of a given graph $G$ on $n$ labeled vertices. They conjectured a version of the sum-product theorem for general graphs that have at least $n^{1+ε}$ edges. In this work, we consider sum-product theorems for sparse graphs, and show that this problem has important consequences already when $G$ is a matching (i.e., $n/2$ disjoint edges): Any lower bound of the form $n^{1/2+δ}$ for its sum-product over the integers implies a lower bound of $n^{1+δ}$ for the original Erdős-Szemerédi problem. In contrast, over the reals the minimal sum-product for the matching is $Θ(\sqrt{n})$, hence this approach has the potential of achieving lower bounds specialized to the integers. We proceed to give lower and upper bounds for this problem in different settings. In addition, we provide tight bounds for sums along expanders. A key element in our proofs is a reduction from the sum-product of a matching to the maximum number of translates of a set of integers into the perfect squares. This problem was originally studied by Euler, and we obtain a stronger form of Euler's result using elliptic curve analysis.

math.CO↗

arXiv2009

Stationary map coloring

We consider a planar Poisson process and its associated Voronoi map. We show that there is a proper coloring with 6 colors of the map which is a deterministic isometry-equivariant function of the Poisson process. As part of the proof we show that the 6-core of the corresponding Delaunay triangulation is empty. Generalizations, extensions and some open questions are discussed.

math.PR↗

arXiv2008

Card shuffling and diophantine approximation

The ``overlapping-cycles shuffle'' mixes a deck of $n$ cards by moving either the $n$th card or the $(n-k)$th card to the top of the deck, with probability half each. We determine the spectral gap for the location of a single card, which, as a function of $k$ and $n$, has surprising behavior. For example, suppose $k$ is the closest integer to $αn$ for a fixed real $α\in(0,1)$. Then for rational $α$ the spectral gap is $Θ(n^{-2})$, while for poorly approximable irrational numbers $α$, such as the reciprocal of the golden ratio, the spectral gap is $Θ(n^{-3/2})$.

math.PR↗