Related papers: Persistent order in Schramm-Loewner Evolution driv…
Motivated by the question of the impact of selective advantage in populations with skewed reproduction mechanims, we study a Moran model with selection. We assume that there are two types of individuals, where the reproductive success of…
Amorphous solids may resist external deformation such as shear or compression while they do not present any long-range translational order or symmetry at the microscopic scale. Yet, it was recently discovered that, when they become rigid,…
The Rohde--Schramm theorem states that Schramm--Loewner Evolution with parameter $\kappa$ (or SLE$_\kappa$ for short) exists as a random curve, almost surely, if $\kappa \neq 8$. Here we give a new and concise proof of the result, based on…
We consider transport over a strongly connected, directed graph. The scheduling amounts to selecting transition probabilities for a discrete-time Markov evolution which is designed to be consistent with certain initial and final marginals.…
We study sorting in the evolving data model, introduced by [AKMU11], where the true total order changes while the sorting algorithm is processing the input. More precisely, each comparison operation of the algorithm is followed by a…
This work introduces and analyzes a finite element scheme for evolution problems involving fractional-in-time and in-space differentiation operators up to order two. The left-sided fractional-order derivative in time we consider is employed…
We study the shape of the Young diagram \lambda associated via the Robinson-Schensted-Knuth algorithm to a random permutation in S_n such that the length of the longest decreasing subsequence is not bigger than a fixed number d; in other…
We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…
In [16], under mild conditions, a Wiener-Hopf type factorization is derived for the exponential functional of proper L\'evy processes. In this paper, we extend this factorization by relaxing a finite moment assumption as well as by…
We consider a system of N particles with a stochastic dynamics introduced by Brunet and Derrida. The particles can be interpreted as last passage times in directed percolation on {1,...,N} of mean-field type. The particles remain grouped…
If we want to represent integers in base $m$, we need a set $A$ of digits, which needs to be a complete set of residues modulo $m$. When adding two integers with last digits $a_1, a_2 \in A$, we find the unique $a \in A$ such that $a_1 +…
The natural paramterization or length for the Schramm-Loewner evolution (SLE{\kappa}) is the candidate for the scaling limit of the length of discrete curves for \kappa < 8. We improve the proof of the existence of the parametrization and…
The diffusion equation is extended by including spatial-temporal memory in such a manner that the conservation of the concentration is maintained. The additional memory term gives rise to the formation of non-trivial stationary solutions.…
We study the statistics of last-passage time for linear diffusions. First we present an elementary derivation of the Laplace transform of the probability density of the last-passage time, thus recovering known results from the mathematical…
We show that, with the exception of the words $a^2ba^2$ and $b^2ab^2$, all (finite or infinite) binary patterns in the Prouhet-Thue-Morse sequence can actually be found in that sequence as segments (up to exchange of letters in the infinite…
A suitable choice of the representation of candidate solutions is crucial for the efficiency of evolutionary algorithms and related metaheuristics. We focus on problems in permutation spaces, which are at the core of numerous practical…
The Levy-flight dynamics can stem from simple random walks in a system whose operational time (number of steps n) typically grows superlinearly with physical time t. Thus, this processes is a kind of continuous-time random walks (CTRW),…
A decent number of lower bounds for non-elitist population-based evolutionary algorithms has been shown by now. Most of them are technically demanding due to the (hard to avoid) use of negative drift theorems -- general results which…
Mesh numbering is a critical issue in Finite Element Methods, as the computational cost of one analysis is highly dependent on the order of the nodes of the mesh. This paper presents some preliminary investigations on the problem of mesh…
The prime numbers look like a randomly chosen sequence of natural numbers, but there is still no strict theory to determine 'Randomness'. In these years, cryptography has developed a battery of statistical tests for randomness. In this…