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 criticality, the finite third moment
assumption on the asymptotic degree distribution is enough to guarantee that
the sizes of the largest connected components are of the order $n^{2/3}$ and
the re-scaled component sizes (ordered in a decreasing manner) converge to the
ordered excursion lengths of an inhomogeneous Brownian Motion with a parabolic
drift. We use percolation to study the evolution of these component sizes while
passing through the critical window and show that the vector of percolation
cluster-sizes, considered as a process in the critical window, converge to the
multiplicative coalescent process in the sense of finite dimensional
distributions. This behavior was first observed for Erd\H{o}s-R\'enyi random
graphs by Aldous (1997) and our results provide support for the empirical
evidences that the nature of the phase transition for a wide array of
random-graph models are universal in nature. Further, we show that the
re-scaled component sizes and surplus edges converge jointly under a strong
topology, at each fixed location of the scaling window.Comment: 33 pages. Minor improvement
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such results were derived by Bhamidi, van der Hofstad, Sen (2018) [15]. We develop general principles under which the identical scaling limits as [15] can be obtained. Of independent interest, we derive refined asymptotics for various susceptibility functions and the maximal diameter in the barely subcritical regime.
A fundamental challenge in large-scale cloud networks and data centers is to achieve highly efficient server utilization and limit energy consumption, while providing excellent userperceived performance in the presence of uncertain and timevarying demand patterns. Auto-scaling provides a popular paradigm for automatically adjusting service capacity in response to demand while meeting performance targets, and queue-driven auto-scaling techniques have been widely investigated in the literature. In typical data center architectures and cloud environments however, no centralized queue is maintained, and load balancing algorithms immediately distribute incoming tasks among parallel queues. In these distributed settings with vast numbers of servers, centralized queue-driven auto-scaling techniques involve a substantial communication overhead and major implementation burden, or may not even be viable at all.Motivated by the above issues, we propose a joint autoscaling and load balancing scheme which does not require any global queue length information or explicit knowledge of system parameters, and yet provides provably near-optimal service elasticity. We establish the fluid-level dynamics for the proposed scheme in a regime where the total traffic volume and nominal service capacity grow large in proportion. The fluid-limit results show that the proposed scheme achieves asymptotic optimality in terms of user-perceived delay performance as well as energy consumption. Specifically, we prove that both the waiting time of tasks and the relative energy portion consumed by idle servers vanish in the limit. At the same time, the proposed scheme operates in a distributed fashion and involves only constant communication overhead per task, thus ensuring scalability in massive data center operations. Extensive simulation experiments corroborate the fluid-limit results, and demonstrate that the proposed scheme can match the user performance and energy consumption of state-of-the-art approaches that do take full advantage of a centralized queue.
Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of the graphon space. As a corollary of our result, we obtain LDPs for functionals continuous with respect to the cut metric, and obtain an asymptotic enumeration formula for graphs with given degrees, subject to an additional constraint on the value of a continuous functional. Our assumptions on the degrees are identical to those of Chatterjee, Diaconis and Sly (2011), who derived the almost sure graphon limit for these random graphs.
We investigate random sequential adsorption (RSA) on a random graph via the following greedy algorithm: Order the n vertices at random, and sequentially declare each vertex either active or frozen, depending on some local rule in terms of the state of the neighboring vertices. The classical RSA rule declares a vertex active if none of its neighbors is, in which case the set of active nodes forms an independent set of the graph. We generalize this nearest-neighbor blocking rule in three ways and apply it to the Erdős-Rényi random graph. We consider these generalizations in the large-graph limit n → ∞ and characterize the jamming constant, the limiting proportion of active vertices in the maximal greedy set.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.