Skip to Content.
Sympa Menu

fizinfo - [Fizinfo] Emlékeztető/Reminder: Ortvay kollokvium/Ortvay colloquium ma/today

fizinfo AT lists.kfki.hu

Subject: ELFT HÍRADÓ

List archive

[Fizinfo] Emlékeztető/Reminder: Ortvay kollokvium/Ortvay colloquium ma/today


Chronological Thread 
  • From: Kormányos Andor <andor.kormanyos AT ttk.elte.hu>
  • To: "fizinfo AT lists.kfki.hu" <fizinfo AT lists.kfki.hu>, "ttk-fiz-faculty AT listbox.elte.hu" <ttk-fiz-faculty AT listbox.elte.hu>, "ttk-fiz-kutato AT listbox.elte.hu" <ttk-fiz-kutato AT listbox.elte.hu>, "ttk-fiz-emeritus AT listbox.elte.hu" <ttk-fiz-emeritus AT listbox.elte.hu>, "ttk-fiz-postdoc AT listbox.elte.hu" <ttk-fiz-postdoc AT listbox.elte.hu>, "ttk-fiz-phd-hallgatok AT listbox.elte.hu" <ttk-fiz-phd-hallgatok AT listbox.elte.hu>, "ttk-fiz-alkalmazottak AT listbox.elte.hu" <ttk-fiz-alkalmazottak AT listbox.elte.hu>
  • Subject: [Fizinfo] Emlékeztető/Reminder: Ortvay kollokvium/Ortvay colloquium ma/today
  • Date: Thu, 21 Apr 2022 08:24:11 +0000
  • Accept-language: hu-HU, en-US
  • Arc-authentication-results: i=1; mx.microsoft.com 1; spf=pass smtp.mailfrom=ttk.elte.hu; dmarc=pass action=none header.from=ttk.elte.hu; dkim=pass header.d=ttk.elte.hu; arc=none
  • Arc-message-signature: i=1; a=rsa-sha256; c=relaxed/relaxed; d=microsoft.com; s=arcselector9901; h=From:Date:Subject:Message-ID:Content-Type:MIME-Version:X-MS-Exchange-AntiSpam-MessageData-ChunkCount:X-MS-Exchange-AntiSpam-MessageData-0:X-MS-Exchange-AntiSpam-MessageData-1; bh=Xqyoz5CKGMjA9GlydM2HXlJbcUyCLHl6GKzb6Bw+CEU=; b=AlKiSDcVs+GOyiz3IfPLDEpsyRPD/CgI+4WL0g/r71fnByKob3EK7K2+dQXojEOhE2vvbjAdWeZkAS4Ylfc5k2omlxvSY2qQVWymr66v64PgLeSSfh/qeeBHn2Fh6yztxKVu6uUcJa9Dx0WZ+a+6FRSPMG3ZSXq0CwSF902y0naBBls8VJYrqV5OLg3rs/ktbJ2pK0TVnBeRBE3ifAXqeTSq58h+XUGzGg/5OA7+3+MqPZp4uzf8hjFPUt8cGsTga8nuQEfmp7jfDy1io+I+hGfNoHU8t3vnGPSIUqJZZPkTwxdqSnMwFr04Ei0Itw0HbFvaHVSE2Ajv0kSKWBOIUQ==
  • Arc-seal: i=1; a=rsa-sha256; s=arcselector9901; d=microsoft.com; cv=none; b=lMV8lmC00H1lwioGIG2yMPw5tOiBzyGvgnAjRGNYN12nWZV1ckeh+dW4xuPwuP/6XfGURHKfKaK3oIro8F/cx8wt/t+X1DooGiI2MOkXoig8HToVBNX4C8gb3IlWIVaF/9Dorm2dw0yDzMMpELcAdxKuf8GhokG7WgAKqM3fTyPcPzeZPsPINoKsC983bYEfZl/9koOip9ZVIcAVphNqTCsxPdiZEGIpMUmF6Fi9vYiMk/olS7tANsrYJHZg8KQxXOKM/tK8exjXOFz0IN2aQnGGXfKhrPNSXajlZ69EW9r+5qMlXQf6X85hNHdw7Pyd6A48N/FOknwei2tK2I3PUg==
  • Authentication-results: smtp1.kfki.hu (amavisd-new); dkim=pass (1024-bit key) header.d=eltehu.onmicrosoft.com
  • Authentication-results: dkim=none (message not signed) header.d=none;dmarc=none action=none header.from=ttk.elte.hu;



ELTE Fizika Intézet / Institute of Physics

ORTVAY KOLLOKVIUM / ORTVAY COLLOQUIUM
(https://physics.elte.hu/ortvayseminar)


Thursday, 21st April 2022, 15:00


Hybrid format:

Pócza Jenő Classroom, Physics Building 1.71
Pázmány Péter sétány 1/A, 1117 Budapest

and Microsoft Teams:

https://teams.microsoft.com/l/meetup-join/19%3aE-neA-S4-ucnS9OJ4HUTfwixh2tL4S6JpTbAR919VRE1%40thread.tacv2/1650043633655?context=%7b%22Tid%22%3a%22b366dbcd-4fc3-4451-82d2-e239564302c3%22%2c%22Oid%22%3a%22560bcc66-85b7-4700-9055-41903a3659ca%22%7d


Zoltán Toroczkai (University of Notre Dame)

<https://physics.elte.hu/en/content/istvan-b-foldes-wigner-rcp-institute-for-particle-and-nuclear-physics.e.2811>

Modelling real word networks with degree-preserving processes


Modeling real-world networks is a key focus area of Network Science. I will
first provide a brief overview into the state-of-the-art of network modeling,
then turn to the discussion of network evolution models. Real-world networks
evolve over time through the addition or removal of nodes and edges. In
current network-evolution models, the degree of each node varies or grows
arbitrarily, yet there are many networks for which a different description is
required. In some networks, node degree saturates, such as the number of
active contacts of a person, and in some it is fixed, such as the valence of
an atom in a molecule. I will introduce a novel family of network growth
processes that preserve node degree (DPG), resulting in structures
substantially different from those reported previously. We demonstrated that,
despite it being an NP (non-deterministic polynomial time)-hard problem in
general, the exact structure of most real-world networks can be generated
from degree-preserving growth. We also show that this process can create
scale-free networks with arbitrary exponents, however, without preferential
attachment. If preferential attachment is an effective rich-gets-richer
mechanism applied to connectivity formation, then degree-preserving growth is
a type of “tinkering” mechanism, a property observed in many real systems,
e.g., by the Nobel Laurate F. Jacob in: “Evolution and Tinkering”, Science,
196, 1161 (1977)). Finally, I will present applications of DPG to epidemics
control via network immunization, viral marketing, knowledge dissemination,
the design of molecular isomers with desired properties and to a problem in
number theory.


Best regards,
Andor Kormányos
coordinator
















  • [Fizinfo] Emlékeztető/Reminder: Ortvay kollokvium/Ortvay colloquium ma/today, Kormányos Andor, 04/21/2022

Archive powered by MHonArc 2.6.19+.

Top of Page