When is a graphical sequence stable?:
Abstract: "The function which maps each graphical sequence d to the number of graphs with degree sequence d is considered, with particular attention being directed at the stability of the function under small perturbations in d. In some parts of its domain this function varies smoothly, and in...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1989
|
| Series: | University <Edinburgh> / Dep. of Computer Science: Internal report
309. |
| Subjects: | |
| Summary: | Abstract: "The function which maps each graphical sequence d to the number of graphs with degree sequence d is considered, with particular attention being directed at the stability of the function under small perturbations in d. In some parts of its domain this function varies smoothly, and in other parts erratically. The boundary between these two behaviors is here sharply characterised in terms of the minimum, maximum, and average of the components of d. The result clarifies the range of applicability of some efficient randomised algorithms which sample and count degree-constrained graphs. Furthermore, the result appears to set theoretical limits on the range of validity of asymtotic formulas for the number of graphs with given degree sequence." |
| Physical Description: | 13 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV006575837 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 930210s1989 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)22366498 | ||
| 035 | |a (DE-599)BVBBV006575837 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Jerrum, Mark |d 1955- |e Verfasser |0 (DE-588)12443133X |4 aut | |
| 245 | 1 | 0 | |a When is a graphical sequence stable? |c by Mark Jerrum, Brendan McKay and Alistair Sinclair |
| 264 | 1 | |a Edinburgh |c 1989 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Dep. of Computer Science: Internal report |v 309. | |
| 520 | 3 | |a Abstract: "The function which maps each graphical sequence d to the number of graphs with degree sequence d is considered, with particular attention being directed at the stability of the function under small perturbations in d. In some parts of its domain this function varies smoothly, and in other parts erratically. The boundary between these two behaviors is here sharply characterised in terms of the minimum, maximum, and average of the components of d. The result clarifies the range of applicability of some efficient randomised algorithms which sample and count degree-constrained graphs. Furthermore, the result appears to set theoretical limits on the range of validity of asymtotic formulas for the number of graphs with given degree sequence." | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Information theory |2 sigle | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Graph theory |x Data processing | |
| 650 | 4 | |a Mappings (Mathematics) | |
| 700 | 1 | |a MacKay, Brendan |e Verfasser |4 aut | |
| 700 | 1 | |a Sinclair, Alistair |e Verfasser |4 aut | |
| 810 | 2 | |a Dep. of Computer Science: Internal report |t University <Edinburgh> |v 309. |w (DE-604)BV006185380 |9 309 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-004195677 | |
Record in the Search Index
| _version_ | 1820882564851695616 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Jerrum, Mark 1955- MacKay, Brendan Sinclair, Alistair |
| author_GND | (DE-588)12443133X |
| author_facet | Jerrum, Mark 1955- MacKay, Brendan Sinclair, Alistair |
| author_role | aut aut aut |
| author_sort | Jerrum, Mark 1955- |
| author_variant | m j mj b m bm a s as |
| building | Verbundindex |
| bvnumber | BV006575837 |
| classification_rvk | SS 5570 |
| ctrlnum | (OCoLC)22366498 (DE-599)BVBBV006575837 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV006575837</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">930210s1989 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22366498</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006575837</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jerrum, Mark</subfield><subfield code="d">1955-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12443133X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">When is a graphical sequence stable?</subfield><subfield code="c">by Mark Jerrum, Brendan McKay and Alistair Sinclair</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Dep. of Computer Science: Internal report</subfield><subfield code="v">309.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The function which maps each graphical sequence d to the number of graphs with degree sequence d is considered, with particular attention being directed at the stability of the function under small perturbations in d. In some parts of its domain this function varies smoothly, and in other parts erratically. The boundary between these two behaviors is here sharply characterised in terms of the minimum, maximum, and average of the components of d. The result clarifies the range of applicability of some efficient randomised algorithms which sample and count degree-constrained graphs. Furthermore, the result appears to set theoretical limits on the range of validity of asymtotic formulas for the number of graphs with given degree sequence."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information theory</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mappings (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">MacKay, Brendan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sinclair, Alistair</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dep. of Computer Science: Internal report</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">309.</subfield><subfield code="w">(DE-604)BV006185380</subfield><subfield code="9">309</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004195677</subfield></datafield></record></collection> |
| id | DE-604.BV006575837 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T17:08:55Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004195677 |
| oclc_num | 22366498 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | University <Edinburgh> / Dep. of Computer Science: Internal report |
| spelling | Jerrum, Mark 1955- Verfasser (DE-588)12443133X aut When is a graphical sequence stable? by Mark Jerrum, Brendan McKay and Alistair Sinclair Edinburgh 1989 13 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Dep. of Computer Science: Internal report 309. Abstract: "The function which maps each graphical sequence d to the number of graphs with degree sequence d is considered, with particular attention being directed at the stability of the function under small perturbations in d. In some parts of its domain this function varies smoothly, and in other parts erratically. The boundary between these two behaviors is here sharply characterised in terms of the minimum, maximum, and average of the components of d. The result clarifies the range of applicability of some efficient randomised algorithms which sample and count degree-constrained graphs. Furthermore, the result appears to set theoretical limits on the range of validity of asymtotic formulas for the number of graphs with given degree sequence." Computer software sigle Information theory sigle Datenverarbeitung Graph theory Data processing Mappings (Mathematics) MacKay, Brendan Verfasser aut Sinclair, Alistair Verfasser aut Dep. of Computer Science: Internal report University <Edinburgh> 309. (DE-604)BV006185380 309 |
| spellingShingle | Jerrum, Mark 1955- MacKay, Brendan Sinclair, Alistair When is a graphical sequence stable? Computer software sigle Information theory sigle Datenverarbeitung Graph theory Data processing Mappings (Mathematics) |
| title | When is a graphical sequence stable? |
| title_auth | When is a graphical sequence stable? |
| title_exact_search | When is a graphical sequence stable? |
| title_full | When is a graphical sequence stable? by Mark Jerrum, Brendan McKay and Alistair Sinclair |
| title_fullStr | When is a graphical sequence stable? by Mark Jerrum, Brendan McKay and Alistair Sinclair |
| title_full_unstemmed | When is a graphical sequence stable? by Mark Jerrum, Brendan McKay and Alistair Sinclair |
| title_short | When is a graphical sequence stable? |
| title_sort | when is a graphical sequence stable |
| topic | Computer software sigle Information theory sigle Datenverarbeitung Graph theory Data processing Mappings (Mathematics) |
| topic_facet | Computer software Information theory Datenverarbeitung Graph theory Data processing Mappings (Mathematics) |
| volume_link | (DE-604)BV006185380 |
| work_keys_str_mv | AT jerrummark whenisagraphicalsequencestable AT mackaybrendan whenisagraphicalsequencestable AT sinclairalistair whenisagraphicalsequencestable |