{"entities":{"Q1917316":{"pageid":1928058,"ns":120,"title":"Item:Q1917316","lastrevid":69298164,"modified":"2026-04-13T06:04:44Z","type":"item","id":"Q1917316","labels":{"en":{"language":"en","value":"A kinetic approach to the random \\(f\\)-graph process. Paths, cycles and components"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 897415"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1917316$162BCA0E-AE66-40E7-A75B-AF3ECB195DF4","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"72910089c7cc540cc66c1e21cc54e44904351259","datavalue":{"value":{"text":"A kinetic approach to the random \\(f\\)-graph process. Paths, cycles and components","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1917316$F05FB27A-AABE-417B-8737-DCCDA7B57A8E","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a5d91c8d82545051fbe02768088d697ec1e93a06","datavalue":{"value":"0857.05084","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1917316$EA8BED43-3466-4C00-B347-3B497A5BB13D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"52d08e0ffbc976b2a81a1977fe4a26650523f890","datavalue":{"value":"10.1016/0166-218X(95)00008-F","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1917316$6AD7AB52-6D1C-4D4E-805A-6137097832F7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"eca535973bbc49eb9279fe5aeb651ab9b5deacbf","datavalue":{"value":{"entity-type":"item","numeric-id":237410,"id":"Q237410"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1917316$8FC34804-BC9F-452E-A148-E124270F5A08","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5fe7c1ab1a00ca78735f467c0cac33f0fd5318b7","datavalue":{"value":{"entity-type":"item","numeric-id":1095950,"id":"Q1095950"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1917316$0FBDFB7A-47EB-42C1-9ADE-34D39AA23F03","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"82f1db23e4145636c0deb11b3cf3f30cc26e8f15","datavalue":{"value":{"entity-type":"item","numeric-id":685645,"id":"Q685645"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1917316$8ECFECF8-C60C-43B8-B42B-01E91E8BE6E7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"07be9e0d33c788c1db213dd6260313f2983a154c","datavalue":{"value":{"entity-type":"item","numeric-id":388659,"id":"Q388659"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1917316$F117EFA4-4E27-4ED7-9A3C-8CC085007663","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087f55844cc920aae060b09644168bf17b022e1a","datavalue":{"value":{"entity-type":"item","numeric-id":96294,"id":"Q96294"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1917316$AF75079C-6A11-4FD1-93E5-B17A728C7084","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ffb759767da9e25ed180753251b692c5922c1d9d","datavalue":{"value":{"time":"+1996-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1917316$F55B3CD9-A692-41CD-8319-84D16CBA4F80","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"12f194319c35528aa200e43914512d8879c3926e","datavalue":{"value":"This paper describes a model of random graphs with bounded degree, called random \\(f\\)-graphs. At each step an edge is added to the graph provided its insertion does not cause the degree of any vertex to exceed \\(f\\). The edge that is added is picked uniformly at random from among all edges that can be added without violating the degree restriction. In the case \\(f=n-1\\), we get the usual random graph model. The authors note that little is known about such graphs. In this paper, the authors study the number of paths, cycles and components of a random 2-graph. The key technique is to model the underlying process with a series of differential equations. The authors also provide the degree distribution of \\(f\\)-graphs for all \\(f\\geq 2\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q1917316$FF5888CA-6E56-4180-AE0F-26BD9445CAEB","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"410981a1afadda812bc680dfed4766e5e039a80f","datavalue":{"value":{"entity-type":"item","numeric-id":581215,"id":"Q581215"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1917316$F7048F84-637D-4A74-ABE2-81422EE82838","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4dd6b8847e09c706889ad9ef05dc0040f1c9f982","datavalue":{"value":"05C80","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1917316$9E9327E3-33FD-4D9E-BDCE-3710CB15CDCB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f3a5e47548ef139717b317f83801cfef606a623d","datavalue":{"value":"05C38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1917316$73CC6EFE-C4B0-4C1F-9431-C5FACBCF07D3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1de0493fc6f7fe4361a54e7c2f5546e4ec52adf0","datavalue":{"value":"05C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1917316$B5012F94-5668-4511-BE47-B2D643635CF7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"727a8cdbfd795292d9193bc52da1f550954d7684","datavalue":{"value":"897415","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1917316$40B026CC-8791-4487-AE4E-597116ADC0A8","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a5b5db980d396f0de31d5cf6273d10ec61f27ab0","datavalue":{"value":"kinetic approach","type":"string"},"datatype":"string"},"type":"statement","id":"Q1917316$39CAAD9C-75FD-491F-9B5C-76DFFB2DC68D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f4f51776dadcb1bfead92cdaa8c678dc729e342b","datavalue":{"value":"random graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1917316$B40AEF64-F470-4BD5-9BB1-46A1D2996F54","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1e865dcf04feef79efcf163ac054d2ac37b7305b","datavalue":{"value":"paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q1917316$4363B0DC-4944-46A0-841F-3BAAA7E9E4E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2dcf267cbc3e04fdcfc3d3761f7ad8ebdabe8c51","datavalue":{"value":"cycles","type":"string"},"datatype":"string"},"type":"statement","id":"Q1917316$A3244E32-0A71-4B79-8C2A-00B24185FCA7","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1917316$C77F55C9-2228-443A-975C-9C2802AEE67F","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"5ef15a1cf71a99e520be34b0bea9f15548ed90d9","datavalue":{"value":{"entity-type":"item","numeric-id":3412732,"id":"Q3412732"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1917316$D6B36A24-7C80-457A-A67B-FCB7969DA285","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"fdfafb03abf75de1d90ac25dd3c3293a3d081389","datavalue":{"value":{"entity-type":"item","numeric-id":3139773,"id":"Q3139773"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1917316$D337D13F-8151-4506-91F1-072AFE7F9623","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"dc2b66961c672c4233b29315a652cf9caa6dd2c9","datavalue":{"value":{"entity-type":"item","numeric-id":5585840,"id":"Q5585840"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1917316$1E6B008F-49C0-4339-B2F5-145B598D5221","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"5b54641b7f4ef119e052e5d019934374e692016f","datavalue":{"value":"https://doi.org/10.1016/0166-218x(95)00008-f","type":"string"},"datatype":"url"},"type":"statement","id":"Q1917316$824C7457-CD68-42F1-8DF8-3B9364BFD6EA","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"211094ec03cba2f3814d4cf9a2745a6c7be07933","datavalue":{"value":"W2078180112","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1917316$932F3DFB-FFAC-45DA-BF92-2503CDD999DA","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"9d08d169343327107b8ab736cacd313d9d85c8ec","datavalue":{"value":{"entity-type":"item","numeric-id":3139773,"id":"Q3139773"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8a2eec3b54114ac825846654e79c0691f613fe5d","datavalue":{"value":{"amount":"+0.8295696973800659","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1917316$1731EEEF-2828-4CA3-9915-F7706310A4E9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"72caf5bb3f2c94a78bbc0745a51dac9a4fb9f309","datavalue":{"value":{"entity-type":"item","numeric-id":4800125,"id":"Q4800125"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c8c16ccc6bddca812288dc41167d8d74a492dd1d","datavalue":{"value":{"amount":"+0.8273221254348755","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1917316$33FAF93F-A900-4963-96F0-25E44912A4EE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fadd2adf33436a151d371f1ca66cb2de9611bfad","datavalue":{"value":{"entity-type":"item","numeric-id":4291211,"id":"Q4291211"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2b0ad2b0f47797a719103ae47590ffd8f3c0dfcf","datavalue":{"value":{"amount":"+0.7838850021362305","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1917316$91E9F183-0A52-4C3A-9044-86F2BCEE9F66","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"dcfe54cebc90003f5b89202fb7f23913ebd173a0","datavalue":{"value":{"entity-type":"item","numeric-id":685646,"id":"Q685646"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f656a23aac816a82f7816be542d2f8f17e613f7a","datavalue":{"value":{"amount":"+0.7835028171539307","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1917316$F14CCE2B-DE7D-4433-B5A9-D79CD87AF562","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A kinetic approach to the random \\(f\\)-graph process. Paths, cycles and components","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_kinetic_approach_to_the_random_%5C(f%5C)-graph_process._Paths,_cycles_and_components"}}}}}