相关论文: How fast planar maps get swallowed by a peeling pr…

Cover times measure the speed of exhaustive searches which require the exploration of an entire spatial region(s). Applications include the immune system hunting pathogens, animals collecting food, robotic demining or cleaning, and computer…

The minimum convex cover problem seeks to cover a polygon $P$ with the fewest convex polygons that lie within $P$. This problem is $\exists\mathbb R$-complete, and the best previously known algorithm, due to Eidenbenz and Widmayer (2001),…

The tacnode process is a universal determinantal point process arising from non-intersecting particle systems and tiling problems. It is the aim of this work to explore the integrable structure and large gap asymptotics for the gap…

The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \to c$ in probability (for some explicit $c>0$). For so-called subcritical…

The analysis of several algorithms and data structures can be framed as a peeling process on a random hypergraph: vertices with degree less than k and their adjacent edges are removed until no vertices of degree less than k are left. Often…

Suppose that a $d$-dimensional domain is filled with a gas of (in general, interacting) diffusive particles with density $n_0$. A particle is absorbed whenever it reaches the domain boundary. Employing macroscopic fluctuation theory, we…

For a broad class of planar Markov processes, viz. L\'evy processes satisfying certain conditions (valid \textit{eg} in the case of Brownian motion and L\'evy flights), we establish an exact, universal formula describing the shape of the…

Let $X_{\alpha}=\{X_{\alpha}(t),t\in T\}$, $\alpha>0$, be an $\alpha$-permanental process with kernel $u(s,t)$. We show that $X^{1/2}_{\alpha}$ is a subgaussian process with respect to the metric $\sigma (s,t)=…

We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm…

Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…

We consider an exploration algorithm where at each step, a random number of items become active while related items get explored. Given an initial number of items $N$ growing to infinity and building on a strong homogeneity assumption, we…

Be $X_t$ a random walk. We study its span $S$, i.e. the size of the domain visited up to time $t$. We want to know the probability that $S$ reaches $1$ for the first time, as well as the density of the span given $t$. Analytical results are…

We ascertain the diffusively scaled limit of a periodic Lorentz process in a strip with an almost reflecting wall at the origin. Here, almost reflecting means that the wall contains a small hole waning in time. The limiting process is a…

Detecting elliptical objects from an image is a central task in robot navigation and industrial diagnosis where the detection time is always a critical issue. Existing methods are hardly applicable to these real-time scenarios of limited…

Dewetting of ultra-thin polymer films near the glass transition exhibits unexpected front morphologies [G. Reiter, Phys. Rev. Lett., 87, 186101 (2001)]. We present here the first theoretical attempt to understand these features, focusing on…

We consider a continuous time simple random walk on a subset of the square lattice with wired boundary conditions: the walk transitions at unit edge rate on the graph obtained from the lattice closure of the subset by contracting the…

We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…

Consider "Frozen Random Walk" on $\mathbb{Z}$: $n$ particles start at the origin. At any discrete time, the leftmost and rightmost $\lfloor{\frac{n}{4}}\rfloor$ particles are "frozen" and do not move. The rest of the particles in the "bulk"…

Many models in natural language processing define probabilistic distributions over linguistic structures. We argue that (1) the quality of a model' s posterior distribution can and should be directly evaluated, as to whether probabilities…

Parallel replica dynamics is a method for accelerating the computation of processes characterized by a sequence of infrequent events. In this work, the processes are governed by the overdamped Langevin equation. Such processes spend much of…