相关论文: On laws exhibiting universal ordering under stocha…
Stochastic resetting can be naturally understood as a renewal process governing the evolution of an underlying stochastic process. In this work, we formally derive well-known results of diffusion with resets from a renewal theory…
Deterministic population growth models with power-law rates can exhibit a large variety of growth behaviors, ranging from algebraic, exponential to hyperexponential (finite time explosion). In this setup, selfsimilarity considerations play…
For two independent, almost surely finite random variables, independence of their minimum (time) and the event that one of them is either greater, equal or less than the other (cause) is completely characterized. It is shown that, other…
The effect of refractory periods in partial resetting processes is studied. Under Poissonian partial resets, a state variable jumps to a value closer to the origin by a fixed fraction at constant rate, $x\to a x$. Following each reset, a…
In the setting of non-reversible Markov chains on finite or countable state space, exact results on the distribution of the first hitting time to a given set $G$ are obtained. A new notion of "strong metastability time" is introduced to…
In several real-world networks like the Internet, WWW etc., the number of links grow in time in a non-linear fashion. We consider growing networks in which the number of outgoing links is a non-linear function of time but new links between…
Randomized methods such as PRM and RRT are widely used in motion planning. However, in some cases, their running-time suffers from inherent instability, leading to ``catastrophic'' performance even for relatively simple instances. We apply…
This thesis is divided in two parts. The first presents an overview of known results in statistical mechanics of disordered systems and its approach to random combinatorial optimization problems. The second part is a discussion of two…
The ability to uncover preferences from choices is fundamental for both positive economics and welfare analysis. Overwhelming evidence shows that choice is stochastic, which has given rise to random utility models as the dominant paradigm…
Average-case analysis computes the complexity of an algorithm averaged over all possible inputs. Compared to worst-case analysis, it is more representative of the typical behavior of an algorithm, but remains largely unexplored in…
The rates of strong convergence for various approximation schemes are investigated for a class of stochastic differential equations (SDEs) which involve a random time change given by an inverse subordinator. SDEs to be considered are unique…
We study the distribution of maxima (Extreme Value Statistics) for sequences of observables computed along orbits generated by random transformations. The underlying, deterministic, dynamical system can be regular or chaotic. In the former…
For a fixed positive integer $\;k,\;$ limit laws of linearly normalized $\;k$-th upper order statistics are well known. In this article, a comprehensive study of tail behaviours of limit laws of normalized $k$-th upper order statistics…
For a class of stochastic restart algorithms we address the effect of a nonzero level of randomization in maximizing the convergence rate for general energy landscapes. The resulting characterization of the optimal level of randomization is…
According to quantum theory, randomness is a fundamental property of the universe yet classical physics is mostly deterministic. In this article I show that it is possible for deterministic systems to arise from random ones and discuss the…
Time-constrained decision processes have been ubiquitous in many fundamental applications in physics, biology and computer science. Recently, restart strategies have gained significant attention for boosting the efficiency of…
In this work we show how the concept of majorization in continuous distributions can be employed to characterize chaotic, diffusive and quantum dynamics. The key point lies in that majorization allows to define an intuitive arrow of time,…
A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser posed as their main open…
Many real life situations require a set of items to be repeatedly placed in a random sequence. In such circumstances, it is often desirable to test whether such randomization indeed obtains, yet this problem has received very limited…
By considering three different spin models belonging to the generalized voter class for ordering dynamics in two dimensions [I. Dornic, \textit{et al.} Phys. Rev. Lett. \textbf{87}, 045701 (2001)], we show that they behave differently from…