Complex Systems Studies
2.4K subscribers
1.55K photos
125 videos
118 files
4.57K links
What's up in Complexity Science?!
Check out here:

@ComplexSys

#complexity #complex_systems #networks #network_science

📨 Contact us: @carimi
Download Telegram
3rd European Summer Program in Infectious Disease Analysis and Modelling (ESPIDAM)

Time: June 22-26, 2026
Location: Stockholm University, Sweden
Registration: Is now open. Early bird registration to March 31. Registration closes May 31.
Suitable participants: PhD students, PostDocs, Public Health scientists and others interested
Structure: The summer program consists of 8 course modules, 4 the first half week and 4 the second half week. Participants can register to one or two modules.
More information: www.su.se/math/espidam
Stochastic_processes_and_statistical_methods_in_mathematical_biology.pdf
85.6 KB
#PhD student in Mathematical Statistics

https://su.varbi.com/en/what:job/jobID:911059/type:job/where:4/apply:1

The Department of Mathematics of Stockholm University is hiring a PhD student to work on stochastic processes and/or statistical methods in mathematical biology
Message passing and cyclicity transition

Message passing, also known as belief propagation, is a versatile framework for analyzing models defined on graphs. Its most prototypical application is percolation; yet, the interpretation of the message passing formulation of percolation remains elusive. We show that the message passing solutions commonly associated with the probability of belonging to the giant component actually identify reachability from cycles. This interpretation generally applies to bond and site percolation on any directed or undirected networks. Our findings highlight the distinction between transition in cyclicity and the emergence of the giant component.

https://arxiv.org/abs/2604.01201
Theoretical computer science notes from Epsilon Camp for exceptional 11- and 12-year-olds
by Scott Aaronson
https://www.scottaaronson.com/tcs.pdf

Lecture 1: Bits
Lecture 2: Gates
Lecture 3: Finite Automata
Lecture 4: Turing Machines
Lecture 5: Big Numbers
Lecture 6: Complexity, or Number of Operations
Lecture 7: Polynomial vs. Exponential
Lecture 8: The P vs. NP Problem
Lecture 9: NP-completeness
Lecture 10: Foundations of Cryptography
Lecture 11: Public-Key Cryptography and Quantum Computing