中文
相关论文

相关论文: On increasing subsequences of iid samples

200 篇论文

We study the last passage time in geometric last passage percolation (LPP). As the system size increases, we derive precise large deviation probabilities -- up to and including the constant terms -- for both the lower and upper tails. A key…

概率论 · 数学 2025-10-21 Sung-Soo Byun , Christophe Charlier , Philippe Moreillon , Nick Simm

We investigate large deviations for the empirical measure of the position and momentum of a particle traveling in a box with hot walls. The particle travels with uniform speed from left to right, until it hits the right boundary. Then it is…

概率论 · 数学 2011-03-16 Raphael Lefevere , Mauro Mariani , Lorenzo Zambotti

We find a two term asymptotic expansion for the optimal expected value of a sequentially selected monotone subsequence from a random permutation of length n. A striking feature of this expansion is that tells us that the expected value of…

概率论 · 数学 2015-09-16 Peichao Peng , J. Michael Steele

This paper is continuation of the systematic study of distribution of quadrant marked mesh patterns. We study quadrant marked mesh patterns on up-down and down-up permutations, also known as alternating and reverse alternating permutations,…

组合数学 · 数学 2012-05-04 Sergey Kitaev , Jeffrey Remmel

This paper presents a new, short proof of the computation of the upper tail large deviation rate function for the Brownian directed percolation model. Through a distributional equivalence between the last passage time in this model and the…

概率论 · 数学 2019-07-08 Christopher Janjigian

This paper is part of the ongoing effort to study high-dimensional permutations. We prove the analogue to the Erd\H{o}s-Szekeres theorem: For every $k\ge1$, every order-$n$ $k$-dimensional permutation contains a monotone subsequence of…

组合数学 · 数学 2017-10-24 Nathan Linial , Michael Simkin

This survey of alternating permutations and Euler numbers includes refinements of Euler numbers, other occurrences of Euler numbers, longest alternating subsequences, umbral enumeration of classes of alternating permutations, and the…

组合数学 · 数学 2009-12-22 Richard P. Stanley

The longest increasing subsequence (LIS) of a sequence of correlated random variables is a basic quantity with potential applications that has started to receive proper attention only recently. Here we investigate the behavior of the length…

统计力学 · 物理学 2020-08-11 J. Ricardo G. Mendonça

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…

统计力学 · 物理学 2026-05-29 J. Ricardo G. Mendonça

We consider the distribution of cycles in two models of random permutations, that are related to one another. In the first model, cycles receive a weight that depends on their length. The second model deals with permutations of points in…

概率论 · 数学 2011-02-24 Volker Betz , Daniel Ueltschi

In this paper we revisit the problem of decomposing a signal into a tendency and a residual. The tendency describes an executive summary of a signal that encapsulates its notable characteristics while disregarding seemingly random, less…

信号处理 · 电气工程与系统科学 2024-01-10 Caio Alves , Juan M. Restrepo , Jorge M. Ramirez

We provide Monte Carlo estimates of the scaling of the length $L_{n}$ of the longest increasing subsequences of $n$-steps random walks for several different distributions of step lengths, short and heavy-tailed. Our simulations indicate…

统计力学 · 物理学 2017-01-19 J. Ricardo G. Mendonça

We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…

统计力学 · 物理学 2009-11-11 Tonguc Rador

Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…

组合数学 · 数学 2007-05-23 Nicholas Pippenger

This paper investigates the decay rate of the probability that the row sum of a triangular array of truncated heavy tailed random variables is larger than an integer (k) times the truncating threshold, as both - the number of summands and…

概率论 · 数学 2017-03-21 Arijit Chakrabarty

We determine the average number of distinct subsequences in a random binary string, and derive an estimate for the average number of distinct subsequences of a particular length.

组合数学 · 数学 2013-10-29 Michael J. Collins

Consider the partition function of a directed polymer in an IID field. We assume that both tails of the negative and the positive part of the field are at least as light as exponential. It is a well-known fact that the free energy of the…

概率论 · 数学 2012-10-04 Iddo Ben-Ari

We investigate the relaxation of long-tailed distributions under stochastic dynamics that do not support such tails. Linear relaxation is found to be a borderline case in which long tails are exponentially suppressed in time but not…

统计力学 · 物理学 2015-06-22 Christian Van den Broeck , Upendra Harbola , Raul Toral , Katja Lindenberg

The purpose of [1] was as follows. ?We consider special sets of continuants which occur in applications. For these sets we solve the problem of finding maximal and minimal continuants. There are several methods for finding extremum such as…

数论 · 数学 2021-06-08 I. D. Kan

We establish a link between the phenomenon of Taylor dispersion and the theory of empirical distributions. Using this connection, we derive, upon applying the theory of large deviations, an alternative and much more precise description of…

统计力学 · 物理学 2017-02-01 Marcel Kahlen , Andreas Engel , Christian Van den Broeck