<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="wordpress.com" -->
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:image="http://www.google.com/schemas/sitemap-image/1.1" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd"><url><loc>https://manashardas.com/2015/01/30/setting-up-a-data-science-environment-on-mac-osx/</loc><lastmod>2015-01-30T00:16:45+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://manashardas.com/2015/01/20/dockerized-recommender-app-using-graphlab-create-and-mongodb-part-1/</loc><lastmod>2015-01-20T06:13:18+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://manashardas.com/2014/10/07/does-algorithm-preceed-product-feature-or-vice-versa/</loc><lastmod>2014-10-07T21:49:12+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://manashardas.com/research/</loc><lastmod>2014-09-02T20:47:56+00:00</lastmod><changefreq>weekly</changefreq><priority>0.6</priority></url><url><loc>https://manashardas.com/publications/</loc><lastmod>2014-08-27T05:52:32+00:00</lastmod><changefreq>weekly</changefreq><priority>0.6</priority></url><url><loc>https://manashardas.com/other-publications/</loc><lastmod>2014-08-25T23:20:32+00:00</lastmod><changefreq>weekly</changefreq><priority>0.6</priority></url><url><loc>https://manashardas.com/2013/12/19/how-many-stars-are-enough-to-rate-an-item/</loc><lastmod>2013-12-19T02:38:55+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://manashardas.com/2013/12/15/how-to-rank-things-based-on-votes/</loc><image:image><image:loc>https://manashardas.com/wp-content/uploads/2013/12/wilson-var-c.png</image:loc><image:title>wilson-var-C</image:title><image:caption>Wilsons scores for different values of damping factor C. </image:caption></image:image><lastmod>2013-12-15T19:58:44+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://manashardas.com/about/</loc><lastmod>2013-10-11T20:37:08+00:00</lastmod><changefreq>weekly</changefreq><priority>0.6</priority></url><url><loc>https://manashardas.com/2013/09/26/using-wilsons-algorithm-to-rank-ideas/</loc><lastmod>2013-09-26T20:22:17+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://manashardas.com/2013/09/26/entropy-of-a-crowd-network/</loc><image:image><image:loc>https://manashardas.com/wp-content/uploads/2013/09/fig1.png</image:loc><image:title>fig1</image:title><image:caption>Figure shows the behavior of structural parameters plotted against the increasing cumulative entropy of the network. For all the networks the number of nodes n=100 and the weighing parameter is constant at . The link density probability (p) is varied from 0.5 to 0.9. For all values of , the parameters display more or less linear  behavior. (a) The increase in the entropy is brought about by increase in the number of active links (m) in the network (b) shows as the number of links increases so does the clustering coefficient along with the network entropy, (c) shows the decrease in the average shortest path length along with the network entropy (d) shows number of disconnected components very quickly decreases to 1 forming a single giant component with increasing network entropy. In all cases after an initial sudden
increase/decrease the values quickly normalize to the theoretical limits. </image:caption></image:image><lastmod>2013-09-25T23:56:46+00:00</lastmod><changefreq>monthly</changefreq></url><url><loc>https://manashardas.com</loc><changefreq>daily</changefreq><priority>1.0</priority><lastmod>2015-01-30T00:16:45+00:00</lastmod></url></urlset>
