909 search results for “random maria theory” in the Public website
-
Random walks in dynamic random environments
Promotor: W.Th.F. den Hollander
-
On the random-matrix theory of Majorana fermions in topological superconductors
The thesis mainly contributes to the characterization of Majorana fermions as they appear in the Condensed Matter context.
-
Random walks and the contact process
Promotores: W. Th. F. den Hollander, M.O. Heydenreich
-
Some case studies of random walks in dynamic random environments
Promotor: Promotor: W.Th.F. den Hollander, Co-promotor: V. Sidoravicius.
-
Opinion Dynamics on Random Graphs
This thesis investigates opinion dynamics on random graphs through the lens of the voter model, a classical interacting particle system used to describe how consensus emerges in networks.
-
Maria Nieuwenhuizen -
Maria AddensFaculteit der Rechtsgeleerdheid
-
Maria DijkgraafFaculty of Humanities
-
Random walks on Arakelov class groups
The main topic of this PhD thesis is the Arakelov ray class group of a number field, an algebraic object that contains both the ideal class group structure and the unit group structure.
-
Maria BoletsiFaculty of Humanities
-
Maria Amjad
Faculty of Social and Behavioural Sciences
-
Maria Xiberras -
Maria MoustakaliFaculteit der Rechtsgeleerdheid
-
Wireless Random-Access Networks and Spectra of Random Graph
This thesis is divided into two parts. In Part I we study metastability properties of queue-based random-access protocols for wireless networks. The network is modeledas a bipartite graph whose edges represent interference constraints. In Part II we study spectra of inhomogeneous Erdős-Rényi random…
-
Maria Spirova
Faculty of Social and Behavioural Sciences
-
Probability theory
The research programme Probability Theory focuses on probability theory and on operations research.
-
Post-quantum Security of Cryptographic Transformations in the Random Oracle Model
In cryptography, generic transformations are often used to strengthen simpler but weaker schemes, into more sophisticated and stronger ones.
-
Intermittency and Number Expansions for Random Interval Maps
This dissertation consists of two parts, each of which considers a different research area related to random interval maps. In the first part we are interested in random interval maps that are critically intermittent.
-
María Perez RodriguezFaculty of Humanities
-
Maria Gabriela Palacio: inequality and revolution
What does an unequal society lead to if it's not responded to by politicians? What happens when people are no longer waiting for something good to happen to them? An international perspective can give us possible answers.
-
Maria Romanova-HynesFaculty of Humanities
-
Maria Langeler-HollebeekFaculteit der Rechtsgeleerdheid
-
Maria Eugenia Goya -
Stella Maria PfistererFaculty of Social and Behavioural Sciences
-
Maria Luisa Gallavotti -
Maria Myrto PetratzaFaculty of Social and Behavioural Sciences
-
Maria de BoerFaculteit Governance and Global Affairs
-
Maria de KruijfFaculteit der Rechtsgeleerdheid
-
Maria van der SchaarFaculty of Humanities
-
Maria Elisabeth TiggelaarFaculteit Governance and Global Affairs
-
Maria de Lourdes MonteiroFaculteit der Rechtsgeleerdheid
-
Maria Guimaraes Da Lomba Ferraz -
Anna Maria Puigderrajols TriadóFaculteit der Rechtsgeleerdheid
-
María Manuela Márquez VelásquezFaculteit der Rechtsgeleerdheid
-
José María Castro IbarraFaculty of Humanities
-
Maria-Lucia RebreanFaculteit der Rechtsgeleerdheid
-
Maria Gabriela Palacio LudeñaFaculty of Humanities
-
Spectral signatures of breaking of ensemble equivalence
This thesis explores Breaking of Ensemble Equivalence (BEE) in random graph models by examining the spectral properties of adjacency matrices. The goal is to identify spectral characteristics that differentiate random graph ensembles, enhancing the understanding of complex network structures and beh…
-
Theory
Many important topics in computer science, such as the correctness of software, the efficiency of algorithms and the modeling of complicated systems, depend on sound theoretical underpinnings. In the Theory group, we study these fundamental building blocks and develop verification methods to prove system…
-
Nandan Malhotra -
Rosa Maria de Lima RibeiroFaculty of Humanities
-
Theory
Many important topics in computer science, such as the correctness of software, the efficiency of algorithms and the modeling of complicated systems, depend on sound theoretical underpinnings. In the Theory group, we study these fundamental building blocks and develop verification methods to prove system…
-
Algebra, Geometry and Number Theory
The research of the Algebra, Geometry and Number Theory programme ranges from fundamental mathematical theory to algorithms and applications.
-
Knowledge extraction in the quantum random-oracle model
The aim of this thesis is to present novel techniques for proving cryptographic schemes secure against quantum adversaries. Most results are within the context of an idealized model called the ‘quantum random-oracle model’.
-
Approaching equilibrium in a dynamic network
This dissertation presents four separate chapters, all striving towards the same goal: to understand dynamic phenomena occurring in dynamic networks and to explore the emergence of equilibrium in a broad sense.
-
Key Issues in Historical Theory
This book addresses the definition of history and how people are influenced by it.
-
Mersenne primes and class field theory
Promotor: H.W. Lenstra, Jr., Co-promotor: B. de Smit
-
Diego Garlaschelli Group - Econophysics and Network Theory
We study the structure, dynamics and physics of complex networks emerging from the intricate interconnectedness of the constituents of large systems.
-
Statistical physics and information theory for systems with local constraints
Systems with local constraints is a new finding in recent researches on complex systems. The heterogeneous spatial interactions and the temporal dependencies among those numerous units make it difficult to describe by traditional statistical physics.
-
Spectral Analysis of Inhomogeneous Networks
This thesis explores Breaking of Ensemble Equivalence (BEE) in random graph models by examining the spectral properties of adjacency matrices. The goal is to identify spectral characteristics that differentiate random graph ensembles, enhancing the understanding of complex network structures and beh…