SIR model with social gatherings.
Abstract: The classic susceptible-infected-recovered (SIR) model, introduced by Kermack and McKendrick in 1927, is a simple system of ODEs governing the spread of an infectious disease in a large population. It is based on the assumption that the disease is transmitted via pairwise interactions between infected and susceptible individuals. In this talk, we propose an extension to this model, whose underlying infection mechanism consists of individuals attending randomly generated social gatherings, leading to potentially many new infections. This gives rise to an explicit system of ODEs,...
Read MoreTopo-isomorfismos de subshifts irregulares de Toeplitz para grupos residualmente finitos.
RESUMEN: Para cada grupo contable residualmente finito G se construyen ejemplos de subshifts irregulares de Toeplitz en {0,1}^G que son topo-isomorfos a su factor maximal equicontinuo. Para obtener este resultado se establecen condiciones suficientes para que un subshift de Toeplitz tenga medidas invariantes como puntos límites de medidas invariantes periódicas sobre {0,1}^G Posteriormente, se construyen arreglos de Toeplitz cuyo subshift asociado satisface tales condiciones para tener medidas invariantes y con esto poder garantizar que son topo-isomorfos a su factor equicontinuo maximal.Si...
Read MoreOnline learning with consistency oracle.
Abstract: A binary classification game is being played between a learner and an adversary. At each round, the adversary selects a natural number x and the learner has to predict its label h(x). Is there a bound on the number of mistakes made by the learner, assuming that h comes from some class H? Littlestone gave a learning algorithm which achieves an optimal mistake bound d, provided H has a certain combinatorial property. However, Littlestone’s algorithm is believed to be computationally demanding. Can we have a feasible strategy for the learner and if so, how many mistakes would...
Read MoreSobre una nueva estructura hiperbólica.
RESUMEN: La coexistencia de singularidades y órbitas regulares en conjuntos transitivos por cadena ha sido un desafío para caracterizar por una estructura hiperbólica campos vectoriales que tienen todas sus órbitas periódicas fuertemente hiperbólicas (flujos estrella). En el 2004, Morales, Pacífico y Pujals propusieron la hiperbolicidad singular, que caracteriza un subconjunto abierto y denso de flujos estrella en dimensión tres. En dimensiones superiores y para campos con más de una sóla singularidad acumulando órbitas regulares, Bonatti y da Luz caracterizan un abierto y denso de flujos...
Read MoreProgramación de estados cuánticos con pulsos.
Resumen: En esta charla autocontenida, presentaremos una introducción a los fundamentos de la mecánica cuántica y computación cuántica. Además, introduciremos la nueva forma de controlar computadores cuánticos superconductores, la cual reemplaza a las compuertas cuánticas tradicionales por pulsos electromagnéticos arbitrarios.
Read MoreApproximate and partial symmetries in Deep Learning.
Abstract: The image of a rotated cat still represents a cat: while this simple rule seems obvious to a human, it is not obvious to neural networks, which separately “learn” each new rotation of the same image. This applies to different groups of symmetries for images, graphs, texts, and other types of data. Implementing “equivariant” neural networks that respect symmetries, reduces the number of learned parameters, and helps improve their generalization properties outside the training set. On the other hand, in networks that “identify too much”, that is,...
Read More



Noticias en español
