相关论文: On laws exhibiting universal ordering under stocha…

We study the problem of assigning indivisible objects to agents where each is to receive at most one. To ensure fairness in the absence of monetary compensation, we consider random assignments. Random Priority, also known as Random Serial…

Biological systems perform complex multi-step processes in a reproducible way despite underlying stochasticity. The standard explanation is micromanagement by molecular machinery that recognizes and corrects specific errors. Here we study…

For obtaining optimal first-order convergence guarantee for stochastic optimization, it is necessary to use a recurrent data sampling algorithm that samples every data point with sufficient frequency. Most commonly used data sampling…

By periodically returning a search process to a known or random state, random resetting possesses the potential to unveil new trajectories, sidestep potential obstacles, and consequently enhance the efficiency of locating desired targets.…

Both for the theoretical and practical treatment of Inverse Problems, the modeling of the noise is a crucial part. One either models the measurement via a deterministic worst-case error assumption or assumes a certain stochastic behavior of…

We study a class of ordinary differential equations with a non-Lipschitz point singularity, which admit non-unique solutions through this point. As a selection criterion, we introduce stochastic regularizations depending on the parameter…

The irreversibility in a statistical system is traced to its probabilistic evolution, and the molecular chaos assumption is not its unique consequence as is commonly believed. Under the assumption that the rate of change of the each…

We study non-terminating graph rewriting models, whose local rules are applied non-deterministically -- and yet enjoy a strong form of determinism, namely space-time determinism. Of course in the case of terminating computation it is…

We consider a random two-phase process which we call a reset-return one. The particle starts its motion at the origin. The first, displacement, phase corresponds to a stochastic motion of a particle and is finished at a resetting event. The…

When applied to a stochastic process of interest, a restart protocol alters the overall statistical distribution of the process' completion time; thus, the completion-time's mean and randomness change. The explicit effect of restart on the…

Time evolution in several classes of quantum devices is generated through the application of quantum gates. Resetting is a critical technological feature in these systems allowing for mid-circuit measurement and complete or partial qubit…

Reversal of the time direction in stochastic systems driven by white noise has been central throughout the development of stochastic realization theory, filtering and smoothing. Similar ideas were developed in connection with certain…

We consider a stochastic process undergoing resetting after which a random refractory period is imposed. In this period the process is quiescent and remains at the resetting position. Using a first-renewal approach, we compute exactly the…

First passage under restart with branching is proposed as a generalization of first passage under restart. Strong motivation to study this generalization comes from the observation that restart with branching can expedite the completion of…

We revisit the selection problem, namely that of computing the $i$th order statistic of $n$ given elements, in particular the classic deterministic algorithm by grouping and partition due to Blum, Floyd, Pratt, Rivest, and Tarjan (1973).…

We discuss a new stochastic ordering for the sequence of independent random variables. It generalizes the stochastic precedence order that is defined for two random variables to the case $n>2$. All conventional stochastic orders are…

Resetting or restart, when applied to a stochastic process, usually brings its dynamics to a time-independent stationary state. In turn, the optimal resetting rate makes the mean time to reach a target to be the shortest one. These and…

Critical states are sometimes identified experimentally through power-law statistics or universal scaling functions. We show here that such features naturally emerge from networks in self-sustained irregular regimes away from criticality.…

Proper management of resources whose arrival and consumption are subject to environmental randomness is an intrinsic process in both natural and artificial systems. This phenomenon can be modeled as a queuing process whose arrival…

Bounded-size rules are dynamic random graph processes which incorporate limited choice along with randomness in the evolution of the system. One starts with the empty graph and at each stage two edges are chosen uniformly at random. One of…