Related papers: How fast planar maps get swallowed by a peeling pr…
We use a growth procedure for binary trees due to Luczak and Winkler, a bijection between binary trees and irreducible quadrangulations of the hexagon due to Fusy, Poulalhon and Schaeffer, and the classical angular mapping between…
We study the convex hull of the first $n$ steps of a planar random walk, and present large-$n$ asymptotic results on its perimeter length $L_n$, diameter $D_n$, and shape. In the case where the walk has a non-zero mean drift, we show that…
Starting with a finite point set $X \subset \mathbf{R}^d$, the peeling process repeatedly removes the set of the vertices of the convex hull of the current set. The number of peeling steps required to completely remove $X$ is called the…
We define radial exploration processes from $a$ to $b$ and from $b$ to $a$ in a domain $D$ of hexagons where $a$ is a boundary point and $b$ is an interior point. We prove the reversibility: the time-reversal of the process from $b$ to $a$…
Given a graph embedded in an orientable surface, a process consisting of random excitations and random node and face balancing is constructed and analyzed. It is shown that given a priori bounds g' on the genus and n' on the number of…
We consider a particle diffusing outside a compact planar set and investigate its boundary local time $\ell_t$, i.e., the rescaled number of encounters between the particle and the boundary up to time $t$. In the case of a disk, this is…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
Path decomposition is performed to analyze the pre-supremum, post-supremum, post-infimum and the intermediate processes of a spectrally negative Levy process taken up to an independent exponential time T as motivated by the aim of finding…
We study the pairwise annihilation process $A+A\to$ inert of a number of random walkers, which originally are localized in a small region in space. The size of the colony and the typical distance between particles increases with time and,…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
We use a novel unitary map toolbox -- discrete time quantum walks originally designed for quantum computing -- to implement ultrafast computer simulations of extremely slow dynamics in a nonlinear and disordered medium. Previous reports on…
We prove the unexpected result that almost uniform sampling of independent sets in graphs is possible via a probabilistic polynomial time algorithm. Note that our sampling algorithm (if correct) has extremely surprising consequences; the…
It is shown that a large class of systems of non-linear wave equations, based on the good-bad-ugly model, admit formal solutions with polyhomogeneous expansions near null infinity. A particular set of variables is introduced which allows us…
We study three basic diffusion-controlled reaction processes -- annihilation, coalescence, and aggregation. We examine the evolution starting with the most natural inhomogeneous initial configuration where a half-line is uniformly filled by…
The densest subgraph of a large graph usually refers to some subgraph with the highest average degree, which has been extended to the family of $p$-means dense subgraph objectives by~\citet{veldt2021generalized}. The $p$-mean densest…
Sampling-based motion planners have proven to be efficient solutions to a variety of high-dimensional, geometrically complex motion planning problems with applications in several domains. The traditional view of these approaches is that…
For 3D geometries, we consider stones (modeled as convex polyhedra) subject to weathering with planar slices of random orientation and depth successively removing material, ultimately yielding smooth and round (i.e. spherical) shapes. An…
When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…
A covering path for a finite set $P$ of points in the plane is a polygonal path such that every point of $P$ lies on a segment of the path. The vertices of the path need not be at points of $P$. A covering path is plane if its segments do…
In this article we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set out to define a proper distance measure…