The phase transition in inhomogeneous random graphs
Random Structures & Algorithms
Non-searchability of random power-law graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
The largest component in subcritical inhomogeneous random graphs
Combinatorics, Probability and Computing
Component Evolution in General Random Intersection Graphs
SIAM Journal on Discrete Mathematics
Efficient generation of networks with given expected degrees
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Controlling opinion bias in online social networks
Proceedings of the 3rd Annual ACM Web Science Conference
Controlling opinion propagation in online networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We consider the random graph model $G(\mathbf{w})$ for a given expected degree sequence ${\mathbf w} =(w_1, w_2, \ldots, w_n)$. If the expected average degree is strictly greater than $1$, then almost surely the giant component in $G$ of $G({\mathbf w})$ has volume (i.e., sum of weights of vertices in the giant component) equal to $\lambda_0 {\rm Vol}(G) + O(\sqrt{n}\log^{3.5} n)$, where $\lambda_0$ is the unique nonzero root of the equation \[ \sum_{i=1}^n w_i e^{-w_i\lambda} = (1-\lambda) \sum_{i=1}^n w_i, \] and where ${\rm Vol}(G)=\sum_i w_i.$