Asymptotic Quantization of Exponential Random Graphs
نویسندگان
چکیده
We describe the asymptotic properties of the edge-triangle exponential random graph model as the natural parameters diverge along straight lines. We show that as we continuously vary the slopes of these lines, a typical graph drawn from this model exhibits quantized behavior, jumping from one complete multipartite graph to another, and the jumps happen precisely at the normal lines of a polyhedral set with infinitely many facets. As a result, we provide a complete description of all asymptotic extremal behaviors of the model.
منابع مشابه
The Importance Sampling Technique for Understanding Rare Events in Erdős-rényi Random Graphs
In dense Erdős-Rényi random graphs, we are interested in the events where large numbers of a given subgraphs occur. The mean behaviour of subgraph counts is known, and only recently were the related large deviations results discovered. Consequently, it is natural to ask, what is the probability of an Erdős-Rényi graph containing an excessively large number of a given subgraph? Using the large d...
متن کاملA Detailed Investigation into near Degenerate Exponential Random Graphs
The exponential family of random graphs has been a topic of continued research interest. Despite the relative simplicity, these models capture a variety of interesting features displayed by large-scale networks and allow us to better understand how phases transition between one another as tuning parameters vary. As the parameters cross certain lines, the model asymptotically transitions from a ...
متن کاملAsymptotic structure and singularities in constrained directed graphs
We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward p-stars. Our models are close cousins of exponential random graph models, in which edges and certain other subgraph densities are controlled by parameters. We find that large graphs have either uniform or bipodal structure. When edge density (resp. p-star density) is fixed and p-star...
متن کاملThe Diameter of Weighted Random Graphs
In this paper, we study the impact of the introduction of edge weights on the typical distances in a random graph and, in particular, on its diameter. Our main result consists of a precise asymptotic expression for the (edge) diameter of sparse random graphs on n vertices (under some standard regularity conditions) when the edge weights are i.i.d. exponential random variables of rate one.
متن کاملGraph classes with given 3-connected components: Asymptotic enumeration and random graphs
Consider a family T of 3-connected graphs of moderate growth, and let G be the class of graphs whose 3-connected components are graphs in T . We present a general framework for analyzing such graphs classes based on singularity analysis of generating functions, which generalizes previously studied cases such as planar graphs and series-parallel graphs. We provide a general result for the asympt...
متن کامل