On the number of non-zero elements of joint degree vectors
| Autor: | Czabarka, É, Sadeghi, K., Johannes Rauh, Short, T., Székely, L. |
|---|---|
| Přispěvatelé: | Apollo - University of Cambridge Repository |
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
degree sequence
05 62 joint degree matrix Applied Mathematics 01 natural sciences Theoretical Computer Science 010305 fluids & plasmas bidegree distribution joint degree distribution Computational Theory and Mathematics 0103 physical sciences FOS: Mathematics Discrete Mathematics and Combinatorics Mathematics - Combinatorics joint degree vector Combinatorics (math.CO) Geometry and Topology exponential random graph model 010306 general physics |
| Zdroj: | Scopus-Elsevier |
| DOI: | 10.17863/cam.9500 |
| Popis: | Joint degree vectors give the number of edges between vertices of degree $i$ and degree $j$ for $1\le i\le j\le n-1$ in an $n$-vertex graph. We find lower and upper bounds for the maximum number of nonzero elements in a joint degree vector as a function of $n$. This provides an upper bound on the number of estimable parameters in the exponential random graph model with bidegree-distribution as its sufficient statistics. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|