Related papers: Persistent order in Schramm-Loewner Evolution driv…
In this paper we present some new limit theorems for power variation of $k$th order increments of stationary increments L\'evy driven moving averages. In the infill asymptotic setting, where the sampling frequency converges to zero while…
We consider soft-gluon evolution at the amplitude level. Our evolution includes Coulomb exchanges and applies to generic hard-scattering processes involving any number of coloured partons. We emphasise the special role played by a…
Schramm-Loewner Evolutions (SLEs) have proved an efficient way to describe a single continuous random conformally invariant interface in a simply-connected planar domain; the admissible probability distributions are parameterized by a…
A classical result of Conway and Pless is that a natural projection of the fixed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual. In this paper we prove that the same holds for involutions under…
Stochastic Loewner evolution (SLE) is a differential equation driven by a one-dimensional Brownian motion (BM), whose solution gives a stochastic process of conformal transformation on the upper half complex-plane $\H$. As an evolutionary…
It has long been known that sequences such as the powers of $2$ and the factorials satisfy Benford's Law; that is, leading digits in these sequences occur with frequencies given by $P(d)=\log_{10}(1+1/d)$, $d=1,2,\dots,9$. In this paper, we…
We present the analysis of the first passage time problem on a finite interval for the generalized Wiener process that is driven by L\'evy stable noises. The complexity of the first passage time statistics (mean first passage time,…
The Green-Tao Theorem, one of the most celebrated theorems in modern number theory, states that there exist arbitrarily long arithmetic progressions of prime numbers. In a related but different direction, a recent theorem of Shiu proves…
In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…
Research on the distribution of prime numbers has revealed a dual character: deterministic in definition yet exhibiting statistical behavior reminiscent of random processes. In this paper we show that it is possible to use an image-focused…
Loop-erased random walk and it's scaling limit, Schramm--Loewner evolution, have found numerous applications in mathematics and physics. We present a 2 dimensional analogue of LERW, the loop erased random surface. We do this by defining a 2…
We show how to relate Schramm-Loewner Evolutions (SLE) to highest-weight representations of infinite dimensional Lie Algebras using the conformal restriction properties studied by Lawler, Schramm and Werner in the paper…
We simulate several models of random curves in the half plane and numerically compute their stochastic driving process (as given by the Loewner equation). Our models include models whose scaling limit is the Schramm-Loewner evolution (SLE)…
The Stochastic Loewner equation, introduced by Schramm, gives us a powerful way to study and classify critical random curves and interfaces in two-dimensional statistical mechanics. New kind of stochastic Loewner equation, called fractional…
We study the statistical properties of stochastic evolution equations driven by space-only noise, either additive or multiplicative. While forward problems, such as existence, uniqueness, and regularity of the solution, for such equations…
Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation measure of order 2 is large. These sequences are highly…
This article is meant to serve as a guide to recent developments in the study of the scaling limit of critical models. These new developments were made possible through the definition of the Stochastic Loewner Evolution (SLE) by Oded…
In this work, we consider a modification of the usual Branching Random Walk (BRW), where we give certain independent and identically distributed (i.i.d.) displacements to all the particles at the $n$-th generation, which may be different…
In combinatorics on words, the well-studied factor complexity function $\rho_{\infw{x}}$ of a sequence $\infw{x}$ over a finite alphabet counts, for every nonnegative integer $n$, the number of distinct length-$n$ factors of $\infw{x}$. In…
An interesting open conjecture asks whether it is possible to walk to infinity along primes, where each term in the sequence has one digit more than the previous. We present different greedy models for prime walks to predict the long-time…