Related papers: Normal Inverse Gaussian Approximation for Arrival …
Precise characterization of the mutual information of MIMO systems is required to assess the throughput of wireless communication channels in the presence of Rician fading and spatial correlation. Here, we present an asymptotic approach…
We introduce a formalism for the calculation of the time of arrival t at a space point for particles traveling through interacting media. We develop a general formulation that employs quantum canonical transformations from the free to the…
We study the long-time behavior of the probability density associated with the decoupled continuous-time random walk which is characterized by a superheavy-tailed distribution of waiting times. It is shown that if the random walk is…
Performance bounds for opportunistic networks have been derived in a number of recent papers for several key quantities, such as the expected delivery time of a unicast message, or the flooding time (a measure of how fast information…
We consider anomalous diffusion for molecular communication with a passive receiver. We first consider the probability density function of molecules' location at a given time in a space of arbitrary dimension. The expected number of…
For information transmission a discrete time channel with independent additive Gaussian noise is used. There is also another channel with independent additive Gaussian noise (the feedback channel), and the transmitter observes without delay…
In this paper, we consider a multi-hop molecular communication network consisting of one nanotransmitter, one nanoreceiver, and multiple nanotransceivers acting as relays. We consider three different relaying schemes to improve the range of…
The inverse Gaussian (IG) is one of the most famous and considered distributions with positive support. We propose a convenient mode-based parameterization yielding the reparametrized IG (rIG) distribution; it allows/simplifies the use of…
Two of the most popular approximations for the distribution of the steady-state waiting time, $W_{\infty}$, of the M/G/1 queue are the so-called heavy-traffic approximation and heavy-tailed asymptotic, respectively. If the traffic…
We study the second-order asymptotics of information transmission using random Gaussian codebooks and nearest neighbor (NN) decoding over a power-limited stationary memoryless additive non-Gaussian noise channel. We show that the dispersion…
This paper studies the capacity of molecular communications in fluid media, where the information is encoded in the number of transmitted molecules in a time-slot (amplitude shift keying). The propagation of molecules is governed by random…
We study diversity in one-shot communication over molecular timing channels. We consider a channel model where the transmitter simultaneously releases a large number of information particles, while the information is encoded in the time of…
We show how to distribute with percentage success probabilities almost perfectly entangled qubit memory pairs over repeater channel segments of the order of the optical attenuation distance. In addition to some weak, dispersive light-matter…
We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…
The random propagation of molecules in a fluid medium is characterized by the spontaneous diffusion law as well as the interaction between the environment and molecules. In this paper, we embody the anomalous diffusion theory for modeling…
A diffusion molecular channel is a channel with memory, as molecules released into the medium hit the receptors after a random delay. Coding over the diffusion channel is performed by choosing the type, intensity, or the released time of…
This paper studies the problem of receiver modeling in molecular communication systems. We consider the diffusive molecular communication channel between a transmitter nano-machine and a receiver nano-machine in a fluid environment. The…
We study the mixing time guarantee for sampling in relative Fisher information via the Proximal Sampler algorithm, which is an approximate proximal discretization of the Langevin dynamics. We show that when the target probability…
The generalized inverse Gaussian-Poisson (GIGP) distribution proposed by Sichel in the 1970s has proved to be a flexible fitting tool for diverse frequency data, collectively described using the item production model. In this paper, we…
This study connects two methods for modeling reaction times (RTs) in choice tasks: (1) the first-hitting time of a simple diffusion model with a single barrier, representing the cognitive process leading to a response, and (2) Generalized…