Threshold Graph Limits and Random Threshold Graphs
From MaRDI portal
Publication:3400888
DOI10.1080/15427951.2008.10129166zbMath1184.68356arXiv0908.2448OpenAlexW2029972636WikidataQ41839091 ScholiaQ41839091MaRDI QIDQ3400888
Persi Diaconis, Svante Janson, Susan P. Holmes
Publication date: 27 January 2010
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.2448
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Finitely forcible graph limits are universal, Betti numbers and anti-lecture Hall compositions of random threshold graphs, A graphon counter example, Decomposition of tournament limits, From quasirandom graphs to graph limits and graphlets, Random cographs: Brownian graphon limit and asymptotic degree distribution, Random threshold digraphs, Graph limits and hereditary properties, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, Graph sequences sampled from Robinson graphons, Interval graph limits, Random graphs with a given degree sequence, On String Graph Limits and the Structure of a Typical String Graph, Finitely forcible graphons with an almost arbitrary structure, Limits of randomly grown graph sequences, Quasi-random graphs and graph limits, Eigenvalues and energy in threshold graphs, Semantic limits of dense combinatorial objects, Random Walks on Dense Graphs and Graphons, Finitely forcible graphons, Continuous-time quantum walks on the threshold network model, Paired threshold graphs, Oriented Threshold Graphs, Weak regularity and finitely forcible graph limits, Compactness and finite forcibility of graphons, Fast algorithms for computing the characteristic polynomial of threshold and chain graphs, Linear embeddings of graphs and graph limits, Counting Labeled Threshold Graphs with Eulerian Numbers
Uses Software