English
Related papers

Related papers: Greedy Polyominoes and first-passage times on rand…

200 papers

$ \def\vecc#1{\boldsymbol{#1}} $We design a polynomial time algorithm that for any weighted undirected graph $G = (V, E,\vecc w)$ and sufficiently large $\delta > 1$, partitions $V$ into subsets $V_1, \ldots, V_h$ for some $h\geq 1$, such…

Data Structures and Algorithms · Computer Science 2017-11-20 Vedat Levi Alev , Nima Anari , Lap Chi Lau , Shayan Oveis Gharan

In the moduli space of polynomials of degree 3 with marked critical points c_1 and c_2, let C_{1,n} be the locus of maps for which c_1 has period n and let C_{2,m} be the locus of maps for which c_2 has period m. A consequence of Thurston's…

Dynamical Systems · Mathematics 2012-11-14 Joseph H. Silverman

Probabilistic circuits (PCs) enable exact and tractable inference but employ data independent mixture weights that limit their ability to capture local geometry of the data manifold. We propose Voronoi tessellations (VT) as a natural way to…

Machine Learning · Computer Science 2026-03-13 Sahil Sidheekh , Sriraam Natarajan

We consider the exactly solvable model of exponential directed last passage percolation on $\mathbb{Z}^2$ in the large deviation regime. Conditional on the upper tail large deviation event $\mathcal{U}_{\delta}:=\{T_{n}\geq (4+\delta)n\}$…

Probability · Mathematics 2019-02-26 Riddhipratim Basu , Shirshendu Ganguly

Let $F$ be a totally real field in which $p$ is unramified. Let $\overline{r}: G_F \rightarrow \mathrm{GL}_2(\overline{\mathbb{F}}_p)$ be a modular Galois representation which satisfies the Taylor-Wiles hypotheses and is generic at a place…

Number Theory · Mathematics 2019-10-16 Daniel Le

First-passage percolation is a random growth model defined using i.i.d. edge-weights $(t_e)$ on the nearest-neighbor edges of $\mathbb{Z}^d$. An initial infection occupies the origin and spreads along the edges, taking time $t_e$ to cross…

Probability · Mathematics 2017-09-28 Michael Damron , Jack Hanson , Wai-Kit Lam

In this paper, we study fractional multiflows in undirected graphs. A fractional multiflow in a graph G with a node subset T, called terminals, is a collection of weighted paths with ends in T such that the total weights of paths traversing…

Discrete Mathematics · Computer Science 2011-06-03 N. Vanetik

Panagiotou and Stufler recently proved an important fact on their way to establish the scaling limits of random P\'olya trees: a uniform random P\'olya tree of size $n$ consists of a conditioned critical Galton-Watson tree $C_n$ and many…

Combinatorics · Mathematics 2019-11-25 Bernhard Gittenberger , Emma Yu Jin , Michael Wallner

In the paper we investigate statistical and topological properties of fractional Brownian polymer chains, equipped with the short-range volume interactions. The attention is paid to statistical properties of collapsed conformations with the…

Soft Condensed Matter · Physics 2021-06-09 A. M. Astakhov , V. A. Avetisov , S. K. Nechaev , K. E. Polovnikov

The forward and reverse Funk weak metrics are fundamental distance functions on convex bodies that serve as the building blocks for the Hilbert and Thompson metrics. In this paper we study Voronoi diagrams under the forward and reverse Funk…

Computational Geometry · Computer Science 2026-02-24 Aditya Acharya , Auguste Henry Gezalyan , David M. Mount , Danesh Sivakumar

Given a countable set of points in a continuous space, Voronoi tessellation is an intuitive way of partitioning the space according to the distance to the individual points. As a powerful approach to obtain structural information, it has a…

Soft Condensed Matter · Physics 2020-02-17 Simeon Völkel , Kai Huang

Greedy algorithms have long been a workhorse for learning graphical models, and more broadly for learning statistical models with sparse structure. In the context of learning directed acyclic graphs, greedy algorithms are popular despite…

Machine Learning · Computer Science 2021-11-01 Goutham Rajendran , Bohdan Kivva , Ming Gao , Bryon Aragam

We prove that random walks on a family of tilings of d-dimensional Euclidean space, with a canonical choice of conductances, converge to Brownian motion modulo time parameterization. This class of tilings includes Delaunay triangulations…

Probability · Mathematics 2025-08-29 Ahmed Bou-Rabee , Ewain Gwynne

We introduce weighted Markovian graphs, a random walk model that decouples the transition dynamics of a Markov chain from (random) edge weights representing the cost of traversing each edge. This decoupling allows us to study the…

Optimization and Control · Mathematics 2026-03-30 Thao Le , Robbert van der Burg , Bernd Heidergott , Ines Lindner , Alessandro Zocca

One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the classical iid transmission time $L_{xy}$ is…

Probability · Mathematics 2024-03-26 Júlia Komjáthy , John Lapinskas , Johannes Lengler , Ulysse Schaller

A tromino tiling problem is a packing puzzle where we are given a region of connected lattice squares and we want to decide whether there exists a tiling of the region using trominoes with the shape of an L. In this work we study a slight…

Data Structures and Algorithms · Computer Science 2021-03-16 Javier T. Akagi , Eduardo A. Canale , Marcos Villagra

The Voronoi Diagram is a geometrical structure that is widely used in scientific or technological applications where proximity is a relevant aspect to consider, and it also resembles natural phenomena such as cellular banks, rock formations…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-02 Rodrigo Stevenson , Cristóbal A. Navarro

Consider a homogeneous Poisson point process of the Euclidean plane and its Voronoi tessellation. The present note discusses the properties of two stationary point processes associated with the latter and depending on a parameter $\theta$.…

Probability · Mathematics 2020-11-02 François Baccelli , Sanket S. Kalamkar

We introduce a new first passage percolation model in a Poissonian environment on $\mathbb{R}^{2}$. In this model, the action of a path depends on the geometry of the path and the travel time. We prove that the transversal fluctuation…

Probability · Mathematics 2016-05-20 Yuri Bakhtin , Wei Wu

We prove that the standard Russo-Seymour-Welsh theory is valid for Voronoi percolation. This implies that at criticality the crossing probabilities for rectangles are bounded by constants depending only on their aspect ratio. This result…

Probability · Mathematics 2015-07-31 Vincent Tassion