English
Related papers

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

200 papers

We consider inhomogeneous Erd\H{o}s-R\'enyi graphs. We suppose that the maximal mean degree $d$ satisfies $d \ll \log n$. We characterize the asymptotic behavior of the $n^{1 - o(1)}$ largest eigenvalues of the adjacency matrix and its…

Probability · Mathematics 2017-04-11 Florent Benaych-Georges , Charles Bordenave , Antti Knowles

Kernel-based schemes are state-of-the-art techniques for learning by data. In this work we extend some ideas about kernel-based greedy algorithms to exponential-polynomial splines, whose main drawback consists in possible overfitting and…

Numerical Analysis · Mathematics 2022-10-31 Rosanna Campagna , Stefano De Marchi , Emma Perracchione , Gabriele Santin

We continue to study birational geometry of Fano fibrations $\pi\colon V\to {\mathbb P}^1$ the fibers of which are Fano double hypersurfaces of index 1. For a majority of families of this type, which do not satisfy the condition of…

Algebraic Geometry · Mathematics 2015-06-26 A. V. Pukhlikov

Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with…

We construct an edge-weight distribution for i.i.d. first-passage percolation on $\mathbb{Z}^2$ whose limit shape is not a polygon and whose extreme points are arbitrarily dense in the boundary. Consequently, the associated Richardson-type…

Probability · Mathematics 2013-03-14 Michael Damron , Michael Hochman

For d>=3, we construct a non-randomized, fair and translation-equivariant allocation of Lebesgue measure to the points of a standard Poisson point process in R^d, defined by allocating to each of the Poisson points its basin of attraction…

Probability · Mathematics 2017-03-14 Sourav Chatterjee , Ron Peled , Yuval Peres , Dan Romik

The purpose of this note is to clarify the effect of the finite size of spherical particles upon the characteristics of their spatial distribution through a random Poisson process (RPP). This information is of special interest when using…

Fluid Dynamics · Physics 2020-07-15 Markus Uhlmann

In toroidal geometry, and prior to the establishment of a fully developed turbulent state, the so-called topological instability of the pressure-gradient-driven turbulence is observed. In this intermediate state, a narrow spectral band of…

Weighted Padovan graphs $\Phi^{n}_{k}$, $n \geq 1$, $\lfloor \frac{n}{2} \rfloor \leq k \leq \lfloor \frac{2n-2}{3} \rfloor$, are introduced as the graphs whose vertices are all Padovan words of length $n$ with $k$ $1$s, two vertices being…

Combinatorics · Mathematics 2024-09-27 Vesna Iršič Chenoweth , Sandi Klavžar , Gregor Rus , Elif Tan

We consider a stationary face-to-face tessellation $X$ of $\mathbb{R}^d$ and introduce several percolation models by colouring some of the faces black in a consistent way. Our main model is cell percolation, where cells are declared black…

Probability · Mathematics 2013-12-24 Günter Last , Eva Ochsenreither

This paper investigates the \textbf{graphical $r$-Stirling numbers of the first kind}, denoted by $\str{G}{k}$, which enumerate partitions of a vertex set $V(G)$ into $k$ disjoint cycles such that $r$ specified vertices occupy distinct…

Combinatorics · Mathematics 2026-02-03 Daniel Yaqubi , Madjid Mirzavaziri

The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…

Data Structures and Algorithms · Computer Science 2017-03-07 Grzegorz Głuch , Krzysztof Loryś

We present a simple greedy procedure to compute an $(\alpha,\beta)$-spanner for a graph $G$. We then show that this procedure is useful for building fault-tolerant spanners, as well as spanners for weighted graphs. Our first main result is…

Data Structures and Algorithms · Computer Science 2026-03-19 Elizaveta Popova , Elad Tzalik

Let $G$ be a connected graph on $n$ vertices with adjacency matrix $A_G$. Associated to $G$ is a polynomial $d_G(x_1,\dots, x_n)$ of degree $n$ in $n$ variables, obtained as the determinant of the matrix $M_G(x_1,\dots,x_n)$, where…

Number Theory · Mathematics 2023-11-14 Dino Lorenzini

Financial markets provide an ideal frame for the study of crossing or first-passage time events of non-Gaussian correlated dynamics mainly because large data sets are available. Tick-by-tick data of six futures markets are herein considered…

Statistical Finance · Quantitative Finance 2011-12-23 Josep Perelló , Mario Gutiérrez-Roig , Jaume Masoliver

Voronoi tessellation, also known as Voronoi diagram, is an important computational geometry technique that has applications in various scientific disciplines. It involves dividing a given space into regions based on the proximity to a set…

Computational Geometry · Computer Science 2024-12-17 Sergei Shumilin , Alexander Ryabov , Serguei Barannikov , Evgeny Burnaev , Vladimir Vanovskii

Disordered hyperuniform many-particle systems are recently discovered exotic states of matter, characterized by a complete suppression of normalized infinite-wavelength density fluctuations and lack of conventional long-range order. Here,…

Statistical Mechanics · Physics 2024-11-12 Eli Newby , Wenlong Shi , Yang Jiao , Reka Albert , Salvatore Torquato

We enumerate a certain class of monomino-domino coverings of square grids, which conform to the \emph{tatami} restriction; no four tiles meet. Let $\mathbf T_{n}$ be the set of monomino-domino tatami coverings of the $n\times n$ grid with…

Combinatorics · Mathematics 2013-04-02 Alejandro Erickson , Frank Ruskey

We discover new Voronoi formulae for automorphic forms on GL($n$) for $n\geq 4$. There are $[n/2]$ different Voronoi formulae on GL($n$), which are Poisson summation formulae weighted by Fourier coefficients of the automorphic form with…

Number Theory · Mathematics 2017-01-31 Fan Zhou

In this paper we consider first-passage percolation on certain 1-dimensional periodic graphs, such as the $\Z\times\{0,1,\ldots,K-1\}^{d-1}$ nearest neighbour graph for $d,K\geq1$. We find that both length and weight of minimal-weight paths…

Probability · Mathematics 2015-04-28 Daniel Ahlberg