Random graphs and complex networks. Volume 1
This book presents an updated introduction to random graphs as models for complex networks, which is a rapidly growing and extremely prolific subject nowadays. Written in a coherent and self-contained way, this book is suitable for a master level course with students having some preliminary knowledge of probability and discrete mathematics. The book (volume one) begins with an introduction in Chapter 1 giving an overall view of the key elements of random graphs and network sciences. Necessary theoretical preparations on probabilistic methods and branching processes are covered in Chapters 2 and 3, respectively, focusing on the convergence of random variables, coupling methods as well as properties of Binomial and Poisson branching processes. These results are less covered in standard textbooks on random graphs or network sciences. Erdős-Rényi random graph theory is introduced in Chapters 4 and 5, where the phase transition and the connectivity evolution are treated in detail. Most of the technical proofs are available and the results from the perspective of limit theory are fairly interesting. In the last three chapters of this volume, three relatively independent complex network models are investigated. To wit, generalized (in-homogeneous) random graphs, configuration models, and preferential attachment models. The contexts in these chapters introduce new techniques/insights, especially in the last decade, and reflect recent theoretical advances. These models are important and relevant in the modern network science and have attracted much attention from diverse areas including mathematics, physics, computer science, biology, economics and management.NEWLINENEWLINEIt is worth mentioning that the simple and readable manner in which this book is written makes it accessible reading for master level students with interdisciplinary backgrounds. Each chapter begins with the ``Organization of this Chapter and ends with notes and discussions, in addition to exercises, pointing to useful literature. Each exercise is provided with a running title to summarize the meaning or indicate its crux. There are many other features that make this book a special contribution. The volume two of this book detailing the models for complex networks is much expected.
- Mixing times of random walks on dynamic configuration models
- Exceptional times of the critical dynamical Erdős-Rényi graph
- Is breaking of ensemble equivalence monotone in the number of constraints?
- Mesoscopic scales in hierarchical configuration models
- Large deviations in generalized random graphs with node weights
- On edge exchangeable random graphs
- Local neighbourhoods for first-passage percolation on the configuration model
- Covariance structure behind breaking of ensemble equivalence in random graphs
- The tail does not determine the size of the giant
- Spatial Gibbs random graphs
- Typical distances in the directed configuration model
- Coalescent results for diploid exchangeable population models
- The dynamics of power laws: fitness and aging in preferential attachment trees
- A theoretical and empirical evaluation of an algorithm for self-healing computation
- When is a scale-free graph ultra-small?
- Critical behavior of the annealed Ising model on random regular graphs
- Synchronization of reinforced stochastic processes with a network-based interaction
- Exponential extinction time of the contact process on rank-one inhomogeneous random graphs
- A population evolution model and its applications to random networks
- Tight fluctuations of weight-distances in random graphs with infinite-variance degrees
- Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
- Evolution of a modified binomial random graph by agglomeration
- A moment-generating formula for Erdős-Rényi component sizes
- Ensemble equivalence for dense graphs
- Change point detection in network models: preferential attachment and long range dependence
- De-anonymization of heterogeneous random graphs in quasilinear time
- Triadic closure in configuration models with unbounded degree fluctuations
- Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees
- Synchronization and functional central limit theorems for interacting reinforced random walks
- Glauber dynamics on the Erdős-Rényi random graph
- The parabolic Anderson model on a Galton-Watson tree
- PageRank on inhomogeneous random digraphs
- On the connectivity of configuration graphs
- Level-set percolation of the Gaussian free field on regular graphs II: finite expanders
- Cutoff for random walk on dynamical Erdős-Rényi graph
- Metric dimension of critical Galton-Watson trees and linear preferential attachment trees
- Number of edges in inhomogeneous random graphs
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- Age evolution in the mean field forest fire model via multitype branching processes
- Detecting a planted community in an inhomogeneous random graph
- Explicit bounds for critical infection rates and expected extinction times of the contact process on finite random graphs
- Geometry of the minimal spanning tree of a random 3-regular graph
- A phase transition for preferential attachment models with additive fitness
- Stochastic block model in a new critical regime and the interacting multiplicative coalescent
- Metastability for the dilute Curie-Weiss model with Glauber dynamics
- Geometry of weighted recursive and affine preferential attachment trees
- Frozen percolation on the binary tree is nonendogenous
- Asymptotic analysis of Poisson shot noise processes, and applications
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
- Secretary problem: graphs, matroids and greedoids
- Phase transitions and percolation at criticality in enhanced random connection models
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- Tree builder random walk: recurrence, transience and ballisticity
- Annealed Ising model on configuration models
- A random graph of moderate density
- Remarks on power-law random graphs
- The random cluster model on the complete graph via large deviations
- Global lower mass-bound for critical configuration models in the heavy-tailed regime
- Susceptible-infected epidemics on evolving graphs
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs
- Dynamical models for random simplicial complexes
- Pagerank asymptotics on directed preferential attachment networks
- Typicality and entropy of processes on infinite trees
- Mean field behavior during the big bang regime for coalescing random walks
- On a game of chance in Marc Elsberg's thriller ``GREED
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- Distance evolutions in growing preferential attachment graphs
- On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
- Large degrees in scale-free inhomogeneous random graphs
- Random tree-weighted graphs
- Not all interventions are equal for the height of the second peak
- The many facets of the Estrada indices of graphs and networks
- Sizes of trees in a random forest and configuration graphs
- Rare event asymptotics for exploration processes for random graphs
- Extremal linkage networks
- Depth first exploration of a configuration model
- Max-linear models in random environment
- Central limit theorem for the largest component of random intersection graph
- On the threshold of spread-out contact process percolation
- Asymptotic dependence of in- and out-degrees in a preferential attachment model with reciprocity
- Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms
- Random walk on the random connection model
- Root finding algorithms and persistence of Jordan centrality in growing random trees
- Influence of the seed in affine preferential attachment trees
- On the continuous-time limit of the Barabási-Albert random graph
- Local weak convergence for PageRank
- Floodings of metric graphs
- Universality for critical heavy-tailed network models: metric structure of maximal components
- Threshold functions for small subgraphs in simple graphs and multigraphs
- Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs
- Long paths in first passage percolation on the complete graph. I: Local PWIT dynamics
- On the independence number of some random trees
- Long paths in first passage percolation on the complete graph II. Global branching dynamics
- Towards degree distribution of a duplication-divergence graph model
- Preferential attachment random graphs with edge-step functions
- Heavy-tailed configuration models at criticality
- The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation
- Optimal subgraph structures in scale-free configuration models
- Preferential attachment without vertex growth: emergence of the giant component
- Central limit theorems for SIR epidemics and percolation on configuration model random graphs
This page was built for publication: Random graphs and complex networks. Volume 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2833172)
