Seminários de probabilidade – Primeiro Semestre de 2025

Quando forem online, as palestras ocorrerão via Google Meet às segundas-feiras às 15h30, a menos de algumas exceções devidamente indicadas.

Quando forem presenciais, as palestras ocorrerão na sala C-116 às segundas-feiras às 15h30, a menos de algumas exceções devidamente indicadas.

Todas as palestras são em inglês.

Lista completa (palestras futuras podem sofrer alterações)

We consider a system of binary interacting chains describing the dynamics of a group of N individuals that, at each time unit, either send some signal to the others or remain silent otherwise. The interactions among the chains are encoded by a directed Erdos-Renyi random graph with unknown edge probability 0<p<1. Moreover, the system is structured into two communities (excitatory chains versus inhibitory ones) which are coupled via a mean field interaction on the underlying Erdös-Rényi graph. These two communities are also unknown. Last year, I gave a talk at the DME Statistics Seminar discussing how one could estimate the edge probability p based only on the observation of the interacting chains over T time units. In this talk, I will address the complementary question of how to distinguish between the excitatory and inhibitory chains. I will also highlight some of the probabilistics tools we used to tackle this problem. The results presented are based on a joint work with Julien Chevallier (Grenoble).

Sprinkling is a technique used to control the decay of correlations (decoupling) through an inequality obtained by introducing small perturbations, and it plays a key role in multiscale renormalization schemes for strongly correlated systems. In this talk we will discuss some motivations related to two models on the top of Hammersley’s particle system and prove a sprinkled decoupling inequality for this particle system.