February 2024 - NumPI - Mailing list — Dipartimento di Matematica, UniPI

seminar by Puya Latafat on Tue 27
by Giancarlo Bigi 26 Feb '24

26 Feb '24

You are very welcome to attend the seminar below Best wishes Giancarlo ============ _/Time/_: Tuesday 27 February, 11:00 am _/Place/_: Sala Seminari Est, Dipartimento di Informatica /_Speaker_/: Puya Latafat, KU Leuven /_Title_: / Convergence of operator splitting methods for nonmonotone inclusions /_Abstract_/ Despite their popularity, convergence results of splitting methods have been largely limited to the convex/monotone setting. We present convergence results for several first-order methods, including the proximal point method, forward-backward-forward splitting, and Douglas-Rachford splitting, within a nonmonotone setting. To this end, we focus on a problem class characterized by an oblique weak Minty condition, which captures non-trivial structures as we demonstrate with examples. Moreover, we introduce the concept of semimonotonicity and provide sufficient conditions for the global convergence of splitting techniques for the sum of two semimonotone operators. Illustrative examples demonstrate the wide range of problems our theory is able to cover.

1 1

26/02/2024 - Seminario CN1-SPOKE 10 (Quantum Computing)
by Paola Boito 23 Feb '24

23 Feb '24

Dear all, I am forwarding this seminar announcement on quantum computing, which may be of interest to some of you. Best regards, Paola Boito ============================================================================== Dear All, As part of the CN1-SPOKE 10 on Quantum Computing, we are organizing a* weekly* seminar series. This week’s seminar is: Title: *Quantum Software Engineering* Speakers: *Giuseppe Bisicchia and Antonio Brogi * Venue:* Sala Gerace, Dipartimento di Informatica* Time:* Monday, 26/02/2024, 17:00 * Everyone is welcome! ==============================================================================

1 0

[Indico] Dr Stefano Pozza, How to express the solution of an ODE as a linear system (in a suitable algebra) and exploit it for fast computation., 13/02/2024, 15:00 Europe/Rome
by fabio.durastante＠unipi.it 12 Feb '24

12 Feb '24

Title: How to express the solution of an ODE as a linear system (in a suitable algebra) and exploit it for fast computation., Speaker(s): Dr Stefano Pozza, Charles University, Date and time: 13 Feb 2024, 15:00 (Europe/Rome), Lecture series: Seminar on Numerical Analysis, Venue: Scuola Normale Superiore (Aula Mancini). Address: P.za dei Cavalieri, 7, 56126 Pisa PI You can access the full event here: https://events.dm.unipi.it/e/254 -- Indico :: Email Notifier https://events.dm.unipi.it/e/254

1 0

[Indico] Prof. Dario Fasino, Is there a Kemeny’s constant for second-order random walks?, 06/02/2024, 10:00 Europe/Rome
by fabio.durastante＠unipi.it 05 Feb '24

05 Feb '24

Title: Is there a Kemeny’s constant for second-order random walks?, Speaker(s): Prof. Dario Fasino, Università di Udine, Date and time: 6 Feb 2024, 10:00 (Europe/Rome), Lecture series: Seminar on Numerical Analysis, Venue: Dipartimento di Matematica (Aula Magna). Address: Largo Bruno Pontecorvo, 5 – 56127 Pisa You can access the full event here: https://events.dm.unipi.it/e/258 Abstract -------- Kemeny's constant is a measure of the navigability of a network by ordinary random walks, which appears in a famous result on Markov chains known as the Random Target Lemma. A second-order random walk is a random walk where the transition probabilities depend on two past states. It can be turned into a Markov chain by lifting the state space from the nodes to the directed edges of the graph. The corresponding Kemeny constant is well known but says very little about the second-order walk on the original network. We extend certain definitions and results on standard random walk's mean hitting and return times to the second-order case and provide simple formulas that allow us to compute these numbers by solving suitable systems of linear equations. New results show that there is an infinite family of graphs for which certain second-order random walks, including the best-known non-backtracking random walk, satisfy a precise second-order counterpart of the Random Target Lemma. So, in summary, the answer to the question in the title is: Yes, sometimes. -- Indico :: Email Notifier https://events.dm.unipi.it/e/258

1 0

[Indico] Prof. Dario Fasino, Is there a Kemeny’s constant for second-order random walks?, 2/6/24, 10:00 AM Europe/Rome
by fabio.durastante＠unipi.it 02 Feb '24

02 Feb '24

Title: Is there a Kemeny’s constant for second-order random walks?, Speaker(s): Prof. Dario Fasino, Università di Udine, Date and time: Feb 6, 2024, 10:00 AM (Europe/Rome), Lecture series: Seminar on Numerical Analysis, Venue: Dipartimento di Matematica (Aula Magna). Address: Largo Bruno Pontecorvo, 5 – 56127 Pisa You can access the full event here: https://events.dm.unipi.it/e/258 Abstract -------- Kemeny's constant is a measure of the navigability of a network by ordinary random walks, which appears in a famous result on Markov chains known as the Random Target Lemma. A second-order random walk is a random walk where the transition probabilities depend on two past states. It can be turned into a Markov chain by lifting the state space from the nodes to the directed edges of the graph. The corresponding Kemeny constant is well known but says very little about the second-order walk on the original network. We extend certain definitions and results on standard random walk's mean hitting and return times to the second-order case and provide simple formulas that allow us to compute these numbers by solving suitable systems of linear equations. New results show that there is an infinite family of graphs for which certain second-order random walks, including the best-known non-backtracking random walk, satisfy a precise second-order counterpart of the Random Target Lemma. So, in summary, the answer to the question in the title is: Yes, sometimes. -- Indico :: Email Notifier https://events.dm.unipi.it/e/258

1 0