Analysis, Geometry, and Dynamical Systems Seminar   RSS

Past sessions

05/07/2019, 15:00 — 16:30 — Room P4.35, Mathematics Building
Martin Evans, Edinburgh University

Generalisations to Multispecies (V)

Second class particle; multispecies exclusion process; hierarchical matrix solution and proof; queueing interpretation.

Continuation of Lecture 4.

04/07/2019, 15:00 — 16:30 — Room P4.35, Mathematics Building
Martin Evans, Edinburgh University

Generalisations to Multispecies (IV)

Second class particle; multispecies exclusion process; hierarchical matrix solution and proof; queueing interpretation.

03/07/2019, 15:00 — 16:30 — Room P4.35, Mathematics Building
Martin Evans, Edinburgh University

Phase Diagram (III)

Complex zeros of nonequilibrium partition function; open ASEP phase transitions; continuous and discontinuous transitions; coexistence line.

02/07/2019, 15:00 — 16:30 — Room P4.35, Mathematics Building
Martin Evans, Edinburgh University

Matrix Product Solution (II)

Matrix product ansatz; proof of stationarity; computation of partition function $Z_L$; large $L$ asymptotics of $Z_L$; current and density profile; combinatorial approaches.

01/07/2019, 15:00 — 16:30 — Room P4.35, Mathematics Building
Martin Evans, Edinburgh University

Open Boundary ASEP (I)

The asymmetric simple exclusion process (ASEP) has been studied in probability theory since Spitzer in 1970. Remarkably a version with open boundaries had already been introduced as a model for RNA translation in 1968. This “open ASEP” has since the 1990’s been widely studied in the theoretical physics community as a model of a nonequilibrium system, which sustains a stationary current. In these lectures I will introduce and motivate the model then present a construction — the matrix product ansatz — which yields the exact stationary state for all system sizes. I will derive the phase diagram and analyse the nonequilibrium phase transitions. Finally I will discuss how the approach generalises to multispecies systems.

In this first lecture I will introduce the motivations; correlation functions; mean-field theory and hydrodynamic limit; dynamical mean-field theory; domain wall theory.

28/06/2019, 15:00 — 16:00 — Room P3.31, Mathematics Building
Joe Chen, Colgate University

Random walks, electric networks, moving particle lemma, and hydrodynamic limits

While the title of my talk is a riff on the famous monograph Random walks and electric networks by Doyle and Snell, the contents of my talk are very much inspired by the book. I'll discuss how the concept of electrical resistance can be applied to the analysis of interacting particle systems on a weighted graph. I will start by summarizing the results of Caputo-Liggett-Richthammer, myself, and Hermon-Salez connecting the many-particle stochastic process to the one-particle random walk process on the level of Dirichlet forms. Then I will explain how to use this type of energy inequality to bound the cost of transporting particles by the effective resistance, and to perform coarse-graining on a class of state spaces which are bounded in the resistance metric. This new method plays a crucial role in the proofs of scaling limits of boundary-driven exclusion processes on the Sierpinski gasket.

28/06/2019, 14:00 — 15:00 — Room P3.31, Mathematics Building
Gabriel Nahum, Instituto Superior Técnico

On the algebraic solvability of the MPA approach to the Multispecies SSEP

On this mini-course we will learn how to extend the MPA formulation to the multispecies case with the very simple SSEP dynamics. Due to the jump symmetries of each particle in the bulk, this formulation allows us to compute any phisical quantity without resorting to the matrices representation. Nevertheless, their existence is still a necessary condition for the formulation to work. We will give an example of such matrices and focus on the exploitation of the induced algebra.

27/06/2019, 15:00 — 16:00 — Room P3.31, Mathematics Building
Hugo Tavares, Faculdade de Ciências, Universidade de Lisboa

Least energy solutions of Hamiltonian elliptic systems with Neumann boundary conditions

In this talk, we will discuss existence, regularity, and qualitative properties of solutions to the Hamiltonian elliptic system $$ -\Delta u = |v|^{q-1} v\ \ \ \text{in} \ \Omega,\quad -\Delta v = |u|^{p-1} u\ \ \ \text{in} \ \Omega,\quad \partial_\nu u=\partial_\nu v=0\ \ \ \text{on} \ \partial\Omega,$$with $\Omega\subset \mathbb R^N$ bounded, both in the sublinear $pq< 1$ and superlinear $pq>1$ problems, in the subcritical regime. In balls and annuli, we show that least energy solutions are not radial functions, but only partially symmetric (namely foliated Schwarz symmetric). A key element in the proof is a new $L^t$-norm-preserving transformation, which combines a suitable flipping with a decreasing rearrangement. This combination allows us to treat annular domains, sign-changing functions, and Neumann problems, which are nonstandard settings to use rearrangements and symmetrizations. Our theorems also apply to the scalar associated model, where our approach provides new results as well as alternative proofs of known facts.

27/06/2019, 14:00 — 15:00 — Room P3.31, Mathematics Building
Renato De Paula, Instituto Superior Técnico

Matrix product ansatz for the totally asymmetric exclusion process

Generally, it is very difficult to compute nonequilibrium stationary states of a particle system. It turns out that, in some cases, you can find a solution with a quite interesting structure. The goal of this first part of the seminar is to present the structure of this solution — known as matrix product solution (or matrix product ansatz) — using the totally asymmetric exclusion process (TASEP) as a toy model.

18/06/2019, 13:30 — 14:30 — Room P4.35, Mathematics Building
Pietro Caputo, Università Roma Tre

The spectral gap of the interchange process: a review

Aldous’ spectral gap conjecture asserted that on any graph the random walk process and the interchange process have the same spectral gap. In this talk I will review the work in collaboration with T. M. Liggett and T. Richthammer from 2009, in which we proved the conjecture by means of a recursive strategy. The main idea, inspired by electric network reduction, was to reduce the problem to the proof of a new comparison inequality between certain weighted graphs, which we referred to as the octopus inequality. The proof of the latter inequality is based on suitable closed decompositions of the associated matrices indexed by permutations. I will first survey the problem, with background and consequences of the result, and then discuss the recursive approach based on network reduction together with some sketch of the proof. I will also present a more general, yet unproven conjecture.

17/06/2019, 13:30 — 14:30 — Room P4.35, Mathematics Building
Pietro Caputo, Università Roma Tre

Mixing time of the adjacent walk on the simplex

By viewing the $N$-simplex as the set of positions of $N-1$ ordered particles on the unit interval, the adjacent walk is the continuous time Markov chain obtained by updating independently at rate $1$ the position of each particle with a sample from the uniform distribution over the interval given by the two particles adjacent to it. We determine its spectral gap and mixing time and show that the total variation distance to the uniform distribution displays a cutoff phenomenon. The results are extended to a family of log-concave distributions obtained by replacing the uniform sampling by a symmetric Beta distribution. This is joint work with Cyril Labbe' and Hubert Lacoin.

04/06/2019, 15:00 — 16:00 — Room P3.10, Mathematics Building
Brian Hall, University of Notre Dame

Large-$N$ Segal-Bargmann transform with application to random matrices

I will describe the Segal-Bargmann transform for compact Liegroups, with emphasis on the case of the unitary group $U(N)$. In this case, the transform is a unitary map from the space of $L^2$ functions on $U(N)$ to the space of $L^2$ holomorphic functions on the "complexified" group $\operatorname{GL}(N;\mathbb{C})$. I will then discuss what happens in the limit as $N$ tends to infinity. Finally, I will describe an application to the eigenvalues of random matrices in $\operatorname{GL}(N;\mathbb{C})$. The talk will be self-contained and have lots of pictures.

30/05/2019, 15:00 — 16:00 — Room P3.10, Mathematics Building
Simão Correia, Faculdade de Ciências, Universidade de Lisboa

Critical well-posedness for the modified Korteweg-de Vries equation and self-similar dynamics

We consider the modified Korteweg-de Vries equation over $\mathbb{R}$ $$ u_t + u_{xxx}=\pm(u^3)_x. $$ This equation arises, for example, in the theory of water waves and vortex filaments in fluid dynamics. A particular class of solutions to (mKdV) are those which do not change under scaling transformations, the so-called self-similar solutions. Self-similar solutions blow-up when $t\to 0$ and determine the asymptotic behaviour of the evolution problem at $t=+\infty$. The known local well-posedness results for the (mKdV) fail when one considers critical spaces, where the norm is scaling-invariant. This means that self-similar solutions lie outside of the scope of these results. Consequently, the dynamics of (mKdV) around self-similar solutions are currently unknown. In this talk, we will show existence and uniqueness of solutions to the (mKdV) lying on a critical space which includes both regular and self-similar solutions. Afterwards, we present several results regarding global existence, asymptotic behaviour at $t=+\infty$ and blow-up phenomena at $t=0$. This is joint work with Raphaël Côte and Luis Vega.

28/05/2019, 15:00 — 16:00 — Room P3.10, Mathematics Building
Diogo Arsénio, New York University Abu Dhabi

Recent progress on the mathematical theory of plasmas

The incompressible Navier–Stokes–Maxwell system is a classical model describing the evolution of a plasma (i.e. an electrically conducting fluid). Although small smooth solutions to this system (in the spirit of Fujita–Kato) are known to exist, the existence of large weak solutions (in the spirit of Leray) in the energy space remains unknown. This defect can be attributed to the difficulty of coupling the Navier–Stokes equations with a hyperbolic system. In this talk, we will describe recent results aiming at building solutions to Navier–Stokes–Maxwell systems in large functional spaces. In particular, we will show, for any initial data with finite energy, how a smallness condition on the electromagnetic field alone is sufficient to grant the existence of global solutions.

21/05/2019, 15:00 — 16:00 — Room P3.10, Mathematics Building
Cédric Bernardin, University of Nice Sophia-Antipolis

Microscopic models for multicomponents SPDE’s with a KPZ flavor

The usual KPZ equation is the scaling limit of weakly asymmetric microscopic models with one conserved quantity. In this talk I will present some weakly asymmetric microscopic models with several conserved quantities for which it is possible to derive macroscopic SPDEs with a KPZ flavor.

Joint work with R. Ahmed, T. Funaki, P. Gonçalves, S. Sethuraman and M. Simon.

14/05/2019, 15:00 — 16:00 — Room P3.10, Mathematics Building
Conrado Costa, Leiden University

Random walks in cooling random environments: stable and unstable behaviors under regular diverging cooling maps

Random Walks in Cooling Random Environments (RWCRE), a model introduced by L. Avena, F. den Hollander, is a dynamic version of Random Walk in Random Environment (RWRE) in which the environment is fully resampled along a sequence of deterministic times, called refreshing times. In this talk I will consider effects of the ressampling map on the fluctuations associated with the annealed law and the Large Deviation principle under the quenched measure. I conclude clarifying the paradox of different fluctuations and identical LDP for RWCRE and RWRE. This is a joint work with L. Avena, Y. Chino, and F. den Hollander.

16/04/2019, 15:00 — 16:00 — Room P3.10, Mathematics Building
Phillipo Lappicy, ICMC, Universidade de São Paulo e CAMGSD-IST, Universidade de Lisboa

A nonautonomous Chafee-Infante attractor: a connection matrix approach

The goal of this talk is to present the construction of the global attractor for a genuine nonautonomous variant of the Chafee-Infante parabolic equation in one spatial dimension. In particular, the attractor consists of asymptotic profiles (which correspond to the equilibria in the autonomous counterpart) and heteroclinic solutions between those profiles. We prove the existence of heteroclinic connections between periodic and almost periodic asymptotic profiles, yielding the same connection structure as the well-known Chafee-Infante attractor. This work is still an ongoing project with Alexandre N. Carvalho (ICMC - Universidade de São Paulo).

02/04/2019, 15:00 — 16:00 — Room P3.10, Mathematics Building
Clement Erignoux, Università Roma Tre

Hydrodynamics for a non-ergodic facilitated exclusion process

The Entropy Method introduced by Guo, Papanicolaou and Varadhan (1988) has been used with great sucess to derive the scaling hydrodynamic behavior of wide ranges of conserved lattice gases (CLG). It requires to estimate the entropy of the measure of the studied process w.r.t. some good, usually product measure. In this talk, I will present an exclusion model inspired by a model introduced by Gonçalves, Landim, Toninelli (2008), with a dynamical constraint, where a particle at site $x$ can only jump to $x+\delta$ iff site $x-\delta$ is occupied as well. I will give some insight on the different microscopic and macroscopic situations that can occur for this model, and briefly describe the steps to derive the hydrodynamic limit for this model by adapting the Entropy Method to non-product reference measures. I will also expand on the challenges and question raised by this model and on some of its nice mapping features. Joint work with O. Blondel, M. Sasada, and M. Simon.

26/03/2019, 15:00 — 16:00 — Room P3.10, Mathematics Building
Ofer Busani, University of Bristol

Transversal fluctuations in last passage percolation

In Last Passage Percolation(LPP) we assign i.i.d Exponential weights on the lattice points of the first quadrant of $\mathbb{Z}^2$. We then look for the up-right path going from $(0,0)$ to $(n,n)$ that collects the most weights along the way. One is then often interested in questions regarding (1) the total weight collected along the maximal path, and (2) the behavior of the maximal path. It is known that this path's fluctuations around the diagonal is of order $n^{2/3}$. The proof, however, is only given in the context of integrable probability theory where one relies on some algebraic properties satisfied by the Exponential Distribution. We give a probabilistic proof for this phenomenon where the main novelty is the probabilistic proof for the lower bound. Joint work with Marton Balazs and Timo Seppalainen

19/03/2019, 15:00 — 16:00 — Room P3.10, Mathematics Building
Nicola Vassena, Free University Berlin

Introduction to sensitivity of chemical reaction networks

This talk is an introductory overview of my research topic: Sensitivity of Networks.

We address the following questions: How does a dynamical network respond to perturbations of equilibrium - qualitatively? How does a perturbation of a targeted component spread in the network? What is the sign of the response?

In more detail, we consider general systems of differential equations inspired from chemical reaction networks: $dx/dt = S r(x)$. Here, $x$ might be interpreted as the vector of the concentrations of chemicals, $S$ is the stoichiometric matrix and $r(x)$ is the vector of reaction functions, which we consider as positive given parameters. Abstractly - for a given directed network: the vector $x$ represents the vertices, the matrix $S$ is the incidence matrix and the vector $r(x)$ refers to the directed arrows.

Sensitivity studies the response of equilibrium solutions to perturbations of reaction rate functions, using the network structure as ONLY data. We give here an introduction of the results and techniques developed through this structural approach.

Older session pages: Previous 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 Oldest