When looking at the dynamics of complex networks, not all links are the same. In C/C++ software projects, we can classify source code dependencies as endogenous (intra) or exogenous (inter) links according to fluctuations in development activity.
https://t.co/LHZwq8A9Az
https://t.co/LHZwq8A9Az
🎬 Nonequilibrium Statistical Mechanics by Prof. V. Balakrishnan, Department of Physics, IIT Madras.
For more details on NPTEL visit http //nptel.ac.in
https://www.youtube.com/playlist?list=PLbMVogVj5nJQqNx0ElSk3Ip04Ofg7B22W
For more details on NPTEL visit http //nptel.ac.in
https://www.youtube.com/playlist?list=PLbMVogVj5nJQqNx0ElSk3Ip04Ofg7B22W
YouTube
Physics - Nonequilibrium Statistical Mechanics
Share your videos with friends, family, and the world
🔹 Restricted Boltzmann machines in quantum physics | Perspective by Roger G. Melko, Giuseppe Carleo, Juan Carrasquilla & J. Ignacio Cirac
https://t.co/eIxz7dmwBj
https://t.co/eIxz7dmwBj
Hierarchical cluster analysis on famous data sets - enhanced with the dendextend package
https://cran.r-project.org/web/packages/dendextend/vignettes/Cluster_Analysis.html
https://cran.r-project.org/web/packages/dendextend/vignettes/Cluster_Analysis.html
cran.r-project.org
Hierarchical cluster analysis on famous data sets - enhanced with the dendextend package
Complex Systems Studies
https://en.wikipedia.org/wiki/Swendsen%E2%80%93Wang_algorithm
image_2019-06-25_19-56-05.png
784.4 KB
[4] R. H. Swendsen and J.-S. Wang. Nonuniversal critical dynamics in monte carlo simulations. Phys. Rev. Lett., 58:86–88, 1987.
[5] U. Wolff. Collective monte carlo updating for spin systems. Phys. Rev. Lett., 62:361,1989.
[5] U. Wolff. Collective monte carlo updating for spin systems. Phys. Rev. Lett., 62:361,1989.
🔖 Cluster Monte Carlo algorithms
Werner Krauth
In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable algorithmic freedom given by the detailed balance condition. Cluster algorithms appear, among other systems, in classical spin models, such as the Ising model, in lattice quantum models (bosons, quantum spins and related systems) and in hard spheres and other `entropic' systems for which the configurational energy is either zero or infinite. In this chapter, we discuss the basic idea of cluster algorithms with special emphasis on the pivot cluster method for hard spheres and related systems, for which several recent applications are presented.We provide less technical detail but more context than in the original papers.
🔗 https://arxiv.org/pdf/cond-mat/0311623v1
Werner Krauth
In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable algorithmic freedom given by the detailed balance condition. Cluster algorithms appear, among other systems, in classical spin models, such as the Ising model, in lattice quantum models (bosons, quantum spins and related systems) and in hard spheres and other `entropic' systems for which the configurational energy is either zero or infinite. In this chapter, we discuss the basic idea of cluster algorithms with special emphasis on the pivot cluster method for hard spheres and related systems, for which several recent applications are presented.We provide less technical detail but more context than in the original papers.
🔗 https://arxiv.org/pdf/cond-mat/0311623v1
〽️ ICTP-ICTS Winter School on Quantitative Systems Biology 2019
🌐 http://indico.ictp.it/event/8736/
🆔 @ComplexSys
🌐 http://indico.ictp.it/event/8736/
🆔 @ComplexSys
💵 PhD Position "Swiss Parliamentary Networks" (100%)
We are currently looking for a PhD candidate working in the project “Analyzing Co-Sponsorship Networks from 127 Years of the Swiss Federal Assembly”, starting as soon as possible or by agreement. The project aims at gaining a deeper understanding of legislative collaboration networks using a data-driven approach. The applicant will work on a newly compiled data set, which comprises of speeches given by members of parliament and information on collaboration networks from 1891 until today. Successful applicants should have a strong academic background in data sciences with an interest in political science. Since the project entails working with German texts, only PhD candidates with excellent German skills are considered.
The successful candidate has graduated from a university and has received a MSc degree (or equivalent) in physics, computer science, or related field, with proven interest in social sciences and interdisciplinary research. Alternatively, he/she has received a MA degree in political science (or sociology) with proven technical skills in data management and quantitative methods. Furthermore, good programming skills in scientific computing languages like Python or R are necessary, knowledge of natural language processing (NLP) tools is a plus.
The candidate should be interested in becoming acquainted with the workings of the Swiss parliament and should have strong abilities to communicate in an interdisciplinary scientific environment. Fluency in German and English is a must, French or Italian language skills are of advantage but are not mandatory.
https://apply.refline.ch/845721/7003/pub/13/index.html
We are currently looking for a PhD candidate working in the project “Analyzing Co-Sponsorship Networks from 127 Years of the Swiss Federal Assembly”, starting as soon as possible or by agreement. The project aims at gaining a deeper understanding of legislative collaboration networks using a data-driven approach. The applicant will work on a newly compiled data set, which comprises of speeches given by members of parliament and information on collaboration networks from 1891 until today. Successful applicants should have a strong academic background in data sciences with an interest in political science. Since the project entails working with German texts, only PhD candidates with excellent German skills are considered.
The successful candidate has graduated from a university and has received a MSc degree (or equivalent) in physics, computer science, or related field, with proven interest in social sciences and interdisciplinary research. Alternatively, he/she has received a MA degree in political science (or sociology) with proven technical skills in data management and quantitative methods. Furthermore, good programming skills in scientific computing languages like Python or R are necessary, knowledge of natural language processing (NLP) tools is a plus.
The candidate should be interested in becoming acquainted with the workings of the Swiss parliament and should have strong abilities to communicate in an interdisciplinary scientific environment. Fluency in German and English is a must, French or Italian language skills are of advantage but are not mandatory.
https://apply.refline.ch/845721/7003/pub/13/index.html
Forwarded from انجمن علمی دانشکده ریاضی و علوم کامپیوتر
🔹سمینار ۲روزه آمار (با رویکرد علومداده|DataScience)
🗓دوشنبه و سهشنبه مورخ ۱۰ و ۱۱ تیرماه ۹۸
⏰از ساعت ۱۳:۳۰ الی ۱۵:۳۰ و ۱۶ الی ۱۸
🏛دانشگاه صنعتی امیرکبیر، سالن آمفیتئاتر مرکزی بهمن
✳️لینک ثبتنام:
evnd.co/9jiaH
❓در صورت هرگونه مشکل یا سوال به آیدی زیر پیام دهید
@amirali_kbl
🗓دوشنبه و سهشنبه مورخ ۱۰ و ۱۱ تیرماه ۹۸
⏰از ساعت ۱۳:۳۰ الی ۱۵:۳۰ و ۱۶ الی ۱۸
🏛دانشگاه صنعتی امیرکبیر، سالن آمفیتئاتر مرکزی بهمن
✳️لینک ثبتنام:
evnd.co/9jiaH
❓در صورت هرگونه مشکل یا سوال به آیدی زیر پیام دهید
@amirali_kbl
🚨 What is Complexity Science?
This new site just went online:
🔗 https://complexityexplained.github.io/
Great source for everyone interest in #complexity.
#ComplexityExplained
This new site just went online:
🔗 https://complexityexplained.github.io/
Great source for everyone interest in #complexity.
#ComplexityExplained
complexityexplained.github.io
Complexity Explained
Forwarded from Complex Networks (SBU)
#سمینارهای_هفتگی
«حالتهای شبه پایدار در فیزیک و کاربرد آن در اقتصاد»
🗣 محمد بهرامی - دانشگاه شهید بهشتی
⏰ دوشنبه، ۱۰ تیر - ساعت ۱۶:۰۰
🏛 محل برگزاری: سالن ابنهیثم
~~~~~~~~~~~~~~~~
⭕️ مشتاق دیدار همه اقشار جامعه در مرکز هستیم. برای هماهنگی با مسئول جلسه میتوانید با آقای محمد شرافتی تماس بگیرید:
📞 @herman1
—————————————
🕸 مرکز شبکههای پیچیده و علم داده اجتماعی دانشگاه شهید بهشتی
🕸 @CCNSD 🔗 ccnsd.ir
—————————————
«حالتهای شبه پایدار در فیزیک و کاربرد آن در اقتصاد»
🗣 محمد بهرامی - دانشگاه شهید بهشتی
⏰ دوشنبه، ۱۰ تیر - ساعت ۱۶:۰۰
🏛 محل برگزاری: سالن ابنهیثم
~~~~~~~~~~~~~~~~
⭕️ مشتاق دیدار همه اقشار جامعه در مرکز هستیم. برای هماهنگی با مسئول جلسه میتوانید با آقای محمد شرافتی تماس بگیرید:
📞 @herman1
—————————————
🕸 مرکز شبکههای پیچیده و علم داده اجتماعی دانشگاه شهید بهشتی
🕸 @CCNSD 🔗 ccnsd.ir
—————————————
Deep Learning from the Foundations course is here!!! 15 hours of videos, Jupyter notebooks, all free. Covers foundations of deep learning, state of the art research, & software engineering best practices. All new material! https://t.co/Nar3Uspqii
🎞 Statistical Mechanics (PSI 13/14, Core, PHYS 602) - Anton Burkov (University of Waterloo)
https://www.youtube.com/playlist?list=PLFMKfDJ8QzbNzBPtYEQiOdjZjvA29_Orm
Lecture 1 Introduction to phase transitions, the Ising model, Mean Field Theory (MFT)
Lecture 2 Critical exponents α, β, γ, δ out of MFT, Hubbard-Stratonovich Transformation
Lecture 3 Spin-spin correlation function; calculation in the functional integral formalism and in MFT
Lecture 4 Calculation of the correlation function in the MFT through Fourier transform; Fluctuations
Lecture 5 Corrections in Cv from fluctuations, Ginzburg criterion, Landau-Ginzburg theory
Lecture 6 Wilsonian RG: fast and slow modes
Lecture 7 Calculation of the first cumulant; the Gaussian fixed point; Feynman diagrams
Lecture 8 Calculation of the 2nd cumulant; Wilson-Fisher fixed point; linearized flow around the Gaussian fixed point
Lecture 9 Linearized flow around fixed points; calculation of critical exponents from RG
Lecture 10 Mermin-Wagner theorem, lower critical dimension
Lecture 11 Results of 2+ε expansion; Topological order in d=2
Lecture 12 Electrostatic analogy, Duality transformation of the XY model
Lecture 13 & 14 Renormalization Group (RG) for the sine-Gordon model
https://www.youtube.com/playlist?list=PLFMKfDJ8QzbNzBPtYEQiOdjZjvA29_Orm
Lecture 1 Introduction to phase transitions, the Ising model, Mean Field Theory (MFT)
Lecture 2 Critical exponents α, β, γ, δ out of MFT, Hubbard-Stratonovich Transformation
Lecture 3 Spin-spin correlation function; calculation in the functional integral formalism and in MFT
Lecture 4 Calculation of the correlation function in the MFT through Fourier transform; Fluctuations
Lecture 5 Corrections in Cv from fluctuations, Ginzburg criterion, Landau-Ginzburg theory
Lecture 6 Wilsonian RG: fast and slow modes
Lecture 7 Calculation of the first cumulant; the Gaussian fixed point; Feynman diagrams
Lecture 8 Calculation of the 2nd cumulant; Wilson-Fisher fixed point; linearized flow around the Gaussian fixed point
Lecture 9 Linearized flow around fixed points; calculation of critical exponents from RG
Lecture 10 Mermin-Wagner theorem, lower critical dimension
Lecture 11 Results of 2+ε expansion; Topological order in d=2
Lecture 12 Electrostatic analogy, Duality transformation of the XY model
Lecture 13 & 14 Renormalization Group (RG) for the sine-Gordon model
YouTube
- YouTube
Complex Systems Studies
🎞 Statistical Mechanics (PSI 13/14, Core, PHYS 602) - Anton Burkov (University of Waterloo) https://www.youtube.com/playlist?list=PLFMKfDJ8QzbNzBPtYEQiOdjZjvA29_Orm Lecture 1 Introduction to phase transitions, the Ising model, Mean Field Theory (MFT) Lecture…
این آقای بورکُف(اگر درست خوانده باشم) چند کار مهم در زمینهی فرمیونهای وایل
(Weyl fermions)
کرده است.
(Weyl fermions)
کرده است.
Complex Systems Studies
https://www.nature.com/articles/s41567-019-0545-1
این مقاله یک مرور خیلی کلی روی استفاده از شبکههای عصبی به عنوان یک تابع موج برای حالت پایه و حتی برخی حالات برانگیختهی یک سیستم کوانتومی میکنه. نویسندهی اول، راجر مِلکو است که خودش جزو اولینها در استفاده از این روش است.
توضیحات مقاله خیلی کلی است، اما به نظرم لیست مراجع ارزشمندی داره.
توجه کنید که به دو روش(تا جایی که من میدونم) میشه از هوش مصنوعی استفاده کرد(اینجا به هر دو اشاره میشه):
توضیحات مقاله خیلی کلی است، اما به نظرم لیست مراجع ارزشمندی داره.
توجه کنید که به دو روش(تا جایی که من میدونم) میشه از هوش مصنوعی استفاده کرد(اینجا به هر دو اشاره میشه):
Complex Systems Studies
این مقاله یک مرور خیلی کلی روی استفاده از شبکههای عصبی به عنوان یک تابع موج برای حالت پایه و حتی برخی حالات برانگیختهی یک سیستم کوانتومی میکنه. نویسندهی اول، راجر مِلکو است که خودش جزو اولینها در استفاده از این روش است. توضیحات مقاله خیلی کلی است،…
راه اول این است که شما شبکه را با تصاویری از فازها در حالات حدی تغذیه میکنید و بعد سعی میکنید گذار فاز رو با استفاده از شبکه پیدا کنید. مثلن به نحوی از تابع همبستگی یک تصویر میسازید، و این را به شبکه میدهید.
راه دوم استفاده، روش وردشی و استفاده از شبکه برای نمایش تابع موج سیستم بسذرهای است. این میشود شبیه به کاری که با
Matrix Product States
میکنیم. به ارتباط بین این دونمایش هم تو این مقاله اشاره شده.
راه دوم استفاده، روش وردشی و استفاده از شبکه برای نمایش تابع موج سیستم بسذرهای است. این میشود شبیه به کاری که با
Matrix Product States
میکنیم. به ارتباط بین این دونمایش هم تو این مقاله اشاره شده.