English
Related papers

Related papers: On laws exhibiting universal ordering under stocha…

200 papers

Restart -- interrupting a stochastic process followed by a new start -- is known to improve the mean time to its completion, and the general conditions under which such an improvement is achieved are now well understood. Here, we explore…

Statistical Mechanics · Physics 2020-03-11 Sergey Belan

We study a stochastic particle system which models the time evolution of the ranking of books by online bookstores (e.g., Amazon). In this system, particles are lined in a queue. Each particle jumps at random jump times to the top of the…

Probability · Mathematics 2009-08-22 Kumiko Hattori , Tetsuya Hattori

Resetting a stochastic process has been shown to expedite the completion time of some complex tasks, such as finding a target for the first time. Here we consider the cost of resetting by associating to each reset a cost, which is a…

Statistical Mechanics · Physics 2024-02-13 John C. Sunil , Richard A. Blythe , Martin R. Evans , Satya N. Majumdar

We prove a law of large numbers in terms of complete convergence of independent random variables taking values in increments of monotone functions, with convergence uniform both in the initial and the final time. The result holds also for…

Probability · Mathematics 2016-12-30 Tetsuya Hattori

The problem of reconstructing a sequence of independent and identically distributed symbols from a set of equal size, consecutive, fragments, as well as a dependent reference sequence, is considered. First, in the regime in which the…

Information Theory · Computer Science 2023-07-20 Nir Weinberger , Ilan Shomorony

The stochastic processes of finite length defined by recurrence relations request additional relations specifying the first terms of the process analogously to the initial conditions for the differential equations. As a general rule, in…

Data Analysis, Statistics and Probability · Physics 2015-10-05 Calin Vamos , Stefan M. Soltuz , Maria Craciun

In this contribution we consider stochastic growth models in the Kardar-Parisi-Zhang universality class in 1+1 dimension. We discuss the large time distribution and processes and their dependence on the class on initial condition. This…

Mathematical Physics · Physics 2011-03-01 Patrik L. Ferrari

Permanents of random matrices with independent and identically distributed (i.i.d.) entries have extensively studied in literature and convergence and concentration properties are known under varying assumptions on the distributions. In…

Probability · Mathematics 2021-12-13 Ghurumuruhan Ganesan

In order to bring contraction analysis into the very fruitful and topical fields of stochastic and Bayesian systems, we extend here the theory describes in \cite{Lohmiller98} to random differential equations. We propose new definitions of…

Optimization and Control · Mathematics 2013-09-27 Nicolas Tabareau , Jean-Jacques Slotine

We consider a random walker on a ring, subjected to resetting at Poisson-distributed times to the initial position (the walker takes the shortest path along the ring to the initial position at resetting times). In the case of a Brownian…

Statistical Mechanics · Physics 2022-03-30 Pascal Grange

The infinite random size-biased order with arbitrary positive size parameters is introduced in terms of independent exponential random variables. We collect basic properties and constructions of the order, some of which belong to the…

Probability · Mathematics 2023-09-28 Alexander Gnedin

This paper analyzes a variation on the well-known "power of two choices" allocation algorithms. Classically, the smallest of $d$ randomly-chosen options is selected. We investigate what happens when the largest of $d$ randomly-chosen…

Data Structures and Algorithms · Computer Science 2026-03-23 Amanda Redlich

Stochastic dominance is a crucial tool for the analysis of choice under risk. It is typically analyzed as a property of two gambles that are taken in isolation. We study how additional independent sources of risk (e.g. uninsurable labor…

Probability · Mathematics 2020-05-14 Luciano Pomatto , Philipp Strack , Omer Tamuz

Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any…

Discrete Mathematics · Computer Science 2012-01-05 Mathilde Bouvel , Cedric Chauve , Marni Mishna , Dominique Rossin

We consider the dynamics of a 1D system evolving according to a deterministic drift and randomly forced by two types of jumps processes, one representing an external, uncontrolled forcing and the other one a control that instantaneously…

Statistical Mechanics · Physics 2019-10-30 Mark S. Bartlett Amilcare Porporato Lamberto Rondoni

The rounding of first order phase transitions by quenched randomness is stated in a form which is applicable to both classical and quantum systems: The free energy, as well as the ground state energy, of a spin system on a $d$-dimensional…

Statistical Mechanics · Physics 2015-05-14 Rafael L Greenblatt , Michael Aizenman , Joel L. Lebowitz

Stochastic resetting, a diffusive process whose amplitude is "reset" to the origin at random times, is a vividly studied strategy to optimize encounter dynamics, e.g., in chemical reactions. We here generalize the resetting step by…

Statistical Mechanics · Physics 2021-05-26 M. Dahlenburg , A. V. Chechkin , R. Schumer , R. Metzler

We investigate random searches under stochastic position resetting at rate $r$, in a bounded 1D environment with space-dependent diffusivity $D(x)$. For arbitrary shapes of $D(x)$ and prescriptions of the associated multiplicative…

Statistical Mechanics · Physics 2025-01-09 Luiz Menon , Celia Anteneodo

We consider the stochastic ranking process with space-time dependent unbounded jump rates for the particles. We prove that the joint empirical distribution of jump rate and scaled position converges almost surely to a deterministic…

Probability · Mathematics 2017-01-02 Tetsuya Hattori

A real number \alpha is called recursively enumerable if there exists a computable, increasing sequence of rational numbers which converges to \alpha. The randomness of a recursively enumerable real \alpha can be characterized in various…

Information Theory · Computer Science 2008-05-20 Kohtaro Tadaki
‹ Prev 1 4 5 6 7 8 10 Next ›