Related papers: Quickest Sequence Phase Detection
Core-periphery detection aims to separate the nodes of a complex network into two subsets: a core that is densely connected to the entire network and a periphery that is densely connected to the core but sparsely connected internally. The…
The problem of quickest detection of a change in distribution is considered under the assumption that the pre-change distribution is known, and the post-change distribution is only known to belong to a family of distributions…
In our problem, we are given access to a number of sequences of nonnegative i.i.d. random variables, whose realizations are observed sequentially. All sequences are of the same finite length. The goal is to pick one element from each…
We study the synchronization behavior of a noisy network in which each system is driven by two sources of state-dependent noise: (1) an intrinsic noise which is common among all systems and can be generated by the environment or any…
Equations governing the nonlinear dynamics of complex systems are usually unknown and indirect methods are used to reconstruct their manifolds. In turn, they depend on embedding parameters requiring other methods and long temporal sequences…
For a finite state automaton, a synchronizing sequence is an input sequence that takes all the states to the same state. Checking the existence of a synchronizing sequence and finding a synchronizing sequence, if one exists, can be…
A multi-source quickest detection problem is considered. Assume there are two independent Poisson processes $X^{1}$ and $X^{2}$ with disorder times $\theta_{1}$ and $\theta_{2}$, respectively; that is, the intensities of $X^1$ and $X^2$…
Change point detection plays a fundamental role in many real-world applications, where the goal is to analyze and monitor the behaviour of a data stream. In this paper, we study change detection in binary streams. To this end, we use a…
The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k >= 3. We solve this problem for the case k=3. We prove that superposition coding is optimal for a class of…
In this paper we consider the problem of quickly detecting changes in an intermittent signal that can (repeatedly) switch between a normal and an anomalous state. We pose this intermittent signal detection problem as an optimal stopping…
To quantify the fundamental evolution of time-varying networks, and detect abnormal behavior, one needs a notion of temporal difference that captures significant organizational changes between two successive instants. In this work, we…
We consider a statistical problem of detection of a signal with unknown energy in a multi-channel system, observed in a Gaussian noise. We assume that the signal can appear in the $k$-th channel with a known small prior probability…
Consider a network consisting of two subnetworks (communities) connected by some external edges. Given the network topology, the community detection problem can be cast as a graph partitioning problem that aims to identify the external…
A nCk sequence is a sequence of n-bit numbers with k bits set. Given such a sequence C, the difference sequence D of C is subject to certain regularities that make it possible to generate D in 2|C| time, and, hence, to generate C in 3|C|…
Quantum entanglement and nonlocality are foundational to quantum technologies, driving quantum computation, communication, and cryptography innovations. To benchmark the capabilities of these quantum techniques, efficient detection and…
A new direct-detection-compatible signalling scheme is proposed for fiber-optic communication over short distances. Controlled inter-symbol interference is exploited to extract phase information, thereby achieving spectral efficiencies…
Recent years have witnessed a growing interest in using machine learning to predict and identify phase transitions in various systems. Here we adopt convolutional neural networks (CNNs) to study the phase transitions of Vicsek model,…
Many industrial and security applications employ a suite of sensors for detecting abrupt changes in temporal behavior patterns. These abrupt changes typically manifest locally, rendering only a small subset of sensors informative.…
We introduce a new variant of the $k$-deck problem, which in its traditional formulation asks for determining the smallest $k$ that allows one to reconstruct any binary sequence of length $n$ from the multiset of its $k$-length…
Several biological problems require the identification of regions in a sequence where some feature occurs within a target density range: examples including the location of GC-rich regions, identification of CpG islands, and sequence…