Related papers: Stabilization Time for a Type of Evolution on Bina…
Selecting regularization parameters in penalized high-dimensional graphical models in a principled, data-driven, and computationally efficient manner continues to be one of the key challenges in high-dimensional statistics. We present…
We investigate the twin-width of the Erd\H{o}s-R\'enyi random graph $G(n,p)$. We unveil a surprising behavior of this parameter by showing the existence of a constant $p^*\approx 0.4$ such that with high probability, when $p^*\le p\le…
In this paper, we address the problem of stabilization in continuous time linear dynamical systems using state feedback when compressive sampling techniques are used for state measurement and reconstruction. In [5], we had introduced the…
We probabilistically analyze the performance of the arithmetic coding algorithm under a probability model for binary data in which a message is received by a coder from a source emitting independent equally distributed bits, with 1…
Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…
We consider a simple random walk W_i in 1 or 2 dimensions, in which the walker may choose to stand still for a limited time. The time horizon is n, the maximum consecutive time steps which can be spent standing still is m_n and the goal is…
In studying the time evolution of isolated many-body quantum systems, a key focus is determining whether the system undergoes relaxation and reaches a steady state at a given point in time. Traditional approaches often rely on specific…
We construct `self-stabilizing' processes {Z(t), t $\in [t_0,t_1)$}. These are random processes which when `localized', that is scaled around t to a fine limit, have the distribution of an $\alpha$(Z(t))-stable process, where $\alpha$ is…
The classical result of Erdos and Renyi shows that the random graph G(n,p) experiences sharp phase transition around p=1/n - for any \epsilon>0 and p=(1-\epsilon)/n, all connected components of G(n,p) are typically of size O(log n), while…
We set up and analyse a model for the non-equilibrium evolution of a network of cosmic strings initially containing only loops and no infinite strings. Due to this particular initial condition, our analytical approach differs significantly…
We generalize the poissonian evolving random graph model of Bauer and Bernard to deal with arbitrary degree distributions. The motivation comes from biological networks, which are well-known to exhibit non poissonian degree distribution. A…
We study a class of elastic systems described by a (hyperbolic) partial differential equation. Our working example is the equation of a vibrating string subject to linear disturbance. The main goal is to establish conditions for…
For a stochastic difference equation $D_n=A_nD_{n-1}+B_n$ which stabilises upon time we study tail distribution asymptotics of $D_n$ under the assumption that the distribution of $\log(1+|A_1|+|B_1|)$ is heavy-tailed, that is, all its…
Cellular differentiation and evolution are stochastic processes that can involve multiple types (or states) of particles moving on a complex, high-dimensional state-space or "fitness" landscape. Cells of each specific type can thus be…
We study the evolution of the susceptibility in the subcritical random graph $G(n,p)$ as $n$ tends to infinity. We obtain precise asymptotics of its expectation and variance, and show it obeys a law of large numbers. We also prove that the…
The \textit{ternary digits of $2^n$} are a finite sequence of 0s, 1s, and 2s. It is a natural question to ask whether the frequency of any string of 0s, 1s, and 2s in this sequence approaches the same limit for all strings of the same…
We construct and simulate the dynamics of gauged vortons - circular loops of cosmic string supported by the angular momentum of trapped charge and current and provide additional details on the fully stable vorton that we have previously…
The filtering distribution is a time-evolving probability distribution on the state of a dynamical system, given noisy observations. We study the large-time asymptotics of this probability distribution for discrete-time, randomly…
Let $\{X_i,i=1,2,...\}$ be i.i.d. standard gaussian variables. Let $S_n=X_1+...+X_n$ be the sequence of partial sums and $$ L_n=\max_{0\leq i<j\leq n}\frac{S_j-S_i}{\sqrt{j-i}}. $$ We show that the distribution of $L_n$, appropriately…
Evolutionary dynamics on graphs can lead to many interesting and counterintuitive findings. We study the Moran process, a discrete time birth-death process, that describes the invasion of a mutant type into a population of wild-type…