{"entities":{"Q7361908":{"pageid":31521263,"ns":120,"title":"Item:Q7361908","lastrevid":105370352,"modified":"2026-10-07T13:39:08Z","type":"item","id":"Q7361908","labels":{"en":{"language":"en","value":"Properties of Random Graphs -- Subgraph Containment"}},"descriptions":{"en":{"language":"en","value":"AFP entry Random_Graph_Subgraph_Threshold"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"eeaf7dd639274c1cf3660b579579183887b654cf","datavalue":{"value":"https://isa-afp.org/entries/Random_Graph_Subgraph_Threshold.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361908$5C28E866-BF7E-4CAE-9EA9-B1F58396C6CE","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"39863cb9a49d531a7739599a93bf5ec709560fa4","datavalue":{"value":{"time":"+2014-02-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361908$B4CF7206-3740-4687-99F5-B7FE818FFB54","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"bf5d485796582ea615cfd5e7c0148e1add1641d3","datavalue":{"value":"Lars Hupel","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361908$59F807FF-8169-4493-A203-290DE74C2520","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"45057c6b1029d3eceaa72a46589bd5549c099102","datavalue":{"value":{"text":"Properties of Random Graphs -- Subgraph Containment","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361908$8608173C-C044-4FB0-B3CF-24C890E183A7","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"65780ab56d77e433b4d6c6654484f27ea902c0d6","datavalue":{"value":"Random graphs are graphs with a fixed number of vertices, where each edge is present with a fixed probability. We are interested in the probability that a random graph contains a certain pattern, for example a cycle or a clique. A very high edge probability gives rise to perhaps too many edges (which degrades performance for many algorithms), whereas a low edge probability might result in a disconnected graph. We prove a theorem about a threshold probability such that a higher edge probability will asymptotically almost surely produce a random graph with the desired subgraph.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361908$07D5A3AA-6D45-4638-ADE8-D4D90F8A9080","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"edd227013a96dd65d0289b90d93ff4bba0dd80ab","datavalue":{"value":{"entity-type":"item","numeric-id":3286850,"id":"Q3286850"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361908$B11AE59C-88E3-4D03-BCF8-C8F59E496676","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"746c848c1a777ca7c05056491f34cd7aeedd8f44","datavalue":{"value":{"entity-type":"item","numeric-id":2914757,"id":"Q2914757"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361908$32D4D0F9-A1D4-416B-B37F-E2F64B2A3EF3","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361908$2ECCEFD2-E512-4BBD-AB43-9617DFFD5B1A","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"8d9d0c26c1c111d89fe16b977a089859cc1a5f26","datavalue":{"value":{"entity-type":"item","numeric-id":7361891,"id":"Q7361891"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361908$DEF4FD95-8797-48BD-ACEE-84840DEDC883","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"f3718ba60fb3ca54d1e75bc16696ddd7ca207e99","datavalue":{"value":{"entity-type":"item","numeric-id":7360827,"id":"Q7360827"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361908$673C2A4E-89B5-4929-A511-C431BD01FCC4","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361908$BF1937C2-5562-4AD3-BAF4-C1E089DB9786","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Properties of Random Graphs -- Subgraph Containment","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Properties_of_Random_Graphs_--_Subgraph_Containment"}}}}}