English
Related papers

Related papers: Longest increasing paths with gaps

200 papers

We derive P(M,t_m), the joint probability density of the maximum M and the time t_m at which this maximum is achieved for a class of constrained Brownian motions. In particular, we provide explicit results for excursions, meanders and…

Statistical Mechanics · Physics 2008-10-31 Satya. N. Majumdar , Julien Randon-Furling , Michael J. Kearney , Marc Yor

We study probabilistic and combinatorial aspects of natural volume-and-trace weighted plane partitions and their continuous analogues. We prove asymptotic limit laws for the largest parts of these ensembles in terms of new and known hard-…

Combinatorics · Mathematics 2020-11-17 Dan Betea , Alessandra Occelli

This paper presents a new method to generate tool paths for machining freeform surfaces represented either as parametric surfaces or as triangular meshes. This method allows for the optimal tradeoff between the preferred feed direction…

Graphics · Computer Science 2020-09-08 Qiang Zou , Charlie C. L. Wang , Hsi-Yung Feng

The Newman-Watts model is given by taking a cycle graph of n vertices and then adding each possible edge $(i,j), |i-j|\neq 1 \mod n$ with probability $\rho/n$ for some $\rho>0$ constant. In this paper we add i.i.d. exponential edge weights…

Probability · Mathematics 2016-09-26 Julia Komjathy , Viktoria Vadon

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…

Combinatorics · Mathematics 2007-06-22 Guo-Niu Han , Guoce Xin

In this paper, we study some properties of optimal paths in the first passage percolation on $\Z^d$ and show the followings: (1) the number of optimal paths has an exponential growth if the distribution has an atom; (2) the means of…

Probability · Mathematics 2021-03-31 Shuta Nakajima

In this paper, we study the maximal edge-traversal time (simply we call maximal weight hereafter) on the optimal paths in the first passage percolation for several edge distributions, including the Pareto and Weibull distributions. It is…

Probability · Mathematics 2021-02-22 Shuta Nakajima

We prove a strong law of large numbers for directed last passage times in an independent but inhomogeneous exponential environment. Rates for the exponential random variables are obtained from a discretisation of a speed function that may…

Probability · Mathematics 2018-08-03 Federico Ciech , Nicos Georgiou

We consider last-passage percolation models in two dimensions, in which the underlying weight distribution has a heavy tail of index alpha<2. We prove scaling laws and asymptotic distributions, both for the passage times and for the shape…

Probability · Mathematics 2007-05-23 Ben Hambly , James B. Martin

We numerically investigate the transport of a suspended overdamped Brownian particle which is driven through a two-dimensional rectangular array of circular obstacles with finite radius. Two limiting cases are considered in detail, namely,…

Chemical Physics · Physics 2012-01-06 P. K. Ghosh , P. Hanggi , F. Marchesoni , S. Martens , F. Nori , L. Schimansky-Geier , G. Schmid

We study linear statistics of a class of determinantal processes which interpolate between Poisson and GUE/Ginibre statistics in dimension 1 or 2. These processes are obtained by performing an independent Bernoulli percolation on the…

Probability · Mathematics 2019-07-23 Gaultier Lambert

The longest increasing subsequence (LIS) of a random walk has so far been studied mainly for zero-mean, symmetric step increments. We numerically investigate the LIS of biased Gaussian random walks, with unit-variance increments and…

Statistical Mechanics · Physics 2026-05-29 J. Ricardo G. Mendonça

We call a continuous path of polygons decreasing if the convex hulls of the polygons form a decreasing family of sets. For an arbitrary polygon of more than three vertices, we characterize the polygons contained in it that can be reached by…

Metric Geometry · Mathematics 2025-06-09 Isaac Kulp , Charlotte Ochanine , Logan Richard , Leonel Robert , Scott Whitman

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…

Probability · Mathematics 2026-05-19 Ngo P. N. Ngoc , Tuan-Minh Nguyen

Recently, many results have been established drawing a parallel between Bernoulli percolation and models given by levels of smooth Gaussian fields with unbounded, strongly decaying correlation. In a previous work with D. Gayet , we started…

Probability · Mathematics 2022-04-12 Vivek Dewan

For any graph having a suitable uniform Poincare inequality and volume growth regularity, we establish two-sided Gaussian transition density estimates and parabolic Harnack inequality, for constant speed continuous time random walks…

Probability · Mathematics 2018-12-04 Amir Dembo , Ruojun Huang , Tianyi Zheng

We explore asymptotically optimal bounds for deviations of Bernoulli convolutions from the Poisson limit in terms of the Shannon relative entropy and the Pearson $\chi^2$-distance. The results are based on proper non-uniform estimates for…

Probability · Mathematics 2019-08-13 S. G. Bobkov , G. P. Chistyakov , F. Götze

We show that, for a stationary version of Hammersley's process, with Poisson ``sources'' on the positive x-axis, and Poisson ``sinks'' on the positive y-axis, an isolated second-class particle, located at the origin at time zero, moves…

Probability · Mathematics 2007-05-23 Eric Cator , Piet Groeneboom

We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…

Probability · Mathematics 2008-05-19 Henri van den Esker , Remco van der Hofstad , Gerard Hooghiemstra

In this work we introduce the discrete-space broken line process (with discrete and continues parameter values) and derive some of its properties. We explore polygonal Markov fields techniques developed by Arak-Surgailis. The discrete…

Probability · Mathematics 2017-02-20 Leonardo T. Rolla , Vladas Sidoravicius , Donatas Surgailis , Maria E. Vares
‹ Prev 1 4 5 6 7 8 10 Next ›