Publications de Patrick Thiran

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

To quantify the randomness of Markov trajectories with fixed initial and final states, Ekroot and Cover proposed a closed-form expression for the entropy of trajectories of an irreducible finite state Markov chain. Numerous applications, including the stud ...

Many biological systems exhibit collective behaviors that strengthen their adaptability to their environment, compared to more solitary species. Describing these behaviors is challenging yet necessary in order to understand these biological systems. We pro ...

Clustering is a pivotal challenge in unsupervised machine learning and is often investigated through the lens of mixture models. The optimal error rate for recovering cluster labels in Gaussian and sub-Gaussian mixture models involves ad hoc signal-to-nois ...

We investigate the IEEE 1901 MAC protocol, the dominant protocol for high data rate power-line communications. 1901 employs a CSMA/CA mechanism similar to – but much more complex than – the backoff mechanism of 802.11. Because of this extra complexity, and ...

This paper presents a general class of gossip-based averaging algorithms, which are inspired from Uniform Gossip [1]. While Uniform Gossip works synchronously on complete graphs, weighted gossip algorithms allow asynchronous rounds and converge on any conn ...

Network Calculus is a collection of results based on Min-Plus algebra, which applies to deterministic queuing systems found in communication networks. It can be used for example to understand - the computations for delays used in the IETF guaranteed service - why re-shaping delays can be ignored in shapers or spacer-controllers - a common model for schedulers - deterministic effective bandwidth and much more.

Energy efficiency of wireless sensor networks (WSNs) can be improved by moving base stations (BSs), as this scheme evenly distributes the communication load in the network. However, physically moving BSs is complicated and costly. In this paper, we propose ...

Decentralized medium access control schemes for wireless networks based on CSMA/CA, such as the 802.11 protocol, are known to be unfair. In multi-hop networks, they can even favor some connections to such an extent that the others suffer from virtually com ...

We study the problem of privacy-preserving computation of functions of data that belong to users in a social network under the assumption that users are willing to share their private data with trusted friends in the network. We demonstrate that such trust ...

We model some lossless queuing systems arising in guaranteed service networks as non-linear min-plus systems that can be bounded by linear systems. We propose a methodology and apply it to the window flow control problem previously studied by Cruz and Okino, Chang, Agrawal and Rajan. We explain the existing bounds and derive a refined, tighter bound. We also show how the same method can be used to model also systems with losses.

Wireless Multi-Hop CSMA/CA Networks are challenging to analyze. On the one hand, their dynamics are complex and rather subtle effects may severely affect their performance. Yet, understanding these effects is critical to operate upper layer protocols, such ...

Breadth First Search (BFS) is a widely used approach for sampling large graphs. However, it has been empirically observed that BFS sampling is biased toward high-degree nodes, which may strongly affect the measurement results. In this paper, we quantify an ...

Multivariate Hawkes processes (MHP) are widely used in a variety of fields to model the occurrence of discrete events. Prior work on learning MHPs has only focused on inference in the presence of perfect traces without noise. We address the problem of lear ...

The present invention discloses a method, apparatus and computer program product for locating a source of diffusion in a network, the method comprising providing a model of at least a portion of the network, the network comprising a plurality of nodes, a p ...

We analyse the performance of the multiplexing of heterogenous VBR connections over a VBR trunk.

Boolean Inference makes it possible to observe the congestion status of end-to-end paths and infer, from that, the congestion status of individual network links. In principle, this can be a powerful monitoring tool, in scenarios where we want to monitor a ...

When an epidemic spreads in a network, a key question is where was its source, i.e., the node that started the epidemic. If we know the time at which various nodes were infected, we can attempt to use this information in order to identify the source. Howev ...

The knowledge of real-life traffic patterns is crucial for a good understanding and analysis of transportation systems. These data are quite rare. In this paper we propose an algorithm for extracting both the real physical topology and the network of traff ...

Patrick Thiran

Chattez avec Graph Search

The Entropy of Conditional Markov Trajectories

Uncovering Latent Behaviors in Ant Colonies

Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models

Performance Analysis of MAC for Power-Line Communications

Weighted Gossip: Distributed Averaging Using Non-Doubly Stochastic Matrices

Network Calculus

Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks

Modeling the 802.11 protocol under different capture and sensing capabilities

Privacy-Preserving Function Computation by Exploitation of Friendships in Social Networks

On the transition times in a loss model of wireless networks

Network Calculus using Min/Plus System Theory

Models of 802.11 Multi-Hop Networks: Theoretical Insights and Experimental Validation

Towards Unbiased BFS Sampling

Learning Hawkes Processes Under Synchronization Noise

Method, apparatus and computer program product for locating a source of diffusion in a network

Multiplexing of heterogeneous VBR connections over a VBR trunk

Shifting Network Tomography Toward A Practical Goal

A protection-based approach to QoS in Packet over fiber networks

Observer Placement for Source Localization: the Effect of Budgets and Transmission Variance

Extraction and analysis of traffic and topologies of transportation networks