http://www.bibsonomy.org/burst/concept/user/schmitz/graphtheoryBibSonomy BuRST Feed for /concept/user/schmitz/graphtheory2008-07-27T04:08:29+02:00http://www.bibsonomy.org/bibtex/2e5427464b2bd3f54c97165b9110863eb/schmitzschmitz2007-09-18T11:30:48+02:00scalefree network graphtheory smallworld socialnetwork <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 network632001scalefree network graphtheory smallworld socialnetwork 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 Graphs and Hypergraphshttp://www.bibsonomy.org/bibtex/2db61bde56bc8e7a3ccecc35305b72118/schmitzschmitz2007-05-02T13:59:03+02:00graph hypergraph graphtheory <span style="color:#555555;">Claude <a href="http://www.bibsonomy.org/author/Berge">Berge</a> </span><em>Elsevier Science Ltd, </em>(<em>1985</em>)Wed May 02 13:59:03 CEST 2007Graphs and Hypergraphs1985graph hypergraph graphtheory http://www.bibsonomy.org/bibtex/27daae7bfcc64f52e6faa3e4d5d7e12cd/schmitzschmitz2007-04-02T16:36:42+02:00hypergraph graphtheory graph <span style="color:#555555;">Claude <a href="http://www.bibsonomy.org/author/Berge">Berge</a> </span>(<em>1989</em>)Mon Apr 02 16:36:42 CEST 20073rd256Hypergraphs1989hypergraph graphtheory graph http://www.bibsonomy.org/bibtex/2b6a9afb07c4c483a94faf59e2d0710c5/schmitzschmitz2007-03-30T15:16:06+02:00network complex graphtheory <span style="color:#555555;">A. <a href="http://www.bibsonomy.org/author/{Capocci}">Capocci</a> and F. <a href="http://www.bibsonomy.org/author/{Colaiori}">Colaiori</a> </span><em>Phys.~Rev.~E</em><em>74(2):026122-+</em><em>August2006. </em>Fri Mar 30 15:16:06 CEST 2007Phys.~Rev.~EAugust2026122-+{Mixing properties of growing networks and Simpson's paradox}742006network complex graphtheory http://www.bibsonomy.org/bibtex/2cf9a3164fb493d98c3c3364a264332f7/schmitzschmitz2007-03-22T18:43:50+01:00sna sampling graphtheory <span style="color:#555555;">Richard B. <a href="http://www.bibsonomy.org/author/Rothenberg">Rothenberg</a> </span><em>Connections</em><em>18(1):104--110</em>(<em>1995</em>)Thu Mar 22 18:43:50 CET 2007Connections1104--110Commentary: Sampling in Social Networks181995sna sampling graphtheory Curriculum Vitaehttp://www.bibsonomy.org/bibtex/287e25dee0b0e2edcd1de1f535fe85cf9/schmitzschmitz2007-03-22T18:42:27+01:00graphtheory sampling sna <span style="color:#555555;">Rick <a href="http://www.bibsonomy.org/author/Grannis">Grannis</a> </span>(<em>2004</em>)Thu Mar 22 18:42:27 CET 2007Proceedings of the Sixth International Conference on Social Science Methodology: Recent Developments and Applications in Social Research MethodologySampling the Structure of Large-Scale Social Networks 2004graphtheory sampling sna dblphttp://www.bibsonomy.org/bibtex/23f5403f348c0bc654b21de147632ed26/schmitzschmitz2007-03-22T18:20:12+01:00vlsi clustering graphtheory <span style="color:#555555;">Charles J. <a href="http://www.bibsonomy.org/author/Alpert">Alpert</a> and Andrew B. <a href="http://www.bibsonomy.org/author/Kahng">Kahng</a> </span><em>ICCAD, </em><em>page63-67. </em><em>IEEE Computer Society, </em>(<em>1994</em>)Thu Mar 22 18:20:12 CET 2007ICCADconf/iccad/199463-67A general framework for vertex orderings, with applications to netlist clustering.1994vlsi clustering graphtheory gcalda's bookhttp://www.bibsonomy.org/bibtex/2d4e8b5ed20176eb6cb50101fdb8ab95b/schmitzschmitz2007-03-22T18:19:00+01:00mining graphtheory community smallworld <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 graphtheory community smallworld 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.dblphttp://www.bibsonomy.org/bibtex/2fb96363fda06e80943498e293c6e402a/schmitzschmitz2007-03-22T18:00:17+01:00graph similarity graphtheory distance metric <span style="color:#555555;">Ulrik <a href="http://www.bibsonomy.org/author/Brandes">Brandes</a> and J&#252;rgen <a href="http://www.bibsonomy.org/author/Lerner">Lerner</a> </span><em>ISAAC, </em><em>volume3341ofLecture Notes in Computer Science, </em><em>page184-195. </em><em>Springer, </em>(<em>2004</em>)Thu Mar 22 18:00:17 CET 2007ISAACconf/isaac/2004184-195Lecture Notes in Computer ScienceStructural Similarity in Graphs (A Relaxation Approach for Role Assignment).33412004graph similarity graphtheory distance metric http://www.bibsonomy.org/bibtex/28f80a8586927ea69ea915b6c32e87629/schmitzschmitz2007-03-22T17:57:40+01:00smallworld clustco socialnetwork graphtheory newman girvan community <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 clustco socialnetwork graphtheory newman girvan community 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:00newman model graphtheory strogatz watts smallworld socialnetwork <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 networks2001newman model graphtheory strogatz watts smallworld socialnetwork dblphttp://www.bibsonomy.org/bibtex/2837b777e0dd7c4391b13c65352346d0f/schmitzschmitz2007-03-22T17:53:22+01:00network sna routing graphtheory <span style="color:#555555;">Ayalvadi J. <a href="http://www.bibsonomy.org/author/Ganesh">Ganesh</a> and Laurent <a href="http://www.bibsonomy.org/author/Massoulié">Massouli&#233;</a> and Donald F. <a href="http://www.bibsonomy.org/author/Towsley">Towsley</a> </span><em>INFOCOM, </em><em>page1455-1466. </em><em>IEEE, </em>(<em>2005</em>)Thu Mar 22 17:53:22 CET 2007INFOCOMconf/infocom/20051455-1466The effect of network topology on the spread of epidemics.2005network sna routing graphtheory dblphttp://www.bibsonomy.org/bibtex/21a8d67b5a14336c05290e062346d8458/schmitzschmitz2007-03-22T17:52:27+01:00routing sna smallworld 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/01072122001routing sna smallworld graphtheory http://www.bibsonomy.org/bibtex/256de7e6d214faebdbf2f2ef0fce09d7d/schmitzschmitz2007-03-22T17:51:53+01:00community network graphtheory algorithm socialnetwork clustering <span style="color:#555555;">M.E.J. <a href="http://www.bibsonomy.org/author/Newman">Newman</a> </span><em>Physical Review E</em><em>September2003. </em>Thu Mar 22 17:51:53 CET 2007Physical Review ESeptemberFast algorithm for detecting community structure in networks692003community network graphtheory algorithm socialnetwork clustering dblphttp://www.bibsonomy.org/bibtex/2b8d36793a5b0e675b8a06ad3bd761593/schmitzschmitz2007-03-22T17:50:52+01:00socialnetwork graphtheory sna routing kleinberg <span style="color:#555555;">David <a href="http://www.bibsonomy.org/author/Kempe">Kempe</a> and Jon M. <a href="http://www.bibsonomy.org/author/Kleinberg">Kleinberg</a> </span><em>FOCS, </em><em>page471-480. </em><em>IEEE Computer Society, </em>(<em>2002</em>)Thu Mar 22 17:50:52 CET 2007FOCSconf/focs/2002471-480Protocols and Impossibility Results for Gossip-Based Communication Mechanisms.2002socialnetwork graphtheory sna routing kleinberg http://www.bibsonomy.org/bibtex/206dc73dd414e3a64183a6ecfeb05a7a6/schmitzschmitz2007-03-22T17:50:10+01:00socialnetwork graphtheory sna kleinberg <span style="color:#555555;">David <a href="http://www.bibsonomy.org/author/Kempe">Kempe</a> and Jon <a href="http://www.bibsonomy.org/author/Kleinberg">Kleinberg</a> and &amp;#201;va <a href="http://www.bibsonomy.org/author/Tardos">Tardos</a> </span><em>KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, </em><em>page137--146. </em><em>ACM Press, </em>(<em>2003</em>)Thu Mar 22 17:50:10 CET 2007KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining137--146Maximizing the spread of influence through a social network2003socialnetwork graphtheory sna kleinberg http://www.bibsonomy.org/bibtex/29a69c6cc7772afe370c3de080fa37049/schmitzschmitz2007-03-22T17:49:15+01:00graph network graphtheory preferentialattachment barabasi mining sna <span style="color:#555555;">Reka <a href="http://www.bibsonomy.org/author/Albert">Albert</a> and Albert-Laszlo <a href="http://www.bibsonomy.org/author/Barabasi">Barabasi</a> </span><em>Physical Review Letters</em>(<em>2000</em>)Thu Mar 22 17:49:15 CET 2007Physical Review Letters5234Topology of evolving networks: local events and universality852000graph network graphtheory preferentialattachment barabasi mining sna http://www.bibsonomy.org/bibtex/27d738e62dffd04f709e66de94c6dee89/schmitzschmitz2007-01-26T16:35:02+01:00myown content aggregation clustering 2006 ontology graphtheory <span style="color:#555555;">Christoph <a href="http://www.bibsonomy.org/author/Schmitz">Schmitz</a> and Andreas <a href="http://www.bibsonomy.org/author/Hotho">Hotho</a> and Robert <a href="http://www.bibsonomy.org/author/Jäschke">J&#228;schke</a> and Gerd <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> </span><em>Proceedings of the 3rd European Semantic Web Conference, </em><em>Budva, Montenegro, </em><em>June2006. </em>Fri Jan 26 16:35:02 CET 2007Budva, MontenegroProceedings of the 3rd European Semantic Web ConferenceJuneContent Aggregation on Knowledge Bases using Graph Clustering2006myown content aggregation clustering 2006 ontology graphtheory http://www.bibsonomy.org/bibtex/2d5af05033edc193f2848f006cc2bd2cd/schmitzschmitz2007-01-03T17:08:31+01:00smallworld clustco graphtheory graphgenerator <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 Transitivity92005smallworld clustco graphtheory graphgenerator