506 search results for “random wang” in the Public website
-
Random walks in dynamic random environments
Promotor: W.Th.F. den Hollander
-
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.
-
M. Wang
Chair of LU-European Center for Chinese Medicine and Natural Compounds, Institute of Biology, Leiden University - the Netherlands
-
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.
-
Chen Wang -
Hua Wang -
Qing WangFaculteit der Rechtsgeleerdheid
-
Fang Wang -
Yuchen WangAfrika-Studiecentrum
-
Yongqi Wang -
Shuyu Wang -
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.
-
Dongyi WangFaculty of Social and Behavioural Sciences
-
Ben Wang -
Feifei Wang -
Chuang Wang -
Zherui Wang -
Lan Wang -
Bo WangFaculty of Humanities
-
Chenyu Wang -
Jin WangFaculty of Humanities
-
Depeng Wang -
Yaqian WangFaculty of Humanities
-
Luxi WangICLON
-
Yanan WangFaculty of Humanities
-
Ruiqi Wang -
Ranran Wang -
Yuting Wang -
Hertz Wang -
Tianyuan Wang -
Yixuan Wang -
Zixuan Wang -
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.
-
Hao Wang -
Yumeng Wang -
Yixu Wang -
Jiahui Wang -
Jue WangFaculty of Humanities
-
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…
-
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.
-
No experiments but equations: how Daoyi Wang uses math to understand the world
How do you study the growth of microorganisms, the spread of epidemic diseases or the healing of wounds, without actually performing experiments? Daoyi Wang, PhD candidate at the Mathematical Institute, worked on a specific mathematical model that can describe the growth of microorganisms and many other…
-
Ying-ting WangFaculty of Humanities
-
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.
-
Katherine Hamilton -
Exploration on and of Networks
This dissertation consists of two parts, with the common theme
-
The parabolic Anderson model on Galton-Watson trees
The parabolic Anderson model (PAM), which is the Cauchy problem for the heat equation with random potential. The PAM is a mathematical model that describes how mass (i.e. matter or energy) flows in a medium in the presence of a field of sources and sinks.
-
Satellite swarms, random walks and a cup of tea
He brings order to chaos and analyses satellite swarms. During his PhD research, mathematician Oliver Nagy delved into random networks and how they reach equilibrium. Along the way, he also developed a handy tool. This knowledge is valuable for calculations related to communication networks.