http://www.bibsonomy.org/burst/user/schmitz/smallworldBibSonomy BuRST Feed for /user/schmitz/smallworld2008-07-21T01:35:24+02:00http://www.bibsonomy.org/bibtex/2e5427464b2bd3f54c97165b9110863eb/schmitzschmitz2007-09-18T11:30:48+02:00socialnetwork smallworld scalefree network graphtheory <span style="color:#555555;">S. N. <a href="http://www.bibsonomy.org/author/Dorogovtsev">Dorogovtsev</a> and J. F. F. <a href="http://www.bibsonomy.org/author/Mendes">Mendes</a> and A. N. <a href="http://www.bibsonomy.org/author/Samukhin">Samukhin</a> </span><em>Phys. Rev. E</em><em>63(6):062101</em><em>May2001. </em>Tue Sep 18 11:30:48 CEST 2007Phys. Rev. EMay6062101Size-dependent degree distribution of a scale-free growing network632001socialnetwork smallworld scalefree network graphtheory http://www.bibsonomy.org/bibtex/2716ccd1d5ceb03e718d8f60ab1a81ca6/schmitzschmitz2007-09-13T10:55:36+02:00graphtheory smallworld <span style="color:#555555;">Frigyes <a href="http://www.bibsonomy.org/author/Karinthy">Karinthy</a> </span>(<em>1929</em>)Thu Sep 13 10:55:36 CEST 2007Chain-Links1929graphtheory smallworld gcalda's bookhttp://www.bibsonomy.org/bibtex/2d4e8b5ed20176eb6cb50101fdb8ab95b/schmitzschmitz2007-03-22T18:19:00+01:00mining smallworld graphtheory community <span style="color:#555555;">A. <a href="http://www.bibsonomy.org/author/Capocci">Capocci</a> and V. D. P. <a href="http://www.bibsonomy.org/author/Servedio">Servedio</a> and G. <a href="http://www.bibsonomy.org/author/Caldarelli">Caldarelli</a> and F. <a href="http://www.bibsonomy.org/author/Colaiori">Colaiori</a> </span><em>Physica A: Statistical and Theoretical Physics</em><em>352(2-4):669--676</em><em>July2005. </em>Thu Mar 22 18:19:00 CET 2007Physica A: Statistical and Theoretical PhysicsJuly2-4669--676Detecting communities in large networks3522005mining smallworld graphtheory community We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and link orientation. Since the method detects efficiently clustered nodes in large networks even when these are not sharply partitioned, it turns to be specially suitable for the analysis of social and information networks. We test the algorithm on a large-scale data-set from a psychological experiment of word association. In this case, it proves to be successful both in clustering words, and in uncovering mental association patterns.http://www.bibsonomy.org/bibtex/28f80a8586927ea69ea915b6c32e87629/schmitzschmitz2007-03-22T17:57:40+01:00smallworld socialnetwork girvan newman community graphtheory clustco <span style="color:#555555;">Michelle <a href="http://www.bibsonomy.org/author/Girvan">Girvan</a> and M.E.J. <a href="http://www.bibsonomy.org/author/Newman">Newman</a> </span><em>Proceedings of the National Academy of Science</em><em>99(12):7821-7826</em>(<em>2002</em>)Thu Mar 22 17:57:40 CET 2007Proceedings of the National Academy of Science127821-7826Community structure in social and biological networks992002smallworld socialnetwork girvan newman community graphtheory clustco A number of recent studies have focused on the statistical properties of networked systems such as social networks and the Worldwide Web. Researchers have concentrated particularly on a few properties that seem to be common to many networks: the small-world property, power-law degree distributions, and network transitivity. In this article, we highlight another property that is found in many networks, the property of community structure, in which network nodes are joined together in tightly knit groups, between which there are only looser connections. We propose a method for detecting such communities, built around the idea of using centrality indices to find community boundaries. We test our method on computer-generated and real-world graphs whose community structure is already known and find that the method detects this known structure with high sensitivity and reliability. We also apply the method to two networks whose community structure is not well known---a collaboration network and a food web---and find that it detects significant and informative community divisions in both cases.http://www.bibsonomy.org/bibtex/25f2a82f1c7a71c35f51e7ca51ad15226/schmitzschmitz2007-03-22T17:54:35+01:00watts newman graphtheory strogatz socialnetwork model smallworld <span style="color:#555555;">M. <a href="http://www.bibsonomy.org/author/Newman">Newman</a> and D. <a href="http://www.bibsonomy.org/author/Watts">Watts</a> and S. <a href="http://www.bibsonomy.org/author/Strogatz">Strogatz</a> </span><em>Proc. Natl. Acad. Sci., to appear., </em>(<em>2001</em>)Thu Mar 22 17:54:35 CET 2007Proc. Natl. Acad. Sci., to appear.Random graph models of social networks2001watts newman graphtheory strogatz socialnetwork model smallworld dblphttp://www.bibsonomy.org/bibtex/21a8d67b5a14336c05290e062346d8458/schmitzschmitz2007-03-22T17:52:27+01:00sna smallworld routing graphtheory <span style="color:#555555;">Amit R. <a href="http://www.bibsonomy.org/author/Puniyani">Puniyani</a> and Rajan M. <a href="http://www.bibsonomy.org/author/Lukose">Lukose</a> and Bernardo A. <a href="http://www.bibsonomy.org/author/Huberman">Huberman</a> </span><em>CoRR</em>(<em>2001</em>)Thu Mar 22 17:52:27 CET 2007CoRRIntentional Walks on Scale Free Small Worldscond-mat/01072122001sna smallworld routing graphtheory http://www.bibsonomy.org/bibtex/2d5af05033edc193f2848f006cc2bd2cd/schmitzschmitz2007-01-03T17:08:31+01:00graphgenerator clustco smallworld graphtheory <span style="color:#555555;">Thomas <a href="http://www.bibsonomy.org/author/Schank">Schank</a> and Dorothea <a href="http://www.bibsonomy.org/author/Wagner">Wagner</a> </span><em>Journal of Graph Algorithms and Applications</em><em>9(2):265-275</em>(<em>2005</em>)Wed Jan 03 17:08:31 CET 2007Journal of Graph Algorithms and Applications2265-275Approximating Clustering Coefficient and Transitivity92005graphgenerator clustco smallworld graphtheory http://www.bibsonomy.org/bibtex/2da986f298012b41a337f636125286d86/schmitzschmitz2006-11-07T18:02:31+01:00selforganization attachment model smallworld seminar2006 sna preferential <span style="color:#555555;">Duncan J. <a href="http://www.bibsonomy.org/author/Watts">Watts</a> and Steven <a href="http://www.bibsonomy.org/author/Strogatz">Strogatz</a> </span><em>Nature</em><em>June1998. </em>Tue Nov 07 18:02:31 CET 2006NatureJune440-442Collective dynamics of 'small-world' networks3931998selforganization attachment model smallworld seminar2006 sna preferential http://www.bibsonomy.org/bibtex/2d0d6e8af38b7e88211d2fe6dcd3903d2/schmitzschmitz2006-11-07T18:02:31+01:00preferential attachment sna selforganization smallworld <span style="color:#555555;">Duncan J. <a href="http://www.bibsonomy.org/author/Watts">Watts</a> </span><em>Princeton University Press, </em><em>Princeton, New Jersey, </em>(<em>1999</em>)Tue Nov 07 18:02:31 CET 2006Princeton, New JerseySmall Worlds -- The Dynamics of Networks between Order and Randomneess1999preferential attachment sna selforganization smallworld http://www.bibsonomy.org/bibtex/21623d6270bf3fb1065175801c67ea100/schmitzschmitz2006-11-07T18:02:31+01:00sna attachment preferential smallworld selforganization <span style="color:#555555;">Hui <a href="http://www.bibsonomy.org/author/Zhang">Zhang</a> and Ashish <a href="http://www.bibsonomy.org/author/Goel">Goel</a> and Ramesh <a href="http://www.bibsonomy.org/author/Govindan">Govindan</a> </span><em>Proc.\ 21st Annual Joint Conference of the IEEE Computer and Communications Societies, </em><em>New York, NY, </em><em>July2002. </em>Tue Nov 07 18:02:31 CET 2006New York, NYProc.\ 21st Annual Joint Conference of the IEEE Computer and Communications SocietiesJulyUsing the Small-World Model to Improve Freenet Performance2002sna attachment preferential smallworld selforganization http://www.bibsonomy.org/bibtex/218020a2bbb20a933e042fa2d93292a03/schmitzschmitz2006-09-15T17:08:49+02:00graph evolution sna smallworld <span style="color:#555555;">F. <a href="http://www.bibsonomy.org/author/Menczer">Menczer</a> </span><em>Proceedings of the National Academy of Sciences</em><em>99(22):14014--14019</em>(<em>2002</em>)Fri Sep 15 17:08:49 CEST 2006Proceedings of the National Academy of Sciences2214014--14019Growing and navigating the small world web by local content992002graph evolution sna smallworld dblphttp://www.bibsonomy.org/bibtex/2acff1ece0b3ffe1924413b8e1cbcecf5/schmitzschmitz2006-09-14T16:06:58+02:00graph evolution sna smallworld <span style="color:#555555;">Jon M. <a href="http://www.bibsonomy.org/author/Kleinberg">Kleinberg</a> </span><em>NIPS, </em><em>page431-438. </em>(<em>2001</em>)Thu Sep 14 16:06:58 CEST 2006NIPS431-438Small-World Phenomena and the Dynamics of Information.2001graph evolution sna smallworld Small-World Internet Topologies: Possible Causes and Implications on Scalability of End-System Multicast - Jin, Bestavros (ResearchIndex)http://www.bibsonomy.org/bibtex/22924bb99ded1d2c9797a9333a852cdf7/schmitzschmitz2006-09-13T17:58:45+02:00graphgenerator graph evolution smallworld <span style="color:#555555;">S. <a href="http://www.bibsonomy.org/author/Jin">Jin</a> and A. <a href="http://www.bibsonomy.org/author/Bestavros">Bestavros</a> </span><em>BUCS-2002-004. </em><em>Boston University, </em>(<em>2002</em>)Wed Sep 13 17:58:45 CEST 2006BUCS-2002-004Small-world internet topologies: Possible causes and implications on scalability of end-system multicast2002graphgenerator graph evolution smallworld http://www.bibsonomy.org/bibtex/25f5c74d43838240469d9528ca54d8907/schmitzschmitz2006-09-13T17:53:03+02:00faloutsos smallworld internet graph evolution graphtheory powerlaw model <span style="color:#555555;">Michalis <a href="http://www.bibsonomy.org/author/Faloutsos">Faloutsos</a> and Petros <a href="http://www.bibsonomy.org/author/Faloutsos">Faloutsos</a> and Christos <a href="http://www.bibsonomy.org/author/Faloutsos">Faloutsos</a> </span><em>SIGCOMM, </em><em>page251-262. </em>(<em>1999</em>)Wed Sep 13 17:53:03 CEST 2006{SIGCOMM}251-262On Power-law Relationships of the Internet Topology1999faloutsos smallworld internet graph evolution graphtheory powerlaw model http://www.bibsonomy.org/bibtex/2b4a7a9e1eb16cb7b501bfdb961aac61e/schmitzschmitz2006-09-06T11:01:56+02:00sna model smallworld <span style="color:#555555;">B&amp;#233;la <a href="http://www.bibsonomy.org/author/Bollob\&amp;\#225;s">Bollob&amp;#225;s</a> and Christian <a href="http://www.bibsonomy.org/author/Borgs">Borgs</a> and Jennifer <a href="http://www.bibsonomy.org/author/Chayes">Chayes</a> and Oliver <a href="http://www.bibsonomy.org/author/Riordan">Riordan</a> </span><em>SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, </em><em>page132--139. </em><em>Philadelphia, PA, USA, </em><em>Society for Industrial and Applied Mathematics, </em>(<em>2003</em>)Wed Sep 06 11:01:56 CEST 2006Philadelphia, PA, USASODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms132--139Directed scale-free graphs2003sna model smallworld http://www.bibsonomy.org/bibtex/210554994432471894ca93bd8a0493e17/schmitzschmitz2006-09-06T10:44:23+02:00powerlaw sna model smallworld graphgenerator <span style="color:#555555;">David <a href="http://www.bibsonomy.org/author/Pennock">Pennock</a> and Gary <a href="http://www.bibsonomy.org/author/Flake">Flake</a> and Steve <a href="http://www.bibsonomy.org/author/Lawrence">Lawrence</a> and Eric <a href="http://www.bibsonomy.org/author/Glover">Glover</a> and C. <a href="http://www.bibsonomy.org/author/Lee Giles">Lee Giles</a> </span><em>Proc.\ National Academy of Sciences</em><em>99(8):5207--5211</em><em>April2002. </em>Wed Sep 06 10:44:23 CEST 2006Proc.\ National Academy of SciencesApril85207--5211Winners don't take all: Characterizing the competition for links on the web992002powerlaw sna model smallworld graphgenerator http://www.bibsonomy.org/bibtex/27b58a990141b36ced2757498b0adb003/schmitzschmitz2006-09-06T10:43:50+02:00graphgenerator powerlaw sna model smallworld graphtheory <span style="color:#555555;">Christopher R. <a href="http://www.bibsonomy.org/author/Palmer">Palmer</a> and J. <a href="http://www.bibsonomy.org/author/Gregory Steffan">Gregory Steffan</a> </span><em>Proc.\ GLOBECOM 2000, </em><em>November2000. </em>Wed Sep 06 10:43:50 CEST 2006Proc.\ GLOBECOM 2000NovemberGenerating Network Topologies That Obey Power Laws2000graphgenerator powerlaw sna model smallworld graphtheory http://www.bibsonomy.org/bibtex/2a9f31653ea4b74115c590b711b074a35/schmitzschmitz2006-09-06T10:34:37+02:00smallworld kleinberg sna navigation <span style="color:#555555;">Jon <a href="http://www.bibsonomy.org/author/Kleinberg">Kleinberg</a> </span>(<em>2000</em>)Wed Sep 06 10:34:37 CEST 2006845Navigation in a Small World4062000smallworld kleinberg sna navigation http://www.bibsonomy.org/bibtex/2b91e5b6d58090a76d5f011a30ec917d9/schmitzschmitz2006-09-06T10:22:49+02:00sna smallworld <span style="color:#555555;">Massimo <a href="http://www.bibsonomy.org/author/Marchiori">Marchiori</a> and Vito <a href="http://www.bibsonomy.org/author/Latora">Latora</a> </span><em>Physica A</em>(<em>2000</em>)Wed Sep 06 10:22:49 CEST 2006Physica A539--546Harmony in the small-world2852000sna smallworld http://www.bibsonomy.org/bibtex/298aee8bc36c47a7cffb89feb735718be/schmitzschmitz2006-09-06T10:22:49+02:00network smallworld seminar2006 tail long <span style="color:#555555;">Albert-L&#225;szl&#243; <a href="http://www.bibsonomy.org/author/Barabási">Barab&#225;si</a> and R&#233;ka <a href="http://www.bibsonomy.org/author/Albert">Albert</a> </span><em>Science</em><em>October1999. </em>Wed Sep 06 10:22:49 CEST 2006ScienceOctober509-512Emergence of Scaling in Random Networks2861999network smallworld seminar2006 tail long