Seminars

Time periodic solutions for 3D quasi-geostrophic model.

Event Date: Sep 27, 2022 in Differential Equations, Seminars

Abstract: The aim of this talk is to study time periodic solutions for 3D inviscid quasigeostrophic model. We show the existence of non trivial simply-connected rotating patches by suitable perturbation of stationary solutions given by generic revolution shapes around the vertical axis. The construction of those special solutions are done through bifurcation theory. In general, the spectral problem is very delicate and strongly depends on the shape of the initial stationary solutions. More specifically, the spectral study can be related to an eigenvalue problem of a self-adjoint compact...

Read More

Acoplamiento inter-placas y Potencial Sísmico en el Lapso Sísmico de Atacama (Chile): Descartando una tajada rígida en los Andes.

Event Date: Sep 26, 2022 in Ciclo de Seminarios quincenales de la Alianza Copernicus-Chile, Seminars

Resumen: “Se presenta una nueva metodología para investigar el grado de acoplamiento (una medida del potencial sismogénico) a lo largo de la interfaz entre placas en zonas de subducción. Aquí, se infiere la deformación y movimientos rígidos de la placa continental de manera conjunta con el grado de acoplamiento entre las placas tectónicas. Las inferencias son constreñidas por mediciones de deformación de la superficie de la corteza terrestre, obtenidas a partir de observaciones de instrumentos del Sistema Global de Navegación por Satélite (GNSS). Se aplica la metodología propuesta...

Read More

Long-time behavior of a sexual reproduction model under the effect of strongly convex selection.

Event Date: Sep 20, 2022 in Differential Equations, Seminars

Abstract: The Fisher infinitesimal model is a widely used statistical model in quantitative genetics that describes the propagation of a quantitative trait along generations of a population subjected to sexual reproduction. Recently, this model has pulled the attention of the mathematical community and some integro-differential equations have been proposed to study the precise dynamics of traits under the coupled effect of sexual reproduction and natural selection. Whilst some partial results have already been obtained, the complete understanding of the long-time behavior is essentially...

Read More

Almost triangular Markov chains on ℕ

Event Date: Sep 21, 2022 in Seminario de Probabilidades de Chile, Seminars

Abstract:   A transition matrix U on ℕ is said to be almost upper triangular if U(i,j)≥0⇒j≥i−1, so that the increments of the corresponding Markov chains are at least −1; a transition matrix L on ℕ is said to be almost lower triangular if L(i,j)≥0⇒j≤i+1, and then, the increments of the corresponding Markov chains are at most +1. In this talk I will characterise the recurrence, positive recurrence and invariant distribution for the class of almost triangular transition matrices. These results encompass the case of birth and death processes (BDP), which are famous Markov chains being...

Read More

Bayesian Persuasion With Costly Information Acquisition.

Event Date: Sep 21, 2022 in ACGO, Seminars

Abstract: We consider a Bayesian persuasion model in which the receiver can gather independent information about the state at a uniformly posterior-separable cost. We show that the sender provides information that prevents the receiver from gathering independent information in equilibrium. When the receiver faces a lower cost of information, her `threat’ of gathering independent information increases, thus decreasing the sender’s power to persuade. A lower cost of information can also hurt the receiver because the sender may provide strictly less information in equilibrium....

Read More

The kidney exchange problem: length-constrained cycles and chains optimization on compatibility graphs.

Event Date: Sep 07, 2022 in ACGO, Seminars

Abstract: The kidney exchange problem is a combinatorial optimization problem that arises naturally when implementing centralized kidney exchange programs. Given a directed weighted graph (called the compatibility graph), we aim to find a collection of simple and vertex-disjoint cycles maximizing the total weight of their participating arcs. Because of logistical considerations, a bound k is placed on the length of each possible cycle. We will briefly explain how the problem is polynomially solvable in the cases k = 2 and unbounded k, and why it turns NP-complete for k >= 3. MIP...

Read More