[KNIHA][B] Random graphs and complex networks
R Van Der Hofstad - 2024 - books.google.com
Complex networks are key to describing the connected nature of the society that we live in.
This book, the second of two volumes, describes the local structure of random graph models …
This book, the second of two volumes, describes the local structure of random graph models …
Epidemic spreading on complex networks with community structures
Many real-world networks display a community structure. We study two random graph
models that create a network with similar community structure as a given network. One …
models that create a network with similar community structure as a given network. One …
[PDF][PDF] Random graphs and complex networks
R Van Der Hofstad - vol. I, 2014 - Citeseer
These lecture notes are intended to be used for master courses, where the students have a
limited prior knowledge of special topics in probability. Therefore, we have included many of …
limited prior knowledge of special topics in probability. Therefore, we have included many of …
[KNIHA][B] Progress in high-dimensional percolation and random graphs
M Heydenreich, R Van der Hofstad - 2017 - Springer
This book focuses on percolation on high-dimensional lattices. We give a general
introduction to percolation, stating the main results and defining the central objects. We …
introduction to percolation, stating the main results and defining the central objects. We …
Scale-free percolation
M Deijfen, R Van der Hofstad… - Annales de l'IHP …, 2013 - numdam.org
We formulate and study a model for inhomogeneous long-range percolation on Zd. Each
vertex x∈ Zd is assigned a non-negative weight Wx, where (Wx) x∈ Zd are iid random …
vertex x∈ Zd is assigned a non-negative weight Wx, where (Wx) x∈ Zd are iid random …
Scaling limits for critical inhomogeneous random graphs with finite third moments
We identify the scaling limit for the sizes of the largest components at criticality for
inhomogeneous random graphs with weights that have finite third moments. We show that …
inhomogeneous random graphs with weights that have finite third moments. We show that …
Critical window for the configuration model: finite third moment degrees
We investigate the component sizes of the critical configuration model, as well as the related
problem of critical percolation on a supercritical configuration model. We show that, at …
problem of critical percolation on a supercritical configuration model. We show that, at …
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
One major open conjecture in the area of critical random graphs, formulated by statistical
physicists, and supported by a large amount of numerical evidence over the last decade …
physicists, and supported by a large amount of numerical evidence over the last decade …
Switchover phenomenon induced by epidemic seeding on geometric networks
It is a fundamental question in disease modeling how the initial seeding of an epidemic,
spreading over a network, determines its final outcome. One important goal has been to find …
spreading over a network, determines its final outcome. One important goal has been to find …
The component sizes of a critical random graph with given degree sequence
A Joseph - 2014 - projecteuclid.org
Consider a critical random multigraph G_n with n vertices constructed by the configuration
model such that its vertex degrees are independent random variables with the same …
model such that its vertex degrees are independent random variables with the same …