activity
20182021
most citedTesting for directed information graphs

3 citations · 5 across the 3 of their papers we have counts for

collaborators

6 papers

cs.IT20213 cited

Testing for directed information graphs

Sina Molavipour, Germán Bassi, Mikael Skoglund

In this paper, we study a hypothesis test to determine the underlying directed graph structure of nodes in a network, where the nodes represent random processes and the direction o…

eess.SY20202 cited

Causality Graph of Vehicular Traffic Flow

Sina Molavipour, Germán Bassi, Mladen Čičić +2

In an intelligent transportation system, the effects and relations of traffic flow at different points in a network are valuable features which can be exploited for control system…

cs.IT2020

On Random Subset Generalization Error Bounds and the Stochastic Gradient Langevin Dynamics Algorithm

Borja Rodríguez-Gálvez, Germán Bassi, Ragnar Thobaben +1

In this work, we unify several expected generalization error bounds based on random subsets using the framework developed by Hellström and Durisi [1]. First, we recover the bounds…

cs.IT2020

Secure Strong Coordination

Giulia Cervia, German Bassi, Mikael Skoglund

We consider a network of two nodes separated by a noisy channel, in which the source and its reconstruction have to be strongly coordinated, while simultaneously satisfying the str…

cs.IT2019

Conditional Mutual Information Neural Estimator

Sina Molavipour, Germán Bassi, Mikael Skoglund

Several recent works in communication systems have proposed to leverage the power of neural networks in the design of encoders and decoders. In this approach, these blocks can be t…

math.ST2018

Non-Asymptotic Behavior of the Maximum Likelihood Estimate of a Discrete Distribution

Sina Molavipour, Germán Bassi, Mikael Skoglund

In this paper, we study the maximum likelihood estimate of the probability mass function (pmf) of independent and identically distributed (i.i.d.) random variables, in the non-…