메뉴 건너뛰기




Volumn 158, Issue 4, 2015, Pages 853-865

Singularities in the Entropy of Asymptotically Large Simple Graphs

Author keywords

Extremal graphs; Graph limits; Grapon; Phase transition; Random graph

Indexed keywords


EID: 84925519952     PISSN: 00224715     EISSN: 15729613     Source Type: Journal    
DOI: 10.1007/s10955-014-1151-3     Document Type: Article
Times cited : (44)

References (15)
  • 1
    • 84880360620 scopus 로고    scopus 로고
    • Emergent structures in large networks
    • Aristoff, D., Radin, C.: Emergent structures in large networks. J. Appl. Probab. 50, 883–888 (2013)
    • (2013) J. Appl. Probab. , vol.50 , pp. 883-888
    • Aristoff, D.1    Radin, C.2
  • 2
    • 77952958250 scopus 로고    scopus 로고
    • Moments of two-variable functions and the uniqueness of graph limits
    • Borgs, C., Chayes, J., Lovász, L.: Moments of two-variable functions and the uniqueness of graph limits. Geom. Funct. Anal. 19, 1597–1619 (2010)
    • (2010) Geom. Funct. Anal. , vol.19 , pp. 1597-1619
    • Borgs, C.1    Chayes, J.2    Lovász, L.3
  • 3
    • 53349180210 scopus 로고    scopus 로고
    • Convergent graph sequences I: subgraph frequencies, metric properties, and testing
    • Borgs, C., Chayes, J., Lovász, L., Sós, V.T., Vesztergombi, K.: Convergent graph sequences I: subgraph frequencies, metric properties, and testing. Adv. Math. 219, 1801–1851 (2008)
    • (2008) Adv. Math. , vol.219 , pp. 1801-1851
    • Borgs, C.1    Chayes, J.2    Lovász, L.3    Sós, V.T.4    Vesztergombi, K.5
  • 5
    • 84888884588 scopus 로고    scopus 로고
    • Estimating and understanding exponential random graph models
    • Chatterjee, S., Diaconis, P.: Estimating and understanding exponential random graph models. Ann. Stat. 41, 2428–2461 (2013)
    • (2013) Ann. Stat. , vol.41 , pp. 2428-2461
    • Chatterjee, S.1    Diaconis, P.2
  • 6
    • 79960894509 scopus 로고    scopus 로고
    • The large deviation principle for the Erdős-Rényi random graph
    • Chatterjee, S., Varadhan, S.R.S.: The large deviation principle for the Erdős-Rényi random graph. Eur. J. Comb. 32, 1000–1017 (2011)
    • (2011) Eur. J. Comb. , vol.32 , pp. 1000-1017
    • Chatterjee, S.1    Varadhan, S.R.S.2
  • 9
    • 34247643254 scopus 로고    scopus 로고
    • Szemerédi’s lemma for the analyst
    • Lovász, L., Szegedy, B.: Szemerédi’s lemma for the analyst. GAFA 17, 252–270 (2007)
    • (2007) GAFA , vol.17 , pp. 252-270
    • Lovász, L.1    Szegedy, B.2
  • 13
    • 47749131563 scopus 로고    scopus 로고
    • On the minimal density of triangles in graphs
    • Razborov, A.: On the minimal density of triangles in graphs. Combin. Probab. Comput. 17, 603–618 (2008)
    • (2008) Combin. Probab. Comput. , vol.17 , pp. 603-618
    • Razborov, A.1
  • 14
    • 84880390139 scopus 로고    scopus 로고
    • Phase transitions in a complex network
    • Radin, C., Sadun, L.: Phase transitions in a complex network. J. Phys. A: Math. Theor. 46, 305002 (2013)
    • (2013) J. Phys. A: Math. Theor. , vol.46 , pp. 305002
    • Radin, C.1    Sadun, L.2
  • 15
    • 84880343553 scopus 로고    scopus 로고
    • Phase transitions in exponential random graphs
    • Radin, C., Yin, M.: Phase transitions in exponential random graphs. Ann. Appl. Probab. 23, 2458–2471 (2013)
    • (2013) Ann. Appl. Probab. , vol.23 , pp. 2458-2471
    • Radin, C.1    Yin, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.