Related papers: Growth and Structure of Stochastic Sequences
A set of independence statements may define the independence structure of interest in a family of joint probability distributions. This structure is often captured by a graph that consists of nodes representing the random variables and of…
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Any graph which is an induced subgraph of a graph in this sequence is called a Burling graph. These graphs have attracted some attention because they…
Consider a stationary sequence $X=(X_n)$ of integer-valued random variables with mean $m \in [-\infty, \infty]$. Let $S=(S_n)$ be the stochastic process with increments $X$ and such that $S_0=0$. For each time $i$, draw an edge from…
We study a stochastic two-species chemical reaction system with two mechanisms. One mechanism consists of chemical interactions which govern the overall drift of species amounts in the system; the other mechanism consists of resampling,…
Existing theoretical models of evolution focus on the relative fitness advantages of different mutants in a population while the dynamic behavior of the population size is mostly left unconsidered. We here present a generic stochastic model…
Stochastic processes are proposed whose master equations coincide with classical wave, telegraph, and Klein-Gordon equations. Similar to predecessors based on the Goldstein-Kac telegraph process, the model describes the motion of particles…
Infinite sequences are of tremendous theoretical and practical importance, and in the Information Age sequences of 0s and 1s are of particular interest. Over the past century, the field of symbolic dynamics has developed to study sequences…
We review a series of forthcoming results leading to the construction of a natural evolution on the space of loops with values in a Riemannian manifold. In particular, this clarifies the algebraic structure of the renormalisation procedures…
It is shown that due to memory effects the complex behaviour of components in a stochastic system can be transmitted to macroscopic evolution of the system as a whole. Within the Markov approximation widely using in ordinary statistical…
The sequence $A067549$ of The On-Line Encyclopedia of Integer Sequences is defined as $(a_k)_{k \geq 1}$ with $a_k$ being the determinant of the $k \times k$ matrix whose diagonal contains the first $k$ prime numbers and all other elements…
We study the stochastic evolution of four species in cyclic competition in a well mixed environment. In systems composed of a finite number $N$ of particles these simple interaction rules result in a rich variety of extinction scenarios,…
Many growing networks possess accelerating statistics where the number of links added with each new node is an increasing function of network size so the total number of links increases faster than linearly with network size. In particular,…
Consider two independent random strings having same length and taking values uniformly in a common finite alphabet. We study the order of the variance of the length of the longest common subsequences (LCS) of these strings when long blocks,…
This article studies the dynamics of a finite chain with infinite components. The equation which permits us to find the probability distribution of the chain length is constructed and analysed. This research is a continuation of paper…
Randomness (in the sense of being generated in an IID fashion) and exchangeability are standard assumptions in nonparametric statistics and machine learning, and relations between them have been a popular topic of research. This short paper…
The theory of sequences, supported by many SMT solvers, can model program data types including bounded arrays and lists. Sequences are parameterized by the element data type and provide operations such as accessing elements, concatenation,…
This paper introduces several new classes of mathematical structures that have close connections with physics and with the theory of dynamical systems. The most general of these structures, called indivisible stochastic processes,…
Consider a set $A$ with no $p$-term arithmetic progressions for $p$ prime. The $p$-Stanley sequence of a set $A$ is generated by greedily adding successive integers that do not create a $p$-term arithmetic progression. For $p>3$ prime, we…
Many regenerative arguments in stochastic processes use random times which are akin to stopping times, but which are determined by the future as well as the past behaviour of the process of interest. Such arguments based on "conditioning on…
Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…