|
● Objectives
|
|
The study of random graphs, initiated by Erdos and Renyi in the 1960s, has become one of the most influential areas in modern discrete mathematics. Beyond their mathematical interest,
random graphs provide a unifying framework for analyzing complex structures arising in computer science, statistical physics, number theory and real-world networks.
This course aims to introduce the probabilistic foundations of random graphs and to present key methods and results that highlight their applications across mathematics. The material will be accessible to graduate students with some background in graph theory and probability, but will also emphasize the scientific depth of the subject by showcasing connections to open problems and
current research directions.
|
|
|
|
|
|
|
|
|
|
To see our previous activities click
here
.
|
|
|
|
|
|
|
● Speaker
|
|
• Meysam Miralaei, University of Sao Paulo, Brazil |
|
|
|
|
|
|
|
|
|
● Scientific Director
|
|
• Ramin Javadi, IUT, Iran |
|
● Organizer
|
|
• Ramin Javadi, IUT, Iran |
|
● Local Organizer
|
|
• Saeid Azam, Isfahan University, Iran |
|
|
|
|
|
|
● Important Dates
|
|
• Registration Opening: December 1, 2025 (Azar 10, 1404)
• Registration Deadline: December 10, 2025 (Azar 19, 1404)
|
|
● Contact
|
|
| • Ramin Javadi, | | Email: rjavadi[at]iut[dot]ac[dot]ir | | Address: | | Address |
|
|
|
click on the picture to see a larger version
|
|