Réka Albert
Biographic Data
| ID | 9752548 |
|---|---|
| NAME | Réka Albert |
| GIVEN NAMES | Réka |
| FAMILY NAME | Albert |
| SIGNATURE | ALBERT R |
| AFFILIATIONS | Department of Physics, University of Notre Dame, Notre Dame, IN 46556, USA. |
| VERIFIED | No |
| TOTAL WORKS | 8 |
| TOTAL CITATIONS | 0 |
| AUTHOR COUNT | 8 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 1999 |
| LATEST PUBLICATION YEAR | 2024 |
| H-INDEX | 0 |
Le paysage national: Approche anthropologique et historique de l'imaginaire du paysage hongrois.A nemzeti táj : A magyar táj képzetének történeti-antropológiai vizsgálata
Thèse dirigée par Marie-Vic Ozouf-Marignier (EHESS), soutenue devant un jury composé de Gabor Czoch (Université ELTE de Budapest), Paul Gradvohl (Université Paris 1 Panthéon-Sorbonne), Peter Granasztoi (Musée d’Ethnographie de Budapest), Maitane Ostolaza (Université de Perpignan) et Nicolas Verdier (EHESS).Résumé : L’objet de notre thèse d’anthropologie historique est la représentation paysagère de la nation. À la fois emblématique, schématique e…
Node-independent elementary signaling modes: A measure of redundancy in Boolean signaling transduction networks
The redundancy of a system denotes the amount of duplicate components or mechanisms in it. For a network, especially one in which mass or information is being transferred from an origin to a destination, redundancy is related to the robustness of the system. Existing network measures of redundancy rely on local connectivity (e.g. clustering coefficients) or the existence of multiple paths. As in many systems there are functional dependencies betw…
Error and attack tolerance of complex networks
Many complex systems display a surprising degree of tolerance against errors.For example, relatively simple organisms grow, persist and reproduce despite drastic pharmaceutical or environmental interventions, an error tolerance attributed to the robustness of the underlying metabolic network [1].Complex communication networks [2] display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to t…
Near linear time algorithm to detect community structures in large-scale networks
Community detection and analysis is an important methodology for understanding the organization of various real-world networks and has applications in problems as diverse as consensus formation in social communities or the identification of functional modules in biochemical networks. Currently used algorithms that identify the community structures in large-scale real-world networks require a priori information such as the number and sizes of comm…
Statistical mechanics of complex networks
Complex networks describe a wide range of systems in nature and society. Frequently cited examples include the cell, a network of chemicals linked by chemical reactions, and the Internet, a network of routers and computers connected by physical links. While traditionally these systems have been modeled as random graphs, it is increasingly recognized that the topology and evolution of real networks are governed by robust organizing principles. Thi…
Error and attack tolerance of complex networks
Diameter of the World-Wide Web
Emergence of Scaling in Random Networks
Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mechanisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well conne…
No prominent works on this page.
Diameter of the World-Wide Web
Emergence of Scaling in Random Networks
Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mechanisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well conne…
Error and attack tolerance of complex networks
Statistical mechanics of complex networks
Complex networks describe a wide range of systems in nature and society. Frequently cited examples include the cell, a network of chemicals linked by chemical reactions, and the Internet, a network of routers and computers connected by physical links. While traditionally these systems have been modeled as random graphs, it is increasingly recognized that the topology and evolution of real networks are governed by robust organizing principles. Thi…
Near linear time algorithm to detect community structures in large-scale networks
Community detection and analysis is an important methodology for understanding the organization of various real-world networks and has applications in problems as diverse as consensus formation in social communities or the identification of functional modules in biochemical networks. Currently used algorithms that identify the community structures in large-scale real-world networks require a priori information such as the number and sizes of comm…
Error and attack tolerance of complex networks
Many complex systems display a surprising degree of tolerance against errors.For example, relatively simple organisms grow, persist and reproduce despite drastic pharmaceutical or environmental interventions, an error tolerance attributed to the robustness of the underlying metabolic network [1].Complex communication networks [2] display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to t…
Node-independent elementary signaling modes: A measure of redundancy in Boolean signaling transduction networks
The redundancy of a system denotes the amount of duplicate components or mechanisms in it. For a network, especially one in which mass or information is being transferred from an origin to a destination, redundancy is related to the robustness of the system. Existing network measures of redundancy rely on local connectivity (e.g. clustering coefficients) or the existence of multiple paths. As in many systems there are functional dependencies betw…
Le paysage national: Approche anthropologique et historique de l'imaginaire du paysage hongrois.A nemzeti táj : A magyar táj képzetének történeti-antropológiai vizsgálata
Thèse dirigée par Marie-Vic Ozouf-Marignier (EHESS), soutenue devant un jury composé de Gabor Czoch (Université ELTE de Budapest), Paul Gradvohl (Université Paris 1 Panthéon-Sorbonne), Peter Granasztoi (Musée d’Ethnographie de Budapest), Maitane Ostolaza (Université de Perpignan) et Nicolas Verdier (EHESS).Résumé : L’objet de notre thèse d’anthropologie historique est la représentation paysagère de la nation. À la fois emblématique, schématique e…
Computer Science (6 works) · Complex Network Analysis Techniques (5 works) · Complex network (4 works) · Mathematics (4 works) · Opinion Dynamics and Social Influence (4 works) · Computer network (3 works) · Topology (electrical circuits) (3 works) · World Wide Web (3 works) · Algorithm (2 works) · Combinatorics (2 works)