Threshold graph limits andrandom threshold graphs

Internet Mathematics

Volumn 5, Issue 3, 2008, Pages 267-320

  Diaconis, Persi ^a   Holmes, Susan ^a   Janson, Svante ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79251620164     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2008.10129166     Document Type: Article

References (33)

1. D. Aldous. Exchangeability and Related Topics, Lecture Notes in Mathematics1117. Berlin: Springer, 1985.
2. J. S. Beissinger and U. N. Peled. “Enumeration of LabelledThreshold Graphs and a Theorem of Frobenius Involving Eulerian Polynomials.”Graphs Combin. 3:3 (1987), 213–219.
3. P. Billingsley. Convergence of Probability Measures. New York: Wiley 1968.
4. C. Borgs, J. T. Chayes, and L. Lovász. “Unique Limits of DenseGraph Sequences.” Preprint, arxiv.org/math/0803.1244v1, 2007.
5. C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi.“Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Propertiesand Testing.” Preprint, arxiv.org/math.CO/0702004, 2007.
6. A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: ASurvey. Philadelphia: SIAM, 1999.
7. K. Brown and P. Diaconis. “Random Walks and HyperplaneArrangements.” Ann. Probab. 26:4 (1998), 1813–1854.
8. V. Chvátal and P. L. Hammer. “Aggregation of Inequalitiesin Integer Programming.” In Studies in Integer Programming, Annals of DiscreteMathematics 1, pp. 145–162. Amsterdam: North-Holland, 1977.
9. G. Davidoff, P. Sarnak, and A. Valette. Elementary Number Theory,Group Theory, and Ramanujan Graphs, London Mathematical Society StudentTexts 55. Cambridge, UK: Cambridge University Press, 2003.
10. P. Diaconis and S. Janson. “Graph Limits and ExchangeableRandom Graphs.” Rendiconti di Matematica 28:VII (2008), 33–61.
11. P. Erdős, A. Gyárfás, E. T. Ordman, and Y. Zalcstein. “The Size ofChordal, Interval and Threshold Subgraphs.” Combinatorica 9 (1989), 245–253.
12. P. Flajolet and R. Sedgewick. Analytic Combinatorics.Cambridge, UK: Cambridge University Press, 2009.
13. A. Gut. Probability: A Graduate Course. New York: Springer, 2005.
14. A. Gut and S. Janson. “The Limiting Behaviour of CertainStopped Sums and Some Applications.” Scand. J. Statist. 10:4 (1983), 281–292.
15. A. Hagberg, P. J. Swart, and D. A. Schult. “Designing ThresholdNetworks with Given Structural and Dynamical Properties.” Phys. Rev. E 74 (2006),056116.
16. P. L. Hammer and A. K. Kelmans. “Laplacian Spectra andSpanning Trees of Threshold Graphs.” Discrete Appl. Math. 65:1–3 (1996), 255–273.
17. P. L. Hammer, U. N. Peled, and X. Sun. “Difference Graphs.”Discrete Appl. Math. 28:1 (1990), 35–44.
18. D. Jakobson, S. D. Miller, I. Rivin, and Z. Rudnick. “EigenvalueSpacings for Regular Graphs.” In Emerging Applications of Number Theory, TheIMA Volumes in Mathematics and its Applications 109, pp. 317–327. New York:Springer, 1999.
19. O. Kallenberg. Foundations of Modern Probability, Second edition.New York: Springer, 2002.
20. O. Kallenberg. Probabilistic Symmetries and Invariance Principles.New York: Springer, 2005.
21. N. Konno, N. Masuda, R. Roy, and A. Sarkar. “Rigorous Results onthe Threshold Network Model.” Journal of Physics A 38 (2005), 6277–6291.
22. L. Lovász and B. Szegedy. “Limits of Dense Graph Sequences.”J. Comb. Theory B 96 (2006), 933–957.
23. L. Lovász and B. Szegedy. “Finitely Forcible Graphons.”Preprint, arxiv.org/math/0901.0929v1, 2009.
24. L. Lu and F. R. K. Chung. Complex Graphs and Networks. Providence,RI: American Mathematical Society, 2006.
25. N. Mahadev and U. Peled. Threshold Graphs and Related Topics, Annals of Discrete Mathematics 56. Amserdam: North-Holland-Elsevier, 1995.
26. N. Masuda, H. Miwa, and N. Konno. “Geographical ThresholdGraphs with Small-World and Scale-Free Properties.” Physical Review E 71 (2005),036108.
27. T. A. McKee and F. R. McMorris. Topics in IntersectionGraph Theory. Philadelphia: SIAM, 1999.
28. R. Merris. Laplacian Matrices of Graphs: A Survey. Linear Algebra Appl.197/198 (1994), 143–176.
29. R. Merris and T. Roby. “The Lattice of Threshold Graphs.”JIPAM. J. Inequal. Pure Appl. Math. 6:1 (2005), Article 2, 21 pp.
30. M. Mitzenmacher. “A Brief History of Generative Models for PowerLaw and Lognormal Distributions.” Internet Mathematics 1 (2004), 226–251.
31. M. Penrose. Random Geometric Graphs. Oxford, UK: Oxford UniversityPress, 2003.
32. N. J. A. Sloane. The On-Line Encyclopedia of Integer Sequences. Availableat http://www.research.att.com/∼njas/sequences/, 2009.
33. M. Yannakakis. “The Complexity of the Partial Order DimensionProblem.” SIAM J. Algebraic Discrete Methods 3:3 (1982), 351–358.