Related papers: The law of series
In the supermarket model there are n queues, each with a unit rate server. Customers arrive in a Poisson process at rate \lambda n, where 0<\lambda <1. Each customer chooses d > 2 queues uniformly at random, and joins a shortest one. It is…
We find a general formula for the distribution of time-averaged observables for systems modeled according to the sub-diffusive continuous time random walk. For Gaussian random walks coupled to a thermal bath we recover ergodicity and…
We study the rate of convergence of the Markov chain on $S_n$ which starts with a random $(n-k)$-cycle for a fixed $k \geq 1$, followed by random transpositions. The convergence to the stationary distribution turns out to be of order $n$.…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…
Nonequilibrium thermodynamics of a general second-order stochastic system is investigated. We prove that at steady state, under inversion of velocities, the condition of time-reversibility over the phase space is equivalent to the…
In this work a method for statistical analysis of time series is proposed, which is used to obtain solutions to some classical problems of mathematical statistics under the only assumption that the process generating the data is stationary…
Nonequilibrium processes break time-reversal symmetry and generate entropy. Living systems are driven out-of-equilibrium at the microscopic level of molecular motors that exploit chemical potential gradients to transduce free energy to…
We study time-reversal symmetry in dynamical systems with finite phase space, with applications to birational maps reduced over finite fields. For a polynomial automorphism with a single family of reversing symmetries, a universal (i.e.,…
We determine the full distribution and moments of the first passage time for a wide class of stochastic search processes in the limit of frequent stochastic resetting. Our results apply to any system whose short-time behavior of the search…
In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this…
This is a general description of a probabilistic formalism of mechanics, i.e., an extension of the Newtonian mechanics principles to the systems undergoing random motion. From an analysis of the induction procedure from experimental data to…
We study ergodic properties of one-dimensional Brownian motion with resetting. Using generic classes of statistics of times between resets, we find respectively for thin/fat tailed distributions, the normalized/non-normalised invariant…
We investigate quantitative recurrence in systems having an infinite measure. We extend the Ornstein-Weiss theorem for a general class of infinite systems estimating return time in decreasing sequences of cylinders. Then we restrict to a…
Random perturbations applied in tandem to an ensemble of oscillating objects can synchronize their motion. We study multiple copies of an arbitrary dynamical system in a stable limit cycle, described via a standard phase reduction picture.…
Superstatistics describes statistical systems that behave like superpositions of different inverse temperatures $\beta$, so that the probability distribution is $p(\epsilon_i) \propto \int_{0}^{\infty} f(\beta) e^{-\beta \epsilon_i}d\beta$,…
A classical particle system coupled with a thermostat driven by an external constant force reaches its steady state when the ensemble-averaged drift velocity does not vary with time. The statistical mechanics of such a system is derived…
We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…
We generalize the usual exponential Boltzmann factor to any reasonable and potentially observable distribution function, $B(E)$. By defining generalized logarithms $\Lambda$ as inverses of these distribution functions, we are led to a…
Under very general conditions the hitting time of a set by a stochastic process is a stopping time. We give a new simple proof of this fact. The section theorems for optional and predictable sets are easy corollaries of the proof.
We introduce a class of discrete random walk model driven by global memory effects. At any time the right-left transitions depend on the whole previous history of the walker, being defined by an urn-like memory mechanism. The characteristic…