Searcharxiv⌕ Search

arXiv subjects

Omer Angel

Publications and source records attributed to Omer Angel.

At least 55 records · Page 3Linked to original sources

Restrictions of Hölder continuous functions

For $0<α<1$ let $V(α)$ denote the supremum of the numbers $v$ such that every $α$-Hölder continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2 \leq V(α)\leq 1/(2-α)$ and asked whether the upper bound is sharp. We show that in fact $V(α)=\max\{1/2,α\}$. Let $\dim_{H}$ and $\overline{\dim}_{M}$ denote the Hausdorff and upper Minkowski dimension, respectively. The upper bound on $V(α)$ is a consequence of the following theorem. Let $\{B(t): t\in [0,1]\}$ be a fractional Brownian motion of Hurst index $α$. Then, almost surely, there exists no set $A\subset [0,1]$ such that $\overline{\dim}_{M} A>\max\{1-α,α\}$ and $B\colon A\to \mathbb{R}$ is of bounded variation. Furthermore, almost surely, there exists no set $A\subset [0,1]$ such that $\overline{\dim}_{M} A>1-α$ and $B\colon A\to \mathbb{R}$ is $β$-Hölder continuous for some $β>α$. The zero set and the set of record times of $B$ witness that the above theorems give the optimal dimensions. We also prove similar restriction theorems for deterministic self-affine functions and generic $α$-Hölder continuous functions. Finally, let $\{\mathbf{B}(t): t\in [0,1]\}$ be a two-dimensional Brownian motion. We prove that, almost surely, there is a compact set $D\subset [0,1]$ such that $\dim_{H} D\geq 1/3$ and $\mathbf{B}\colon D\to \mathbb{R}^2$ is non-decreasing in each coordinate. It remains open whether $1/3$ is best possible.

math.PR↗

Unimodular Hyperbolic Triangulations: Circle Packing and Random Walk

We show that the circle packing type of a unimodular random plane triangulation is parabolic if and only if the expected degree of the root is six, if and only if the triangulation is amenable in the sense of Aldous and Lyons. As a part of this, we obtain an alternative proof of the Benjamini-Schramm Recurrence Theorem. Secondly, in the hyperbolic case, we prove that the random walk almost surely converges to a point in the unit circle, that the law of this limiting point has full support and no atoms, and that the unit circle is a realisation of the Poisson boundary. Finally, we show that the simple random walk has positive speed in the hyperbolic metric.

math.PR↗

Increasing subsequences of random walks

Given a sequence of $n$ real numbers $\{S_i\}_{i\leq n}$, we consider the longest weakly increasing subsequence, namely $i_1<i_2<\dots <i_L$ with $S_{i_k} \leq S_{i_{k+1}}$ and $L$ maximal. When the elements $S_i$ are i.i.d. uniform random variables, Vershik and Kerov, and Logan and Shepp proved that $\mathbb{E} L=(2+o(1)) \sqrt{n}$. We consider the case when $\{S_i\}_{i\leq n}$ is a random walk on $\mathbb{R}$ with increments of mean zero and finite (positive) variance. In this case, it is well known (e.g., using record times) that the length of the longest increasing subsequence satisfies $\mathbb{E} L\geq c\sqrt{n}$. Our main result is an upper bound $\mathbb{E} L\leq n^{1/2 + o(1)}$, establishing the leading asymptotic behavior. If $\{S_i\}_{i\leq n}$ is a simple random walk on $\mathbb{Z}$, we improve the lower bound by showing that $\mathbb{E} L \geq c\sqrt{n} \log{n}$. We also show that if $\{\mathbf{S}_i\}$ is a simple random walk in $\mathbb{Z}^2$, then there is a subsequence of $\{\mathbf{S}_i\}_{i\leq n}$ of expected length at least $cn^{1/3}$ that is increasing in each coordinate. The above one-dimensional result yields an upper bound of $n^{1/2 + o(1)}$. The problem of determining the correct exponent remains open.

math.PR↗

Boundaries of planar graphs, via circle packings

We provide a geometric representation of the Poisson and Martin boundaries of a transient, bounded degree triangulation of the plane in terms of its circle packing in the unit disc. (This packing is unique up to Möbius transformations.) More precisely, we show that any bounded harmonic function on the graph is the harmonic extension of some measurable function on the boundary of the disk, and that the space of extremal positive harmonic functions, that is, the Martin boundary, is homeomorphic to the unit circle. All our results hold more generally for any "good"-embedding of planar graphs, that is, an embedding in the unit disc with straight lines such that angles are bounded away from $0$ and $π$ uniformly, and lengths of adjacent edges are comparable. Furthermore, we show that in a good embedding of a planar graph the probability that a random walk exits a disc through a sufficiently wide arc is at least a constant, and that Brownian motion on such graphs takes time of order $r^2$ to exit a disc of radius $r$. These answer a question recently posed by Chelkak (2014).

math.PR↗

Multicolour Poisson Matching

Consider several independent Poisson point processes on R^d, each with a different colour and perhaps a different intensity, and suppose we are given a set of allowed family types, each of which is a multiset of colours such as red-blue or red-red-green. We study translation-invariant schemes for partitioning the points into families of allowed types. This generalizes the 1-colour and 2-colour matching schemes studied previously (where the sets of allowed family types are the singletons {red-red} and {red-blue} respectively). We characterize when such a scheme exists, as well as the optimal tail behaviour of a typical family diameter. The latter has two different regimes that are analogous to the 1-colour and 2-colour cases, and correspond to the intensity vector lying in the interior and boundary of the existence region respectively. We also address the effect of requiring the partition to be a deterministic function (i.e. a factor) of the points. Here we find the optimal tail behaviour in dimension 1. There is a further separation into two regimes, governed by algebraic properties of the allowed family types.

math.PR↗

An isoperimetric inequality for planar triangulations

We prove a discrete analogue to a classical isoperimetric theorem of Weil for surfaces with non-positive curvature. It is shown that hexagons in the triangular lattice have maximal volume among all sets of a given boundary in any triangulation with minimal degree 6.

math.MG↗

The half plane UIPT is recurrent

We prove that the half plane version of the uniform infinite planar triangulation (UIPT) is recurrent. The key ingredients of the proof are a construction of a new full plane extension of the half plane UIPT, based on a natural decomposition of the half plane UIPT into independent layers, and an extension of previous methods for proving recurrence of weak local limits (still using circle packings).

math.PR↗

The Liouville property for groups acting on rooted trees

We show that on groups generated by bounded activity automata, every symmetric, finitely supported probability measure has the Liouville property. More generally we show this for every group of automorphisms of bounded type of a rooted tree. For automaton groups, we also give a uniform upper bound for the entropy of convolutions of every symmetric, finitely supported measure.

math.GR↗

The Hilbert Schmidt version of the commutator theorem for zero trace matrices

Let $A$ be a $m\times m$ complex matrix with zero trace. Then there are $m\times m$ matrices $B$ and $C$ such that $A=[B,C]$ and $\|B\|\|C\|_2\le (\log m+O(1))^{1/2}\|A\|_2$ where $\|D\|$ is the norm of $D$ as an operator on $\ell_2^m$ and $\|D\|_2$ is the Hilbert--Schmidt norm of $D$. Moreover, the matrix $B$ can be taken to be normal. Conversely there is a zero trace $m\times m$ matrix $A$ such that whenever $A=[B,C]$, $\|B\|\|C\|_2\ge |\log m-O(1)|^{1/2}\|A\|_2$ for some absolute constant $c>0$.

math.FA↗

Random walks on stochastic hyperbolic half planar triangulations

We study the simple random walk on stochastic hyperbolic half planar triangulations constructed in Angel and Ray [3]. We show that almost surely the walker escapes the boundary of the map in positive speed and that the return probability to the starting point after n steps scales like $\exp(-cn^{1/3})$.

math.PR↗

Classification of Half Planar Maps

We characterize all translation invariant half planar maps satisfying a certain natural domain Markov property. For p-angulations with p \ge 3 where all faces are simple, we show that these form a one-parameter family of measures H^{(p)}_{alpha}. For triangulations we also establish existence of a phase transition which affects many properties of these maps. The critical maps are the well known half plane uniform infinite planar maps. The sub-critical maps are identified as all possible limits of uniform measures on finite maps with given boundary and area.

math.PR↗

The local limit of unicellular maps in high genus

We show that the local limit of unicellular maps whose genus is proportional to the number of edges is a supercritical geometric Galton-Watson tree conditioned to survive. The proof relies on enumeration results obtained via the recent bijection given by the second author together with Feray and Fusy.

math.PR↗

A Tight Upper Bound on Acquaintance Time of Graphs

In this note we confirm a conjecture raised by Benjamini et al. \cite{BST} on the acquaintance time of graphs, proving that for all graphs $G$ with $n$ vertices it holds that $\AC(G) = O(n^{3/2})$, which is tight up to a multiplicative constant. This is done by proving that for all graphs $G$ with $n$ vertices and maximal degree $Δ$ it holds that $\AC(G) \leq 20 Δn$. Combining this with the bound $\AC(G) \leq O(n^2/Δ)$ from \cite{BST} gives the foregoing uniform upper bound of all $n$-vertex graphs. We also prove that for the $n$-vertex path $P_n$ it holds that $\AC(P_n)=n-2$. In addition we show that the barbell graph $B_n$ consisting of two cliques of sizes $\ceil{n/2}$ and $\floor{n/2}$ connected by a single edge also has $\AC(B_n) = n-2$. This shows that it is possible to add $Ω(n^2)$ edges to $P_n$ without changing the $\AC$ value of the graph.

math.CO↗

Avoidance Coupling

We examine the question of whether a collection of random walks on a graph can be coupled so that they never collide. In particular, we show that on the complete graph on n vertices, with or without loops, there is a Markovian coupling keeping apart Omega(n/log n) random walks, taking turns to move in discrete time.

math.PR↗

Scaling limit of the invasion percolation cluster on a regular tree

We prove existence of the scaling limit of the invasion percolation cluster (IPC) on a regular tree. The limit is a random real tree with a single end. The contour and height functions of the limit are described as certain diffusive stochastic processes. This convergence allows us to recover and make precise certain asymptotic results for the IPC. In particular, we relate the limit of the rescaled level sets of the IPC to the local time of the scaled height function.

math.PR↗

Percolations on random maps I: half-plane models

We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices we prove a surprisingly simple universal formula for the critical threshold for bond and face percolations on these graphs. Our techniques also permit us to compute off-critical and critical exponents related to percolation clusters such as the volume and the perimeter.

math.PR↗

A pattern theorem for random sorting networks

A sorting network is a shortest path from 12..n to n..21 in the Cayley graph of the symmetric group S(n) generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove that in a uniformly random n-element sorting network, any fixed pattern occurs in at least cn^2 disjoint space-time locations, with probability tending to 1 exponentially fast as n tends to infinity. Here c is a positive constant which depends on the choice of pattern. As a consequence, the probability that the uniformly random sorting network is geometrically realizable tends to 0.

math.PR↗