3/31/2017 Courses|CenterforNetworkScience

Courses

AGENT BASED MODELS (/COURSES/AGENT-BASED-MODELS)

Course code: CNSC 6001Course DescriptionComplex systems are abundant: The society, the
economy, the nancial system, food webs, energy supply systems are just some examples. The
recent development of information technology opened unprecedented opportunities in studying
them. On the one hand due to making available...
Instructor: Rosario N. Mantegna (https://people.ceu.edu/node/1449), Jnos Trk
Credits: 2.0

COMBINATORIAL OPTIMIZATION (/COURSES/COMBINATORIAL-OPTIMIZATION)

Basic concepts and theorems are presented. Some signicant applications are analyzed to illustrate
the power and the use of combinatorial optimization. Special attention is paid to algorithmic
questions.The goals of the course:One of the main goals of the course is to introduce students to the
most important results...
Instructor: Ervin Gyri (https://people.ceu.edu/node/1710)
Credits: 3.0

DATA AND NETWORK VISUALIZATION (/COURSES/DATA-AND-NETWORK-VISUALIZATION)

Course syllabusThe Internet and modern computers have given us vast amounts of data, so it is
more important than ever to understand and analyze these data. A picture is worth a thousand
words, so visualizations, from scientic plots and infographics to interactive data explorers, are
crucial to summarize and...
Instructor: Roberta Sinatra (https://people.ceu.edu/node/2156)
Credits: 2.0

DATA MINING AND BIG DATA ANALYTICS (/COURSES/DATA-MINING-AND-BIG-DATA-

ANALYTICS)
Course code: CNSC 6006Course Instructor: Prof. Roberta Sinatra, sinatrar@ceu.eduOce: N11
609Oce hours: TBA or by appointmentIMPORTANT: During the rst class, we will hand out a test to
check the prerequisites among the students. Those that do not reach the minimum threshold will not
be able to take the course,...
Instructor: Roberta Sinatra (https://people.ceu.edu/node/2156)
Credits: 2.0
https://cns.ceu.edu/courses 1/7
3/31/2017 Courses|CenterforNetworkScience

ECONOMIC AND SOCIAL NETWORKS (/COURSES/ECONOMIC-AND-SOCIAL-NETWORKS)

ECONOMIC AND SOCIAL NETWORKS SYLLABUSFull description:Social networks aect many
economic transactions. They transmit information about job opportunities, aect the trade of goods
and services, inuence how diseases spread, which products we buy, how we vote, whether we
become criminals, which technologies we...
Instructor: Adam Szeidl (https://people.ceu.edu/node/1253)
Credits: 2.0

ECONOMIC NETWORKS (/COURSES/ECONOMIC-NETWORKS)

This course presents network concepts from the two distinct perspectives of economics and network
science. It will provide a background covering both economics modeling of networks and network
science modeling of economic systems. The course presents problems where network aspects are
instrumental to achieve a better...
Instructor: Rosario N. Mantegna (https://people.ceu.edu/node/1449)
Credits: 2.0

EMPIRICAL FINANCE (/COURSES/EMPIRICAL-FINANCE)

EMPIRICAL FINANCE SYLLABUSLevel:DoctoralCourse Status:ElectiveFull description:Background
and overall aim of the course.This course aims to describe the process of price formation of a
nancial asset starting from the analysis of the empirical regularities (often called as "stylized facts")
observed in the time...
Instructor: Rosario N. Mantegna (https://people.ceu.edu/node/1449)
Credits: 2.0

FUNDAMENTAL IDEAS IN NETWORK SCIENCE (/COURSES/FUNDAMENTAL-IDEAS-NETWORK-

SCIENCE)
Course code: CNSC 6000Level:DoctoralCourse Status:MandatoryBackground and overall aim of the
course:Networks are ubiquitous. Economic trade, social relationships, terrorist organizations or
biochemical reactions all span networks. Network science has gone through a spectacular
development during the last decade....
Instructor: Jnos Kertsz (https://people.ceu.edu/node/1403)
Credits: 4.0

GRAPH THEORY (/COURSES/GRAPH-THEORY)

TOPICS IN COMBINATORICS SYLLABUSLevel:DoctoralCourse Status:ElectiveFull description:Brief
introduction to the course:More advanced concepts, methods and results of combinatorics and

https://cns.ceu.edu/courses 2/7
3/31/2017 Courses|CenterforNetworkScience

graph theory. Main topics: (linear) algebraic, probabilistic methods in discrete mathematics; relation
of graphs and hypergraphs;...
Instructor: Ervin Gyri (http://people.ceu.hu/node/1710)
Credits: 3.0

MATHEMATICAL STATISTICS (/COURSES/MATHEMATICAL-STATISTICS)

Brief introduction to the course:While probability theory describes random phenomena,
mathematical statistics teaches us how to behave in the face of uncertainties, according to the
famous mathematician Abraham Wald. Roughly speaking, we will learn strategies of treating
randomness in everyday life. Taking this course...
Instructor: Marianna Bolla
Credits: 3.0

NETWORK SCIENCE AND APPLICATIONS (/COURSES/NETWORK-SCIENCE-AND-

APPLICATIONS)
Level:DoctoralCourse Status:ElectiveFull descriptionBackground and overall aim of the
courseIntroduces network science and the set of tools used to understand complex networks
emerging in social and economic systems. Focuses on the empirical study of real networks, with
examples from computer science (World Wide...
Instructor: Albert - Lszl Barabsi (https://people.ceu.edu/node/1985)
Credits: 1.0

NETWORKS AND COMPUTERS (/COURSES/NETWORKS-AND-COMPUTERS)

Course code:CNSC 6008Level:DoctoralCourse Status:ElectiveCourse Instructor: Prof. Roberta
Sinatra, sinatrar@ceu.eduOce (temporary): N11 609Oce hours: TBA or by appointmentBrief
introduction to the courseNetwork science is fundamentally a computational science. This course will
provide algorithms and tools to...
Instructor: Roberta Sinatra (https://people.ceu.edu/node/2156)
Credits: 3.0

RANDOM GRAPH AND NETWORK SIMULATIONS (/COURSES/RANDOM-GRAPH-AND-

NETWORK-SIMULATIONS)
RANDOM GRAPHS AND NETWORK SIMULATIONS SYLLABUSLevel:DoctoralCourse Status: ElectiveFull
description:Background and overall aim of the course:The success of the new science of networks is
partly due to the realization of universal features in a wide range of applications, but also due to
very successful simple...
Instructor: Jnos Kertsz (http://cns.ceu.edu/node/10)
Credits: 2.0

https://cns.ceu.edu/courses 3/7
3/31/2017 Courses|CenterforNetworkScience

SCIENTIFIC PYTHON (/COURSES/SCIENTIFIC-PYTHON)

Level:DoctoralCourse Status:ElectiveHost Unit:Department of Mathematics and its ApplicationsCo-
hosting Unit(s):Center for Network Science (CNS)Course coordinator: Roberta Sinatra,
SinatraR@ceu.eduBrief introduction to the courseThis course will provide a comprehensive, fast -
paced introduction to Scientic...
Instructor: Roberta Sinatra (https://people.ceu.edu/node/2156)
Credits: 3.0

SIMULATION METHODS (/COURSES/SIMULATION-METHODS)

Simulation methods (Department of Mathematics)Level:Doctoral or MA 2nd yearCourse Status:
ElectiveFull description:Brief introduction to the courseThe aim of the course is to give an
introduction to simulation methods. The illustrative tasks will be from statistical physics. The main
simulation techniques as...
Instructor: Jnos Kertsz (https://people.ceu.edu/node/1403)
Credits: 2.0

SOCIAL NETWORKS (/COURSES/SOCIAL-NETWORKS)

SOCIAL NETWORKS SYLLABUSLevel:DoctoralCourse Status:MandatoryFull description:General
scopeThe aim of this course is to give an overview of the key ideas of network science from a social
science perspective. The concept of networks has come to pervade modern society, as we routinely
make use of online social...
Instructor: Balazs Vedres (https://people.ceu.edu/node/1218)
Credits: 4.0

STATISTICAL METHODS IN NETWORK SCIENCE AND DATA ANALYSIS

(/COURSES/STATISTICAL-METHODS-NETWORK-SCIENCE-AND-DATA-ANALYSIS)
Level:DoctoralCourse Status: ElectiveCourse descriptionThe increasing volume and nature of big
datasets in business, economics, social and political sciences call for more complex and sophisticated
data mining tools. The complex systems monitored by big databases are successfully described in
terms of networks. In...
Instructor: Rosario N. Mantegna (https://people.ceu.edu/node/1449)
Credits: 4.0

STOCHASTIC PROCESSES IN NATURAL AND SOCIAL PHENOMENA

(/COURSES/STOCHASTIC-PROCESSES-NATURAL-AND-SOCIAL-PHENOMENA)
STOCHASTIC PROCESSES IN NATURAL AND SOCIAL PHENOMENA SYLLABUSLevel:Doctoral or
MACourse Status:ElectiveFull description:Course DescriptionVery few processes are completely
https://cns.ceu.edu/courses 4/7
3/31/2017 Courses|CenterforNetworkScience

deterministic an element of randomness is almost always present. The adequate mathematical

framework to treat this randomness is the theory...
Instructor: Jnos Kertsz (https://people.ceu.edu/node/1403)
Credits: 2.0

STRUCTURE AND DYNAMICS OF COMPLEX NETWORKS (/COURSES/STRUCTURE-AND-

DYNAMICS-COMPLEX-NETWORKS-0)
Course code: CNSC 6007DescriptionThe aim of this course is to deepen the knowledge of students in
networks science, to get acquainted with some important specic problems at the frontier of
research and get skills to work with present day literature.The bulk of the course will be provided in
lectures. There will be...
Instructor: Jnos Trk
Credits: 2.0

STRUCTURE AND DYNAMICS OF COMPLEX NETWORKS (/COURSES/STRUCTURE-AND-

DYNAMICS-COMPLEX-NETWORKS)
Course code: CNSC 6007Level:DoctoralCourse Status:MandatoryCourse DescriptionThe success of
the new science of networks is partly due to the realization of universal features in a wide range of
applications, but also due to very successful simple models. The following questions will be
discussed: How to identify...
Instructor: Jnos Kertsz (https://people.ceu.edu/node/1403)
Credits: 2.0

THE SCIENCE OF SUCCESS (/COURSES/SCIENCE-SUCCESS)

Course code: CNSC 6015Our current approach to success is driven by the belief that predicting
exceptional impact requires us to detect extraordinary ability. Despite the long-standing interest in
the problem, even experts remain notoriously bad at predicting long-term impact. Success becomes
suddenly predictable,...
Instructor: Albert - Lszl Barabsi (https://people.ceu.edu/node/1985)
Credits: 2.0

VERY LARGE GRAPHS AND THEIR LIMITS (/COURSES/VERY-LARGE-GRAPHS-AND-THEIR-

LIMITS)
LARGE SPARSE GRAPHS, GRAPH CONVERGENCE AND GROUPS SYLLABUSLevel:DoctoralCourse
Status:ElectiveFull description:Brief introduction to the course:A family of nite graphs is sparse, if
the number of edges of a graph in the family is proportional to the number of its vertices. Such
families of graphs come up...
Instructor: Mikls Abert (http://people.ceu.hu/node/1708)

https://cns.ceu.edu/courses 5/7
3/31/2017 Courses|CenterforNetworkScience

Credits: 3.0

FILTER BY ACADEMIC PROGRAM:

Doctor of Philosophy in Network Science (22) (/courses/program/33)

Advanced Certicate in Network Science (10) (/courses/program/212)

FILTER BY TERM:

Fall (7) (/courses/course_term/fall-298)

Winter (7) (/courses/course_term/winter-299)
Spring (2) (/courses/course_term/spring-303)

https://cns.ceu.edu/courses 6/7
3/31/2017 Courses|CenterforNetworkScience

https://cns.ceu.edu/courses 7/7