Related papers: Stabilization Time for a Type of Evolution on Bina…
Using the single-spin flipping dynamics, we study the nonequilibrium evolution near the entire phase boundary of the 3D Ising model, and find that the average of relaxation time (RT) near the first-order phase transition line (1st-PTL) is…
We develop a probabilistic method for assessing the tail behavior and geometric stability of one-dimensional n i.i.d. samples by tracking how their span contracts when the most extreme points are trimmed. Central to our approach is the…
An $(n, 1)$ string is a bound state of a D-string and $n$ fundamental strings. It may be described by a D-string with a world volume electric field turned on. As the electric field approaches its critical value, $n$ becomes large. We…
The non-equilibrium steady states emerging from stochastic resetting to a distribution is studied. We show that for a range of processes, the steady-state moments can be expressed as a linear combination of the moments of the distribution…
In a seminal paper in 2013, Witt showed that the (1+1) Evolutionary Algorithm with standard bit mutation needs time $(1+o(1))n \ln n/p_1$ to find the optimum of any linear function, as long as the probability $p_1$ to flip exactly one bit…
In this paper, we study the long-time stability behavior of a class of linear stochastic evolution equations in a Hilbert space with multiplicative noise. Explicit sufficient conditions for $p$-th moment and almost sure exponential…
We consider the time evolution of a lattice branching random walk with local perturbations. Under certain conditions, we prove the Carleman type estimation for the moments of a particle subpopulation number and show the existence of a…
This work is devoted to investigating the evolution of concentration in a genetic regulation system, when the synthesis reaction rate is under additive and multiplicative asymmetric stable L\'evy fluctuations. By focusing on the impact of…
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…
Consider a discrete-time one-dimensional supercritical branching random walk. We study the probability that there exists an infinite ray in the branching random walk that always lies above the line of slope $\gamma-\epsilon$, where $\gamma$…
It is well understood that if one is given a set $X \subset [0,1]$ of $n$ independent uniformly distributed random variables, then $$ \sup_{0 \leq x \leq 1} \left| \frac{\# X \cap [0,x]}{\# X} - x \right| \lesssim \frac{\sqrt{\log{n}}}{…
We consider transient random walks in random environment on Z in the positive speed (ballistic) and critical zero speed regimes. A classical result of Kesten, Kozlov and Spitzer proves that the hitting time of level $n$, after proper…
The canonical velocity-dependent one-scale (VOS) model for cosmic string evolution contains a number of free parameters which cannot be obtained ab initio. Therefore it must be calibrated using high resolution numerical simulations. We…
A random graph order is a partial order obtained from a random graph on $[n]$ by taking the transitive closure of the adjacency relation. The dimension of the random graph orders from random bipartite graphs $B(n,n,p)$ and from $G(n,p)$…
We develop Stein's method for $\alpha$-stable approximation with $\alpha\in(0,1]$, continuing the recent line of research by Xu \cite{lihu} and Chen, Nourdin and Xu \cite{C-N-X} in the case $\alpha\in(1,2).$ The main results include an…
We follow the temporal evolution of mesoscopic intensity fluctuations and correlation in strongly localized samples. We find an initial burst in relative transmission fluctuations in random one dimensional (1D) samples due to fluctuations…
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…
Let X_1,...., X_n be a collection of iid discrete random variables, and Y_1,..., Y_m a set of noisy observations of such variables. Assume each observation Y_a to be a random function of some a random subset of the X_i's, and consider the…
The standard genetic code is known to be robust to translation errors and point mutations. We studied how small modifications of the standard code affect its robustness. The robustness was assessed in terms of a proper stability function,…
Uniform stability of a learning algorithm is a classical notion of algorithmic stability introduced to derive high-probability bounds on the generalization error (Bousquet and Elisseeff, 2002). Specifically, for a loss function with range…