{"data":{"id":"10.6084/m9.figshare.1064360.v1","type":"dois","attributes":{"doi":"10.6084/m9.figshare.1064360.v1","prefix":"10.6084","suffix":"m9.figshare.1064360.v1","identifiers":[],"alternateIdentifiers":[],"creators":[{"name":"Jingfei Zhang","affiliation":[],"nameIdentifiers":[]},{"name":"Yuguo Chen","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Monte Carlo Algorithms for Identifying Densely Connected Subgraphs"}],"publisher":"Taylor \u0026 Francis","container":{},"publicationYear":2015,"subjects":[{"subject":"Science Policy"},{"subject":"Cancer"},{"subject":"Mathematics"},{"subject":"FOS: Mathematics","schemeUri":"http://www.oecd.org/science/inno/38235147.pdf","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"FOS: Mathematics","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"Information and Computing Sciences"},{"subject":"Biological Sciences"},{"subject":"Evolutionary Biology"},{"subject":"FOS: Biological sciences","schemeUri":"http://www.oecd.org/science/inno/38235147.pdf","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"FOS: Biological sciences","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"Physics"}],"contributors":[],"dates":[{"date":"2015-07-03","dateType":"Created"},{"date":"2016-01-19","dateType":"Updated"},{"date":"2015","dateType":"Issued"}],"language":null,"types":{"ris":"DATA","bibtex":"misc","citeproc":"dataset","schemaOrg":"Dataset","resourceType":"Dataset","resourceTypeGeneral":"Dataset"},"relatedIdentifiers":[{"relationType":"IsSupplementTo","relatedIdentifier":"10.1080/10618600.2014.930040","relatedIdentifierType":"DOI"},{"relationType":"IsPreviousVersionOf","relatedIdentifier":"10.6084/m9.figshare.1064360","relatedIdentifierType":"DOI"}],"relatedItems":[],"sizes":["238508 Bytes"],"formats":[],"version":null,"rightsList":[{"rights":"Creative Commons Attribution 4.0 International","rightsUri":"https://creativecommons.org/licenses/by/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rightsIdentifier":"cc-by-4.0","rightsIdentifierScheme":"SPDX"}],"descriptions":[{"description":"The problem of finding densely connected subgraphs in a network has attracted a lot of recent interest. Such subgraphs are sometimes referred to as communities in social networks or molecular modules in protein networks. In this article, we propose two Monte Carlo optimization algorithms for identifying the densest subgraphs with a fixed size or with size in a given range. The new algorithms combine the idea of simulated annealing and efficient moves for the Markov chain, and both algorithms are shown to converge to the set of optimal states (densest subgraphs) with probability one. When applied to a yeast protein interaction network and a stock market graph, the algorithms identify interesting new densely connected subgraphs. Supplemental materials for the article are available online.","descriptionType":"Abstract"}],"geoLocations":[],"fundingReferences":[],"xml":"PD94bWwgdmVyc2lvbj0iMS4wIiBlbmNvZGluZz0iVVRGLTgiPz4KPHJlc291cmNlIHhtbG5zPSJodHRwOi8vZGF0YWNpdGUub3JnL3NjaGVtYS9rZXJuZWwtNCIgeG1sbnM6eHNpPSJodHRwOi8vd3d3LnczLm9yZy8yMDAxL1hNTFNjaGVtYS1pbnN0YW5jZSIgeHNpOnNjaGVtYUxvY2F0aW9uPSJodHRwOi8vZGF0YWNpdGUub3JnL3NjaGVtYS9rZXJuZWwtNCBodHRwOi8vc2NoZW1hLmRhdGFjaXRlLm9yZy9tZXRhL2tlcm5lbC00LjEvbWV0YWRhdGEueHNkIj4KICA8aWRlbnRpZmllciBpZGVudGlmaWVyVHlwZT0iRE9JIj4xMC42MDg0L005LkZJR1NIQVJFLjEwNjQzNjAuVjE8L2lkZW50aWZpZXI+CiAgPGNyZWF0b3JzPgogICAgPGNyZWF0b3I+CiAgICAgIDxjcmVhdG9yTmFtZT5KaW5nZmVpIFpoYW5nPC9jcmVhdG9yTmFtZT4KICAgIDwvY3JlYXRvcj4KICAgIDxjcmVhdG9yPgogICAgICA8Y3JlYXRvck5hbWU+WXVndW8gQ2hlbjwvY3JlYXRvck5hbWU+CiAgICA8L2NyZWF0b3I+CiAgPC9jcmVhdG9ycz4KICA8dGl0bGVzPgogICAgPHRpdGxlPk1vbnRlIENhcmxvIEFsZ29yaXRobXMgZm9yIElkZW50aWZ5aW5nIERlbnNlbHkgQ29ubmVjdGVkIFN1YmdyYXBoczwvdGl0bGU+CiAgPC90aXRsZXM+CiAgPGRlc2NyaXB0aW9ucz4KICAgIDxkZXNjcmlwdGlvbiBkZXNjcmlwdGlvblR5cGU9IkFic3RyYWN0Ij4mbHQ7ZGl2Jmd0OyZsdDtwJmd0O1RoZSBwcm9ibGVtIG9mIGZpbmRpbmcgZGVuc2VseSBjb25uZWN0ZWQgc3ViZ3JhcGhzIGluIGEgbmV0d29yayBoYXMgYXR0cmFjdGVkIGEgbG90IG9mIHJlY2VudCBpbnRlcmVzdC4gU3VjaCBzdWJncmFwaHMgYXJlIHNvbWV0aW1lcyByZWZlcnJlZCB0byBhcyBjb21tdW5pdGllcyBpbiBzb2NpYWwgbmV0d29ya3Mgb3IgbW9sZWN1bGFyIG1vZHVsZXMgaW4gcHJvdGVpbiBuZXR3b3Jrcy4gSW4gdGhpcyBhcnRpY2xlLCB3ZSBwcm9wb3NlIHR3byBNb250ZSBDYXJsbyBvcHRpbWl6YXRpb24gYWxnb3JpdGhtcyBmb3IgaWRlbnRpZnlpbmcgdGhlIGRlbnNlc3Qgc3ViZ3JhcGhzIHdpdGggYSBmaXhlZCBzaXplIG9yIHdpdGggc2l6ZSBpbiBhIGdpdmVuIHJhbmdlLiBUaGUgbmV3IGFsZ29yaXRobXMgY29tYmluZSB0aGUgaWRlYSBvZiBzaW11bGF0ZWQgYW5uZWFsaW5nIGFuZCBlZmZpY2llbnQgbW92ZXMgZm9yIHRoZSBNYXJrb3YgY2hhaW4sIGFuZCBib3RoIGFsZ29yaXRobXMgYXJlIHNob3duIHRvIGNvbnZlcmdlIHRvIHRoZSBzZXQgb2Ygb3B0aW1hbCBzdGF0ZXMgKGRlbnNlc3Qgc3ViZ3JhcGhzKSB3aXRoIHByb2JhYmlsaXR5IG9uZS4gV2hlbiBhcHBsaWVkIHRvIGEgeWVhc3QgcHJvdGVpbiBpbnRlcmFjdGlvbiBuZXR3b3JrIGFuZCBhIHN0b2NrIG1hcmtldCBncmFwaCwgdGhlIGFsZ29yaXRobXMgaWRlbnRpZnkgaW50ZXJlc3RpbmcgbmV3IGRlbnNlbHkgY29ubmVjdGVkIHN1YmdyYXBocy4gU3VwcGxlbWVudGFsIG1hdGVyaWFscyBmb3IgdGhlIGFydGljbGUgYXJlIGF2YWlsYWJsZSBvbmxpbmUuJmx0Oy9wJmd0OyZsdDsvZGl2Jmd0OzwvZGVzY3JpcHRpb24+CiAgPC9kZXNjcmlwdGlvbnM+CiAgPHN1YmplY3RzPgogICAgPHN1YmplY3Q+U2NpZW5jZSBQb2xpY3k8L3N1YmplY3Q+CiAgICA8c3ViamVjdD5DYW5jZXI8L3N1YmplY3Q+CiAgICA8c3ViamVjdD5NYXRoZW1hdGljczwvc3ViamVjdD4KICAgIDxzdWJqZWN0PkluZm9ybWF0aW9uIGFuZCBDb21wdXRpbmcgU2NpZW5jZXM8L3N1YmplY3Q+CiAgICA8c3ViamVjdD5CaW9sb2dpY2FsIFNjaWVuY2VzPC9zdWJqZWN0PgogICAgPHN1YmplY3Q+RXZvbHV0aW9uYXJ5IEJpb2xvZ3k8L3N1YmplY3Q+CiAgICA8c3ViamVjdD5QaHlzaWNzPC9zdWJqZWN0PgogIDwvc3ViamVjdHM+CiAgPHB1Ymxpc2hlcj5UYXlsb3IgJmFtcDsgRnJhbmNpczwvcHVibGlzaGVyPgogIDxwdWJsaWNhdGlvblllYXI+MjAxNTwvcHVibGljYXRpb25ZZWFyPgogIDxkYXRlcz4KICAgIDxkYXRlIGRhdGVUeXBlPSJDcmVhdGVkIj4yMDE1LTA3LTAzPC9kYXRlPgogICAgPGRhdGUgZGF0ZVR5cGU9IlVwZGF0ZWQiPjIwMTYtMDEtMTk8L2RhdGU+CiAgPC9kYXRlcz4KICA8cmVzb3VyY2VUeXBlIHJlc291cmNlVHlwZUdlbmVyYWw9IkRhdGFzZXQiPkRhdGFzZXQ8L3Jlc291cmNlVHlwZT4KICA8c2l6ZXM+CiAgICA8c2l6ZT4yMzg1MDggQnl0ZXM8L3NpemU+CiAgPC9zaXplcz4KICA8cmVsYXRlZElkZW50aWZpZXJzPgogICAgPHJlbGF0ZWRJZGVudGlmaWVyIHJlbGF0ZWRJZGVudGlmaWVyVHlwZT0iRE9JIiByZWxhdGlvblR5cGU9IklzU3VwcGxlbWVudFRvIj4xMC4xMDgwLzEwNjE4NjAwLjIwMTQuOTMwMDQwPC9yZWxhdGVkSWRlbnRpZmllcj4KICAgIDxyZWxhdGVkSWRlbnRpZmllciByZWxhdGVkSWRlbnRpZmllclR5cGU9IkRPSSIgcmVsYXRpb25UeXBlPSJJc1ByZXZpb3VzVmVyc2lvbk9mIj4xMC42MDg0L205LmZpZ3NoYXJlLjEwNjQzNjA8L3JlbGF0ZWRJZGVudGlmaWVyPgogIDwvcmVsYXRlZElkZW50aWZpZXJzPgogIDxyaWdodHNMaXN0PgogICAgPHJpZ2h0cyByaWdodHNVUkk9Imh0dHBzOi8vY3JlYXRpdmVjb21tb25zLm9yZy9saWNlbnNlcy9ieS80LjAvIj5DQyBCWSA0LjA8L3JpZ2h0cz4KICA8L3JpZ2h0c0xpc3Q+CjwvcmVzb3VyY2U+","url":"https://tandf.figshare.com/articles/dataset/Monte_Carlo_Algorithms_for_Identifying_Densely_Connected_Subgraphs/1064360/1","contentUrl":null,"metadataVersion":3,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"viewsOverTime":[],"downloadCount":0,"downloadsOverTime":[],"referenceCount":0,"citationCount":0,"citationsOverTime":[],"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2016-01-19T03:21:14.000Z","registered":"2016-01-19T03:21:15.000Z","published":"2015","updated":"2020-09-04T22:40:44.000Z"},"relationships":{"client":{"data":{"id":"figshare.ars","type":"clients"}},"provider":{"data":{"id":"otjm","type":"providers"}},"media":{"data":{"id":"10.6084/m9.figshare.1064360.v1","type":"media"}},"references":{"data":[]},"citations":{"data":[]},"parts":{"data":[]},"partOf":{"data":[]},"versions":{"data":[]},"versionOf":{"data":[]}}}}