Cargando…
Embedded trees and the support of the ISE
Embedded trees are labelled rooted trees, where the root has zero label and where the labels of adjacent vertices differ (at most) by [Formula: see text]. Recently it has been proved (see Chassaing and Schaeffer (2004) [8] and Janson and Marckert (2005) [11]) that the distribution of the maximum and...
Autor principal: | Drmota, Michael |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4819021/ https://www.ncbi.nlm.nih.gov/pubmed/27087725 http://dx.doi.org/10.1016/j.ejc.2012.07.020 |
Ejemplares similares
-
Random Trees
por: Drmota, Michael
Publicado: (2009) -
Quantum Ising phases and transitions in transverse Ising models
por: Suzuki, Sei, et al.
Publicado: (2013) -
Quantum Ising phases and transitions in transverse Ising models
por: Chakrabarti, Bikas K, et al.
Publicado: (1996) -
Graph limits of random graphs from a subset of connected k‐trees
por: Drmota, Michael, et al.
Publicado: (2018) -
A tree search algorithm towards solving Ising formulated combinatorial optimization problems
por: Cen, Yunuo, et al.
Publicado: (2022)