相关论文: How fast planar maps get swallowed by a peeling pr…
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…
Given a set of $n$ labeled points in general position in the plane, we remove all of its points one by one. At each step, one point from the convex hull of the remaining set is erased. In how many ways can the process be carried out? The…
In the focus of our attention is the asymptotic properties of the sequence of convex hulls which arise as a result of a peeling procedure applied to the convex hull generated by a Poisson point process. Processes of the considered type are…
We consider random walks on $\Z^d$ among nearest-neighbor random conductances which are i.i.d., positive, bounded uniformly from above but whose support extends all the way to zero. Our focus is on the detailed properties of the paths of…
Finding dense subgraphs of a large graph is a standard problem in graph mining that has been studied extensively both for its theoretical richness and its many practical applications. In this paper we introduce a new family of dense…
Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very…
A subcycle of an Eulerian circuit is a sequence of edges that are consecutive in the circuit and form a cycle. We characterise the quartic planar graphs that admit Eulerian circuits avoiding 3-cycles and 4-cycles. From this, it follows that…
We study the geometry of infinite random Boltzmann planar maps with vertices of high degree. These correspond to the duals of the Boltzmann maps associated to a critical weight sequence $(q_{k})_{ k \geq 0}$ for the faces with polynomial…
We define a spatially-dependent fragmentation process, which involves rectangles breaking up into progressively smaller pieces at rates that depend on their shape. Long, thin rectangles are more likely to break quickly, and are also more…
The escape dynamics of sticky particles from textured surfaces is poorly understood despite importance to various scientific and technological domains. In this work, we address this challenge by investigating the escape time of adsorbates…
We consider random sequential adsorption processes where the initially empty sites of a graph are irreversibly occupied, in random order, either by monomers which block neighboring sites, or by dimers. We also consider a process where…
What is the analogue of L\'evy processes for random surfaces? Motivated by scaling limits of random planar maps in random geometry, we introduce and study L\'evy looptrees and L\'evy maps. They are defined using excursions of general L\'evy…
This paper investigates graph clustering in the planted cluster model in the presence of {\em small clusters}. Traditional results dictate that for an algorithm to provably correctly recover the clusters, {\em all} clusters must be…
We introduce kernel thinning, a new procedure for compressing a distribution $\mathbb{P}$ more effectively than i.i.d. sampling or standard thinning. Given a suitable reproducing kernel $\mathbf{k}_{\star}$ and $O(n^2)$ time, kernel…
Both completely positive and completely copositive maps stay decomposable under tensor powers, i.e under tensoring the linear map with itself. But are there other examples of maps with this property? We show that this is not the case: Any…
We connect this question to a problem of estimating the probability that the image of certain random matrices does not intersect with a subset of the unit sphere $\mathbb{S}^{n-1}$. In this way, the case of a discretized Brownian motion is…
Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…
We consider the general branching random walk under minimal assumptions, which in particular guarantee that the empirical particle distribution admits an almost sure central limit theorem. For such a process, we study the large time decay…
How long does it take a random searcher to visit all sites of a given domain? This time, known as the cover time, is a key observable to quantify the efficiency of exhaustive searches, which require a complete exploration of an area and not…
The present work describes the asymptotic local shape of a graph drawn uniformly at random from all connected simple planar graphs with n labelled vertices. We establish a novel uniform infinite planar graph (UIPG) as quenched limit in the…