Related papers: Maximal escape rate for shifts
A hypergraph $(V,E)$ is called an interval hypergraph if there exists a linear order $l$ on $V$ such that every edge $e\in E$ is an interval w.r.t. $l$; we also assume that $\{j\}\in E$ for every $j\in V$. Our main result is a de…
We introduce a new framework term coding for extremal problems in discrete mathematics and information flow, where one chooses interpretations of function symbols so as to maximise the number of satisfying assignments of a finite system of…
In samples used to maintain the US resistance standard the breakdown of the dissipationless integer quantum Hall effect occurs as a series of dissipative voltage steps. A mechanism for this type of breakdown is proposed, based on the…
We establish the \emph{hole phenomenon} for the Gaussian analytic function \[ F_{\beta}(z)=\sum_{n=0}^{\infty}\frac{\xi_{n}}{\sqrt{\Gamma\bigl(\frac{2}{\beta}(n+1)\bigr)}}\,z^{n}, \] associated with the power-exponential weight…
This paper considers guessing-based decoders with abandonment for discrete memoryless channels in which all codewords have the same composition. This class of decoders rank-orders all input sequences in the codebook's composition class from…
The escape dynamics in a two-dimensional multiwell potential is explored. A thorough numerical investigation is conducted in several types of two-dimensional planes and also in a three-dimensional subspace of the entire four-dimensional…
We study the rate at which stars spiral into a massive black hole (MBH) due to the emission of gravitational waves (GWs), as a function of the mass M of the MBH. In the context of our model, it is shown analytically that the rate…
The mixer chain on a graph G is the following Markov chain. Place tiles on the vertices of G, each tile labeled by its corresponding vertex. A "mixer" moves randomly on the graph, at each step either moving to a randomly chosen neighbor, or…
We consider a Shannon cipher system for memoryless sources, in which distortion is allowed at the legitimate decoder. The source is compressed using a rate distortion code secured by a shared key, which satisfies a constraint on the…
We provide insight into the qubit measurement process involving a switching type of detector. We study the switching-induced decoherence during escape events. We present a simple method to obtain analytical results for the qubit dephasing…
This paper studies nonstationary open dynamical systems from the statistical viewpoint. By open, we mean that trajectories may escape through holes in the phase space. By nonstationary, we mean that the dynamical model itself (as well as…
Quantifying space exploration is a central question in random walk theory, with direct applications ranging from animal foraging, diffusion-limited reactions, and intracellular transport to stock markets. In particular, the explored domain…
Rotor walk is a deterministic analogue of simple random walk. For any given graph, we construct a rotor configuration for which the escape rate of the corresponding rotor walk is equal to the escape rate of simple random walk, and thus…
We compute mass outflow rates from accretion disks around compact objects, such as neutron stars and black holes. These computations are done using combinations of exact transonic inflow and outflow solutions which may or may not form…
We search for solutions describing slowly moving non-rotating black holes in the khrono-metric model, a modified gravity theory with preferred time (khronon) which arises at low energies from the non-projectable Horava gravity. We work in…
Rate distortion theory is concerned with optimally encoding a given signal class $\mathcal{S}$ using a budget of $R$ bits, as $R\to\infty$. We say that $\mathcal{S}$ can be compressed at rate $s$ if we can achieve an error of…
There is a natural connection between two types of recurrence law: hitting times to shrinking targets, and hitting times to a fixed target (usually seen as escape through a hole). We show that for systems which mix exponentially fast, one…
In this work, we study the problem of finding the asymptotic growth rate of the number of of $d$-dimensional arrays with side length $n$ over a given alphabet which avoid a list of one-dimensional "forbidden" words along all cardinal…
We study the entropy rate of pattern sequences of stochastic processes, and its relationship to the entropy rate of the original process. We give a complete characterization of this relationship for i.i.d. processes over arbitrary…
Given a factor code $\pi$ from a one-dimensional shift of finite type $X$ onto an irreducible sofic shift $Y$, if $\pi$ is finite-to-one there is an invariant called the degree of $\pi$ which is defined the number of preimages of a typical…