Related papers: On laws exhibiting universal ordering under stocha…
Randomized search algorithms for hard combinatorial problems exhibit a large variability of performances. We study the different types of rare events which occur in such out-of-equilibrium stochastic processes and we show how they cooperate…
Stochastic processes offer a fundamentally different paradigm of dynamics than deterministic processes, the most prominent example of the latter being Newton's laws of motion. Here, we discuss in a pedagogical manner a simple and…
Stochastic resetting, the procedure of stopping and re-initializing random processes, has recently emerged as a powerful tool for accelerating processes ranging from queuing systems to molecular simulations. However, its usefulness is…
We consider the stochastic ranking process with space-time dependent jump rates for the particles. The process is a simplified model of the time evolution of the rankings such as sales ranks at online bookstores. We prove that the joint…
We consider a free fermion chain with uniform nearest-neighbor hopping and let it evolve from an arbitrary initial state with a fixed macroscopic number of particles. We then prove that, at a sufficiently large and typical time, the…
Convex combinations of i.i.d. random variables without a finite mean can behave in a strikingly different way from the finite-mean case: as the weight vector becomes more balanced, the resulting combination may become stochastically larger,…
A large deviation analysis of the solving complexity of random 3-Satisfiability instances slightly below threshold is presented. While finding a solution for such instances demands an exponential effort with high probability, we show that…
This manuscript investigates the stochastic comparisons of the second-order statistics from dependent and heterogeneous general semi-parametric family of distributions observations. Some sufficient conditions on the usual stochastic order…
This work initiates a general study of learning and generalization without the i.i.d. assumption, starting from first principles. While the traditional approach to statistical learning theory typically relies on standard assumptions from…
The escape of the randomly accelerated undamped particle from the finite interval under action of stochastic resetting is studied. The motion of such a particle is described by the full Langevin equation and the particle is characterized by…
Size varies. Small things are typically more frequent than large things. The logarithm of frequency often declines linearly with the logarithm of size. That power law relation forms one of the common patterns of nature. Why does the…
We develop a class of averaging lemmas for stochastic kinetic equations. The velocity is multiplied by a white noise which produces a remarkable change in time scale. Compared to the deterministic case and as far as we work in $L^2$, the…
A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…
How can we monitor, in real time, whether one uncertain prospect has any upside over another? To answer this question, we develop a novel family of sequential, anytime-valid tests for stochastic dominance (SD; also known as stochastic…
The observed general time-asymmetric behavior of macroscopic systems -- embodied in the second law of thermodynamics -- arises naturally from time-symmetric microscopic laws due to the great disparity between macro and micro-scales. More…
We study the online preemptive scheduling of intervals and jobs (with restarts). Each interval or job has an arrival time, a deadline, a length and a weight. The objective is to maximize the total weight of completed intervals or jobs.…
In this overview article we will consider the deliberate restarting of algorithms, a meta technique, in order to improve the algorithm's performance, e.g., convergence rates or approximation guarantees. One of the major advantages is that…
Consider Plurality with random tie-breaking. This paper uses standard axiomatic extensions of preferences over elements to preferences over sets (Kelly, Gardenfors, Responsiveness) to characterize all better-replies of a voter under…
We study a stochastic model based on a modified fragmentation of a finite interval. The mechanism consists in cutting the interval at a random location and substituting a unique fragment on the right of the cut to regenerate and preserve…
Multiplicative random processes in (not necessaryly equilibrium or steady state) stochastic systems with many degrees of freedom lead to Boltzmann distributions when the dynamics is expressed in terms of the logarithm of the normalized…