The @math -core, defined as the largest subgraph of minimum degree @math , of the random graph @math has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [JCTB 67 (1996) 111--151] determined the threshold @math for the appearance of an extensive @math -core. Here we derive a multi-type Galton-Watson branching process that describes precisely how the @math -core is embedded into the random graph for any @math and any fixed average degree @math . This generalises prior results on, e.g., the internal structure of the @math -core.
The contribution of the present work is that we exhibit a branching process that describes the structure of the core together with the mantle and hence, crucially, the connections between the two. This is reflected in the fact that s and deal with @math -marked graphs and trees, with marks indicating membership of the @math -core. Neither the construction of the core via the peeling process'' nor the branching process analogy from @cite_1 @cite_13 @cite_23 reveal how the core interconnects with the mantle. In fact, even though @cite_22 asymptotically determines the degree distribution of the core along with the combined degrees of the vertices in the mantle, we saw in that the conditional random graph is not uniformly random subject to these.
@cite_13 @cite_1 @cite_22 @cite_23
2953245987 2545825365 2056809837 2129754261
The analysis of several algorithms and data structures can be framed as a peeling process on a random hypergraph: vertices with degree less than k are removed until there are no vertices of degree less than k left. The remaining hypergraph is known as the k-core. In this paper, we analyze parallel peeling processes, where in each round, all vertices of degree less than k are removed. It is known that, below a specific edge density threshold, the k-core is empty with high probability. We show that, with high probability, below this threshold, only (log log n) log(k-1)(r-1) + O(1) rounds of peeling are needed to obtain the empty k-core for r-uniform hypergraphs. Interestingly, we show that above this threshold, Omega(log n) rounds of peeling are required to find the non-empty k-core. Since most algorithms and data structures aim to peel to an empty k-core, this asymmetry appears fortunate. We verify the theoretical results both with simulation and with a parallel implementation using graphics processing units (GPUs). Our implementation provides insights into how to structure parallel peeling algorithms for efficiency in practice. Consider a uniform random rooted tree on vertices labelled by @math , with edges directed towards the root. We imagine that each node of the tree has space for a single car to park. A number @math of cars arrive one by one, each at a node chosen independently and uniformly at random. If a car arrives at a space which is already occupied, it follows the unique path oriented towards the root until it encounters an empty space, in which case it parks there; if there is no empty space, it leaves the tree. Consider @math and let @math denote the event that all @math cars find spaces in the tree. Lackner and Panholzer proved (via analytic combinatorics methods) that there is a phase transition in this model. Then if @math , we have @math , whereas if @math we have @math . We give a probabilistic explanation for this phenomenon, and an alternative proof via the objective method. Along the way, we are led to consider the following variant of the problem: take the tree to be the family tree of a Galton-Watson branching process with Poisson(1) offspring distribution, and let an independent Poisson( @math ) number of cars arrive at each vertex. Let @math be the number of cars which visit the root of the tree. Then for @math , we have @math , whereas for @math , we have @math . This discontinuous phase transition turns out to be a generic phenomenon in settings with an arbitrary offspring distribution of mean at least 1 for the tree and arbitrary arrival distribution. We prove that the extremal process of branching Brownian motion, in the limit of large times, converges weakly to a cluster point process. The limiting process is a (randomly shifted) Poisson cluster process, where the positions of the clusters is a Poisson process with intensity measure with exponential density. The law of the individual clusters is characterized as branching Brownian motions conditioned to perform “unusually large displacements”, and its existence is proved. The proof combines three main ingredients. First, the results of Bramson on the convergence of solutions of the Kolmogorov–Petrovsky–Piscounov equation with general initial conditions to standing waves. Second, the integral representations of such waves as first obtained by Lalley and Sellke in the case of Heaviside initial conditions. Third, a proper identification of the tail of the extremal process with an auxiliary process (based on the work of Chauvin and Rouault), which fully captures the large time asymptotics of the extremal process. The analysis through the auxiliary process is a rigorous formulation of the cavity method developed in the study of mean field spin glasses. The percolation phase transition and the mechanism of the emergence of the giant component through the critical scaling window for random graph models, has been a topic of great interest in many dierent communities ranging from statistical physics, combinatorics, computer science, social networks and probability theory. The last few years have witnessed an explosion of models which couple random aggregation rules, that specify how one adds edges to existing congurations, and choice, wherein one selects from a ‘limited’ set of edges at random to use in the conguration. These models exhibit fascinating new phenomenon, ranging from delaying or speeding up the emergence of the giant component, to percolation", where the diameter of the scaling window is several orders of magnitude smaller than that for standard random graph models. While an intense study of such models has ensued, understanding the actual emergence of the giant component and merging dynamics in the critical scaling window has remained impenetrable to a rigorous analysis. In this work we take an important step in the analysis of such models by studying one of the standard examples of such processes, namely the Bohman-Frieze model, and provide rst results on the asymptotic dynamics, through the critical scaling window, that lead to the emergence of the giant component for such models. We identify the scaling window and show that through this window, the component sizes properly rescaled converge to the standard multiplicative coalescent. Proofs hinge on a careful analysis of certain innite-type branching processes with types taking values in the space of RCLL paths, and stochastic analytic techniques to estimate susceptibility functions of the components all the way through the scaling window where these functions explode. Previous approaches for analyzing random graphs at criticality have relied largely on classical breadth-rst search techniques that exploit asymptotic connections with Brownian excursions. For dynamic random graph models evolving via general Markovian rules, such approaches fail and we develop a quite dierent set of tools that can potentially be used for the study of critical dynamics for all bounded size rules.