Related papers: Locking-time and Information Capacity in CML with …
Wireless information-centric networks consider storage as one of the network primitives, and propose to cache data within the network in order to improve latency and reduce bandwidth consumption. We study the throughput capacity and delay…
Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This…
Recurrence entropy $(\cal S)$ is a novel time series complexity quantifier based on recurrence microstates. Here we show that $\mathsf{max}(\cal S)$ is a \textit{parameter-free} quantifier of time correlation of stochastic and chaotic…
Single unit recordings in the human medial temporal lobe (MTL) have revealed a population of cells with conceptually based, highly selective activity, indicating the presence of a sparse neural code. Building off previous work by the author…
Human language has a distinct systematic structure, where utterances break into individually meaningful words which are combined to form phrases. We show that natural-language-like systematicity arises in codes that are constrained by a…
We consider non-Hermitian dynamics of a quantum particle hopping on a one-dimensional tight-binding lattice made of $N$ sites with asymmetric hopping rates induced by a time-periodic oscillating imaginary gauge field. A deeply different…
We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of…
In this thesis, we provide an initial investigation into bounds for topological entropy of switched linear systems. Entropy measures, roughly, the information needed to describe the behavior of a system with finite precision on finite time…
Wireless information-centric networks consider storage as one of the network primitives, and propose to cache data within the network in order to improve latency and reduce bandwidth consumption. We study the throughput capacity and latency…
We study the spectrum and stationary states in a ring-shaped lattice potential in the context of ultracold atoms with attractive interatomic interactions. We determine analytical solutions in the absence of a lattice by mapping them to…
Recently spike timing dependent plasticity was observed in inhibitory synapse in the layer II of entorhinal cortex. The rule provides an interesting zero in the region of $\Delta t=t_{post}-t_{pre}=0$ and in addition the dynamic range of…
We consider the statistics of occupation times, the number of visits at the origin and the survival probability for a wide class of stochastic processes, which can be classified as renewal processes. We show that the distribution of these…
This paper investigates the relationship between categorical entropy and von Neumann entropy of quantum lattices. We begin by studying the von Neumann entropy, proving that the average von Neumann entropy per site converges to the logarithm…
Data is the cornerstone of large language models (LLMs), but not all data is useful for model learning. Carefully selected data can better elicit the capabilities of LLMs with much less computational overhead. Most methods concentrate on…
We present a new coupling scheme to control spatio-temporal patterns and chimeras on 1-d and 2-d lattices and random networks of discrete dynamical systems. The scheme involves coupling with an external lattice or network of damped systems.…
A variety of complex fluids under shear exhibit complex spatio-temporal behaviour, including what is now termed rheological chaos, at moderate values of the shear rate. Such chaos associated with rheological response occurs in regimes where…
The information processing capacity of a complex dynamical system is reflected in the partitioning of its state space into disjoint basins of attraction, with state trajectories in each basin flowing towards their corresponding attractor.…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
The paper is focused on the tradeoff between performance and decoding complexity per iteration for LDPC codes in terms of their gap (in rate) to capacity. The study of this tradeoff is done via information-theoretic bounds which also enable…
The retrieval abilities of spatially uniform attractor networks can be measured by the average overlap between patterns and neural states. We found that metric networks, with local connections, however, can carry information structured in…