• Corpus ID: 245144909

Limit of connected multigraph with fixed degree sequence

@inproceedings{BlancRenaudie2021LimitOC,
  title={Limit of connected multigraph with fixed degree sequence},
  author={Arthur Blanc-Renaudie},
  year={2021}
}
Motivated by the scaling limits of the connected components of the configuration model, we study uniform connected multigraphs with fixed degree sequence D and with surplus k. We call those random graphs (D, k)-graphs. We prove that, for every k ∈ N, under natural conditions of convergence of the degree sequence, (D, k)-graphs converge toward either (P , k)-graphs or (Θ, k)-ICRG (inhomogeneous continuum random graphs). We prove similar results for (P , k)-graphs and (Θ, k)-ICRG, which have… 

Figures from this paper

The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses

A very simple bijective proof of Cayley’s formula due to Foata and Fuchs (1970) is presented and some of the ways in which it can be used to derive probabilistic identities, bounds, and growth procedures for random trees with given degrees are explained.

References

SHOWING 1-10 OF 33 REFERENCES

On a conditionally Poissonian graph process

Random (pseudo)graphs G N with the following structure are studied: first, independent and identically distributed capacities Λ i are drawn for vertices i = 1, …, N; then, each pair of vertices (i,

Stable graphs: distributions and line-breaking construction

For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It

Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems

A natural model of inhomogeneous random graphs that extends the classical Erdos-Renyi graphs and shares a close connection with the multiplicative coalescence is considered, which gives a transparent and explicit condition for the compactness of the limit objects and determine their fractal dimensions.

Connected Components in Random Graphs with Given Expected Degree Sequences

Abstract. We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability proportional to the product of the expected degrees of its

Limits of multiplicative inhomogeneous random graphs and Lévy trees: The continuum graphs

Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the

Generating Simple Random Graphs with Prescribed Degree Distribution

Let F be a probability distribution with support on the non-negative integers. Four methods for generating a simple undirected graph with (approximate) degree distribution F are described and

Brownian excursions, critical random graphs and the multiplicative coalescent

Let (B t (s), 0 ≤ s < ∞) be reflecting inhomogeneous Brownian motion with drift t - s at time s, started with B t (0) = 0. Consider the random graph script G sign(n, n -1 + tn -4/3 ), whose largest

Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph

A general program for proving that for a wide class of models, under moment conditions, the nature of this emergence is universal and looks like the classical Erd\H{o}s-R\'enyi random graph, in the sense of the critical scaling window is developed.

A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs

Generating random spanning trees

  • A. Broder
  • Computer Science, Mathematics
    30th Annual Symposium on Foundations of Computer Science
  • 1989
It is shown that the Markov chain on the space of all spanning trees of a given graph where the basic step is an edge swap is rapidly mixing.