Differential Equations for Random Processes and Random Graphs
Reads0
Chats0
TLDR
In this paper, the authors consider random graph processes in which the maximum degree is bounded and show that the numbers of vertices of given degree exhibit this convergence as the total number of nodes tends to infinity.Abstract:
General criteria are given to ensure that in a family of discrete random processes, given parameters exhibit convergence to the solution of a system of differential equations. As one application we consider random graph processes in which the maximum degree is bounded and show that the numbers of vertices of given degree exhibit this convergence as the total number of vertices tends to infinity. Two other applications are to random processes which generate independent sets of vertices in random $r$-regular graphs. In these cases, we deduce almost sure lower bounds on the size of independent sets of vertices in random $r$-regular graphs.read more
Citations
More filters
Journal ArticleDOI
A Brief History of Generative Models for Power Law and Lognormal Distributions
TL;DR: A rich and long history is found of how lognormal distributions have arisen as a possible alternative to power law distributions across many fields, focusing on underlying generative models that lead to these distributions.
Journal ArticleDOI
The power of two choices in randomized load balancing
TL;DR: This work uses a limiting, deterministic model representing the behavior as n/spl rarr//spl infin/ to approximate the behavior of finite systems and provides simulations that demonstrate that the method accurately predicts system behavior, even for relatively small systems.
Journal ArticleDOI
Efficient erasure correcting codes
TL;DR: A simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs is introduced and a simple criterion involving the fractions of nodes of different degrees on both sides of the graph is obtained which is necessary and sufficient for the decoding process to finish successfully with high probability.
Book
Random graph dynamics
TL;DR: The Erdos-Renyi random graphs model, a version of the CHKNS model, helps clarify the role of randomness in the distribution of values in the discrete-time world.
Journal ArticleDOI
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Michael Molloy,Bruce Reed +1 more
TL;DR: The size of the giant component in the former case, and the structure of the graph formed by deleting that component is analyzed, which is basically that of a random graph with n′=n−∣C∣ vertices, and with λ′in′ of them of degree i.