Interview: special edition with László Lovász about his work, his life, Paul Erdős, the history of graph theory, and the fact that "in mathematics, 90% of the time you are on the wrong path".

https://vu.nl/en/news/2023/interviews_laszlo_lovasz

We are hiring a #postdoc for 2 years at Sciences Po in Paris to work on modeling and inference of multi-dimensional political opinions from social media behavioral traces, interpretability of recommendations on social media, and opinion dynamics. The lab develops several projects about social media and politics, and welcomes research agendas that candidates might bring.

The postdoc is to be hosted at the médialab at Sciences Po, but to work in collaboration with researchers at the French National Research Center’s (CNRS) Complex Systems Institute of Paris. The postdoc will also collaborate with CIVICA’s European Polarisation Observatory (a Sciences Po, Bocconi, CEU, and LSE initiative) and with the McCourt Institute, a policy for tech center hosted at Sciences Po, Georgetown, and Stanford. The team also conducts social media data collection operations in more than 50 countries, and, through CNRS, has access to HPC resources. Working conditions are competitive for Paris, including competitive salary, commuting, restaurant vouchers, health insurance, hybrid remote/in-person working, and a 45 work-day paid leave per year. Details in the link:

https://medialab.sciencespo.fr/actu/hiring-postdoctoral-researcher-for-ai-pm-project/

#PhD Student in Neuroscience (Ala-Laurila Lab, Finland)

We are looking for an excellent PhD Candidate to work in characterization of healthy and diseased mouse models from retinal circuits to visually guided behaviour

https://aalto.wd3.myworkdayjobs.com/aalto/job/Otaniemi-Espoo-Finland/PhD-Student-in-Neuroscience_R34079

The 70 years old Metropolis(-Hastings) algorithm appeared in what is perhaps one of the first computational physics articles ever written. Its behind-the-paper story is surprising in many ways; https://www.nature.com/articles/s42254-023-00608-w

#Postdoc position opening in Lyon, France (2 years), to work with me on network science, dynamic networks, link streams, etc. The exact topic is negotiable, feel free to contact me if you are interested!
More Details: http://cazabetremy.fr/resources/Stablenet-postdoc%20position.pdf

A Practical Guide to Writing an NSF Grant Proposal

https://www.ams.org/journals/notices/202307/noti2729/noti2729.html

20+h of free lectures on computational Bayes & causal inference.

https://youtube.com/playlist?list=PLDcUM9US4XdPz-KxHM4XHt7uUVGWWVSus

We are looking for an enthusiastic and motivated candidate from the fields of computational biology, systems biology, computational physics, mathematics, engineering, and similar for a #PhD position in the research project "Development of mechanistic mathematical models for the study of microbiome-associated immune responses along the gut-lung axis".
Forwarding this advertisement to potential candidates would be appreciated.

https://www.linkedin.com/jobs/view/3670103847

#PhD Apply by 25th August 2023!

https://www.ssmeridionale.it/en-us/dottorato/rubriche/modeling-and-engineering-risk-and-complexity-merc-3123-1-017870059a030b9af70ed6080d930af0

Symmetry Breaking and Magnetism - Prof Stephen Blundell - OUPS Lecture

https://youtu.be/1cYAL0RT3zw

In this Oxford University Physics Society talk, Professor Stephen Blundell unpicks what it means for something to be symmetric and shows how symmetry - and broken symmetry - in quantum physics leads to magnetism and more.

Let us hear your voice 📢

For this year's warm-up🔥 of the CCS2023 Brazil, we want to give you the occasion to shape the event because, after all, the event is for you guys!

So here's an *actually* short form to share your ideas 💭

https://docs.google.com/forms/d/e/1FAIpQLSdqa2z7IFKS2EpELB8eTEABVx1hxQEi8-gOnfYPIW_jUu8UBQ/viewform?pli=1

پویایی‌های تکاملی زیست‌محیطی در جوامع میکروبی و آنچه می.توانیم از یک مدل مبتنی بر تعامل بیاموزیم

فرنوش فرح‌پور

سه‌شنبه ۱۰ مرداد
ساعت ۱۱:۰۰

لینک شرکت در جلسه :

https://meet.google.com/grg-pghp-gdh

🕸 مرکز شبکه‌های پیچیده و علم داده اجتماعی دانشگاه شهید بهشتی

🕸 @CCNSD       🔗 ccnsd.ir
—————————————

Apply for SFI's Complexity Global School for Emerging Political Economies
December 4th - December 15th, 2023
WANTED: BRAVE THINKERS WILLING TO EXPLORE NEW IDEAS ABOUT ECONOMICS, POLICY, AND GOVERNANCE. EARLY CAREER CHANGE-MAKERS FROM CIVIL SOCIETY AND EARLY CAREER SCHOLARS ARE EQUALLY ENCOURAGED TO APPLY.
Who: The Complexity Global School (CGS) is a collaboration between the Indian Institute of Technology Bombay (IITB) in India, the Santa Fe Institute (SFI) in the USA, and the University of the Witwatersrand (Wits) in South Africa.
Why: The world is changing. The political and economic paradigms that dominated global affairs in the 20th Century were largely based on linear thinking, and often originated from within disciplinary and cultural silos. The challenges now facing humanity require new ideas and a global perspective.
What: The 2023 Complexity Global School for Emerging Political Economies is an intense, 12-day program that provides exposure to the newest complex methods, models, and frameworks for thinking about economics and governance and the opportunity to collaborate on a group project. There will be 60 students in total: 30 students from across Asia, who will attend at the IITB location, and 30 students from across Africa, who will attend at the Wits location.
Cost: This program is completely free for all admitted students. All students will receive a fellowship covering the full costs of room, board, instruction, and materials. Participating students will also receive a stipend to cover the costs of incidentals while they attend the school. Students who are not based in either Mumbai, India or Johannesburg, South Africa will be awarded an additional separate travel stipend.
Deadline: August 20, 2023
Learn more and apply now!
Questions? Contact complexityglobal@santafe.edu

Are you a scientist ready to ride the 3rd wave of #AI? Excited by the potential impacts that #XAI is poised to make in #chemistry and #drugdiscovery?
We have 14 open #PhD positions within the AiChemist Project: https://aichemist.eu/openpositions. Apply now!

#PhD position
I’m seeking a candidate to work on Dynamics of Cooperation and Reciprocity in Human-AI Hybrid Populations!

https://vacatures.uva.nl/UvA/job/ELLIS-PhD-Position-on-Dynamics-of-Cooperation-and-Reciprocity-in-Human-AI-Hybrid-Populations/775544802/

گشت و گذاری در علم شبکه
عباس ریزی - سخنرانی آنلاین دانشگاه تهران
sitpor.org/complex-networks-a-survey


قسمت اول: پیچیدگی و تحول انگاره
در این قسمت ابتدا به سراغ انگاره پیچیدگی می‌رویم و پیرامون تحول انگاره در فیزیک در دهه‌های گذشته صحبت می‌کنیم. نشان می‌دهیم که فیزیک آماری در گذار از ریزمقیاس به بزرگ‌مقیاس با چه چالش‌هایی روبه‌رو بوده. سپس به دنبال توجیه رفتارهای جمعی در سیستم‌های فیزیکی و زیستی به اهمیت برهمکنش‌های نابدیهی و شبکه‌های پیچیده می‌رسیم.
🎞 ویدیو در یوتیوب
🎧 فایل صوتی


قسمت دوم: مقدمه‌ای بر شبکه‌های پیچیده
در ادامه قسمت قبل، به دنبال توجیه رفتارهای جمعی در سیستم‌های فیزیکی و زیستی به اهمیت برهمکنش‌های نابدیهی و شبکه‌های پیچیده می‌رسیم و به ویژگی‌‌های این شبکه‌ها و پدیده‌های دینامیکی روی آن‌ها می‌پردازیم. سرانجام در مورد مدل‌سازی‌های انتشار ویروس کرونا صحبت خواهیم کرد!
🎞 ویدیو در یوتیوب
🎧 فایل صوتی

در مورد پیچیدگی بیشتر ببینید: complexity.sitpor.org
----------------------------------------------
@sitpor | sitpor.org
instagram.com/sitpor_media

Do you have a MSc degree in physics and a strong interest in pursuing a #PhD in soft matter physics? Have a look at this doctoral researcher position in

https://www.aalto.fi/en/open-positions/doctoral-researcher-for-experiments-in-swimming-and-swarming-dynamics-of-living-organisms

An introduction to graph theory
Darij Grinberg
https://arxiv.org/abs/2308.04512

This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and arborescences. Among the features discussed are Eulerian circuits, Hamiltonian cycles, spanning trees, the matrix-tree and BEST theorems, proper colorings, Turan's theorem, bipartite matching and the Menger and Gallai--Milgram theorems. The basics of network flows are introduced in order to prove Hall's marriage theorem.
Around a hundred exercises are included (without solutions).