Professor Barabási's talk described how the tools of network science can help understand the Web's structure, development and weaknesses. The Web is an information network, in which the nodes are documents (at the time of writing over one trillion of them), connected by links. Other well-known network structures include the Internet, a physical network where the nodes are routers and the links are physical connections, and organizations, where the nodes are people and the links represent communications.

@article{barabsi2013network, author = {Barabási, Albert-László}, title = {Network science}, journal = {Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences}, year = {2013}, volume = {371}, number = {1987}, url = {http://rsta.royalsocietypublishing.org/content/371/1987/20120375.abstract}, doi = {10.1098/rsta.2012.0375}, keywords = {analysis, network, sna, social, webscience}, abstract = {Professor Barabási's talk described how the tools of network science can help understand the Web's structure, development and weaknesses. The Web is an information network, in which the nodes are documents (at the time of writing over one trillion of them), connected by links. Other well-known network structures include the Internet, a physical network where the nodes are routers and the links are physical connections, and organizations, where the nodes are people and the links represent communications.} }

%0 = article %A = Barabási, Albert-László %D = 2013 %T = Network science %U = http://rsta.royalsocietypublishing.org/content/371/1987/20120375.abstract

The growth of the Web has required us to think about the design of information systems in which large-scale computational and social feedback effects are simultaneously at work. At the same time, the data generated by Web-scale systems—recording the ways in which millions of participants create content, link information, form groups and communicate with one another—have made it possible to evaluate long-standing theories of social interaction, and to formulate new theories based on what we observe. These developments have created a new level of interaction between computing and the social sciences, enriching the perspectives of both of these disciplines. We discuss some of the observations, theories and conclusions that have grown from the study of Web-scale social interaction, focusing on issues including the mechanisms by which people join groups, the ways in which different groups are linked together in social networks and the interplay of positive and negative interactions in these networks.

@article{kleinberg2013analysis, author = {Kleinberg, Jon}, title = {Analysis of large-scale social and information networks}, journal = {Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences}, year = {2013}, volume = {371}, number = {1987}, url = {http://rsta.royalsocietypublishing.org/content/371/1987/20120378.abstract}, doi = {10.1098/rsta.2012.0378}, keywords = {analysis, information, network, sna, social, webscience}, abstract = {The growth of the Web has required us to think about the design of information systems in which large-scale computational and social feedback effects are simultaneously at work. At the same time, the data generated by Web-scale systems—recording the ways in which millions of participants create content, link information, form groups and communicate with one another—have made it possible to evaluate long-standing theories of social interaction, and to formulate new theories based on what we observe. These developments have created a new level of interaction between computing and the social sciences, enriching the perspectives of both of these disciplines. We discuss some of the observations, theories and conclusions that have grown from the study of Web-scale social interaction, focusing on issues including the mechanisms by which people join groups, the ways in which different groups are linked together in social networks and the interplay of positive and negative interactions in these networks.} }

%0 = article %A = Kleinberg, Jon %D = 2013 %T = Analysis of large-scale social and information networks %U = http://rsta.royalsocietypublishing.org/content/371/1987/20120378.abstract

We introduce the concepts of closed sets and closure operators as mathematical tools for the study of social networks. Dynamic networks are represented by transformations. It is shown that under continuous change/transformation, all networks tend to "break down" and become less complex. It is a kind of entropy. The product of this theoretical decomposition is an abundance of triadically closed clusters which sociologists have observed in practice. This gives credence to the relevance of this kind of mathematical analysis in the sociological context.

@inproceedings{pfaltz2012entropy, author = {Pfaltz, John L.}, title = {Entropy in Social Networks}, booktitle = {Proceedings of the SOCINFO}, year = {2012}, keywords = {analysis, closure, entropy, network, sna, social, toread}, abstract = {We introduce the concepts of closed sets and closure operators as mathematical tools for the study of social networks. Dynamic networks are represented by transformations. It is shown that under continuous change/transformation, all networks tend to "break down" and become less complex. It is a kind of entropy. The product of this theoretical decomposition is an abundance of triadically closed clusters which sociologists have observed in practice. This gives credence to the relevance of this kind of mathematical analysis in the sociological context. } }

%0 = inproceedings %A = Pfaltz, John L. %B = Proceedings of the SOCINFO %D = 2012 %T = Entropy in Social Networks

The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “

@article{batagelj2011algorithms, author = {Batagelj, Vladimir and Zaveršnik, Matjaž}, title = {Fast algorithms for determining (generalized) core groups in social networks}, journal = {Advances in Data Analysis and Classification}, publisher = {Springer}, year = {2011}, volume = {5}, number = {2}, pages = {129--145}, url = {http://dx.doi.org/10.1007/s11634-010-0079-y}, doi = {10.1007/s11634-010-0079-y}, issn = {1862-5347}, keywords = {analysis, core, network, sna, social}, abstract = {The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “} }

%0 = article %A = Batagelj, Vladimir and Zaveršnik, Matjaž %D = 2011 %I = Springer %T = Fast algorithms for determining (generalized) core groups in social networks %U = http://dx.doi.org/10.1007/s11634-010-0079-y

In contrast to many other scientific disciplines, computer science considers conference publications. Conferences have the advantage of providing fast publication of papers and of bringing researchers together to present and discuss the paper with peers. Previous work on knowledge mapping focused on the map of all sciences or a particular domain based on ISI published Journal Citation Report (JCR). Although this data cover most of the important journals, it lacks computer science conference and workshop proceedings, which results in an imprecise and incomplete analysis of the computer science knowledge. This paper presents an analysis on the computer science knowledge network constructed from all types of publications, aiming at providing a complete view of computer science research. Based on the combination of two important digital libraries (DBLP and CiteSeerX), we study the knowledge network created at journal/conference level using citation linkage, to identify the development of sub-disciplines. We investigate the collaborative and citation behavior of journals/conferences by analyzing the properties of their co-authorship and citation subgraphs. The paper draws several important conclusions. First, conferences constitute social structures that shape the computer science knowledge. Second, computer science is becoming more interdisciplinary. Third, experts are the key success factor for sustainability of journals/conferences.

@article{pham2011development, author = {Pham, Manh and Klamma, Ralf and Jarke, Matthias}, title = {Development of computer science disciplines: a social network analysis approach}, journal = {Social Network Analysis and Mining}, publisher = {Springer}, address = {Wien}, year = {2011}, volume = {1}, number = {4}, pages = {321--340}, url = {http://dx.doi.org/10.1007/s13278-011-0024-x}, doi = {10.1007/s13278-011-0024-x}, issn = {1869-5450}, keywords = {analysis, computer, network, science, scientometrics, sna, social}, abstract = {In contrast to many other scientific disciplines, computer science considers conference publications. Conferences have the advantage of providing fast publication of papers and of bringing researchers together to present and discuss the paper with peers. Previous work on knowledge mapping focused on the map of all sciences or a particular domain based on ISI published Journal Citation Report (JCR). Although this data cover most of the important journals, it lacks computer science conference and workshop proceedings, which results in an imprecise and incomplete analysis of the computer science knowledge. This paper presents an analysis on the computer science knowledge network constructed from all types of publications, aiming at providing a complete view of computer science research. Based on the combination of two important digital libraries (DBLP and CiteSeerX), we study the knowledge network created at journal/conference level using citation linkage, to identify the development of sub-disciplines. We investigate the collaborative and citation behavior of journals/conferences by analyzing the properties of their co-authorship and citation subgraphs. The paper draws several important conclusions. First, conferences constitute social structures that shape the computer science knowledge. Second, computer science is becoming more interdisciplinary. Third, experts are the key success factor for sustainability of journals/conferences.} }

%0 = article %A = Pham, Manh and Klamma, Ralf and Jarke, Matthias %C = Wien %D = 2011 %I = Springer %T = Development of computer science disciplines: a social network analysis approach %U = http://dx.doi.org/10.1007/s13278-011-0024-x

Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through dimensionality reduction techniques. However, these traditional methods often do not capture well the underlying structural information, clustering, and neighborhoods. In this paper, we describe GMap: a practical tool for visualizing relational data with geographic-like maps. We illustrate the effectiveness of this approach with examples from several domains All the maps referenced in this paper can be found in http://www.research.att.com/~yifanhu/GMap

@article{gansner2009drawing, author = {Gansner, Emden R. and Hu, Yifan and Kobourov, Stephen G.}, title = {GMap: Drawing Graphs as Maps}, journal = {cs.CG}, year = {2009}, volume = {arXiv:0907.2585v1}, url = {http://arxiv.org/abs/0907.2585}, keywords = {analysis, citation, drawing, gmap, graph, graphics, graphviz, network, sna, social, visualization}, abstract = {Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through dimensionality reduction techniques. However, these traditional methods often do not capture well the underlying structural information, clustering, and neighborhoods. In this paper, we describe GMap: a practical tool for visualizing relational data with geographic-like maps. We illustrate the effectiveness of this approach with examples from several domains All the maps referenced in this paper can be found in http://www.research.att.com/~yifanhu/GMap } }

%0 = article %A = Gansner, Emden R. and Hu, Yifan and Kobourov, Stephen G. %D = 2009 %T = GMap: Drawing Graphs as Maps %U = http://arxiv.org/abs/0907.2585

The ease and lack of cost associated with taking digital photographs have allowed people to amass large personal photograph collections. These collections contain valuable information about their owners' social relationships. This paper is a preliminary investigation into how digital photo collections can provide useful data for the study of social networks. Results from an analysis of 23 subjects' photo collections demonstrate the feasibility of this approach. The relationship between perceived closeness and network position, as well as future questions, are also discussed.

@inproceedings{golder2008measuring, author = {Golder, Scott}, title = {Measuring social networks with digital photograph collections}, booktitle = {HT '08: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia}, publisher = {ACM}, address = {New York, NY, USA}, year = {2008}, pages = {43--48}, url = {http://portal.acm.org/citation.cfm?id=1379092.1379104}, doi = {http://doi.acm.org/10.1145/1379092.1379104}, isbn = {978-1-59593-985-2}, keywords = {photo, analysis, network, sna, social}, abstract = {The ease and lack of cost associated with taking digital photographs have allowed people to amass large personal photograph collections. These collections contain valuable information about their owners' social relationships. This paper is a preliminary investigation into how digital photo collections can provide useful data for the study of social networks. Results from an analysis of 23 subjects' photo collections demonstrate the feasibility of this approach. The relationship between perceived closeness and network position, as well as future questions, are also discussed.} }

%0 = inproceedings %A = Golder, Scott %B = HT '08: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia %C = New York, NY, USA %D = 2008 %I = ACM %T = Measuring social networks with digital photograph collections %U = http://portal.acm.org/citation.cfm?id=1379092.1379104

Social bookmarking systems constitute an established part of the Web 2.0. In such systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Today’s search engines represent the gateway to retrieve information from the World Wide Web. Short queries typically consisting of two to three words describe a user’s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. This clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large snapshot of del.icio.us and on query logs of two large search engines. All of the three datasets show small world properties. The tagging behavior of users, which is explained by preferential attachment of the tags in social bookmark systems, is reflected in the distribution of single query words in search engines. We can conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of social bookmarking users is driven by similar dynamics.

@inproceedings{krause2008logsonomy, author = {Krause, Beate and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd}, title = {Logsonomy - Social Information Retrieval with Logdata}, booktitle = {HT '08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia}, publisher = {ACM}, address = {New York, NY, USA}, year = {2008}, pages = {157--166}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/krause2008logsonomy.pdf}, doi = {10.1145/1379092.1379123}, isbn = {978-1-59593-985-2}, keywords = {2008, analysis, engine, information, l3s, logsonomy, myown, network, retrieval, search, sna, social, wp5}, abstract = {Social bookmarking systems constitute an established part of the Web 2.0. In such systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Today’s search engines represent the gateway to retrieve information from the World Wide Web. Short queries typically consisting of two to three words describe a user’s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. This clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large snapshot of del.icio.us and on query logs of two large search engines. All of the three datasets show small world properties. The tagging behavior of users, which is explained by preferential attachment of the tags in social bookmark systems, is reflected in the distribution of single query words in search engines. We can conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of social bookmarking users is driven by similar dynamics.} }

%0 = inproceedings %A = Krause, Beate and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd %B = HT '08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia %C = New York, NY, USA %D = 2008 %I = ACM %T = Logsonomy - Social Information Retrieval with Logdata %U = http://www.kde.cs.uni-kassel.de/pub/pdf/krause2008logsonomy.pdf

Social networking services are a fast-growing business in the Internet. However, it is unknown if online relationships and their growth patterns are the same as in real-life social networks. In this paper, we compare the structures of three online social networking services: Cyworld, MySpace, and orkut, each with more than 10 million users, respectively. We have access to complete data of Cyworld's ilchon (friend) relationships and analyze its degree distribution, clustering property, degree correlation, and evolution over time. We also use Cyworld data to evaluate the validity of snowball sampling method, which we use to crawl and obtain partial network topologies of MySpace and orkut. Cyworld, the oldest of the three, demonstrates a changing scaling behavior over time in degree distribution. The latest Cyworld data's degree distribution exhibits a multi-scaling behavior, while those of MySpace and orkut have simple scaling behaviors with different exponents. Very interestingly, each of the two e ponents corresponds to the different segments in Cyworld's degree distribution. Certain online social networking services encourage online activities that cannot be easily copied in real life; we show that they deviate from close-knit online social networks which show a similar degree correlation pattern to real-life social networks.

@inproceedings{ahn2007topological, author = {Ahn, Yong-Yeol and Han, Seungyeop and Kwak, Haewoon and Moon, Sue and Jeong, Hawoong}, title = {Analysis of topological characteristics of huge online social networking services}, booktitle = {Proceedings of the 16th International Conference on World Wide Web}, publisher = {ACM}, address = {New York, NY, USA}, year = {2007}, pages = {835--844}, url = {http://portal.acm.org/citation.cfm?id=1242685}, doi = {10.1145/1242572.1242685}, isbn = {978-1-59593-654-7}, keywords = {folksonomy, online, analysis, network, sna, social}, abstract = {Social networking services are a fast-growing business in the Internet. However, it is unknown if online relationships and their growth patterns are the same as in real-life social networks. In this paper, we compare the structures of three online social networking services: Cyworld, MySpace, and orkut, each with more than 10 million users, respectively. We have access to complete data of Cyworld's ilchon (friend) relationships and analyze its degree distribution, clustering property, degree correlation, and evolution over time. We also use Cyworld data to evaluate the validity of snowball sampling method, which we use to crawl and obtain partial network topologies of MySpace and orkut. Cyworld, the oldest of the three, demonstrates a changing scaling behavior over time in degree distribution. The latest Cyworld data's degree distribution exhibits a multi-scaling behavior, while those of MySpace and orkut have simple scaling behaviors with different exponents. Very interestingly, each of the two e ponents corresponds to the different segments in Cyworld's degree distribution. Certain online social networking services encourage online activities that cannot be easily copied in real life; we show that they deviate from close-knit online social networks which show a similar degree correlation pattern to real-life social networks.} }

%0 = inproceedings %A = Ahn, Yong-Yeol and Han, Seungyeop and Kwak, Haewoon and Moon, Sue and Jeong, Hawoong %B = Proceedings of the 16th International Conference on World Wide Web %C = New York, NY, USA %D = 2007 %I = ACM %T = Analysis of topological characteristics of huge online social networking services %U = http://portal.acm.org/citation.cfm?id=1242685

Abstract. Communities in social networks are often defined as groups of densely connected actors. However, members of the same dense group are not equal but may differ largely in their social position or in the role they play. Furthermore, the same positions can be found across the borders of dense communities so that networks contain a significant group structure which does not coincide with the structure of dense groups. This papers gives a survey over formalizations of network-positions with a special emphasis on the use of algebraic notions.

@inproceedings{Brandes07Role, author = {Brandes, Ulrik and Lerner, Jürgen}, title = {Role-equivalent Actors in Networks}, editor = {Obiedkov, Sergei and Roth, Camille}, booktitle = {ICFCA 2007 Satellite Workshop on Social Network Analysis and Conceptual Structures: Exploring Opportunities}, year = {2007}, url = {http://www.inf.uni-konstanz.de/algo/publications/bl-rean-07.pdf}, keywords = {actor, role, seminar2009, structure, sna, analysis, network, social}, abstract = {Abstract. Communities in social networks are often defined as groups of densely connected actors. However, members of the same dense group are not equal but may differ largely in their social position or in the role they play. Furthermore, the same positions can be found across the borders of dense communities so that networks contain a significant group structure which does not coincide with the structure of dense groups. This papers gives a survey over formalizations of network-positions with a special emphasis on the use of algebraic notions.} }

%0 = inproceedings %A = Brandes, Ulrik and Lerner, Jürgen %B = ICFCA 2007 Satellite Workshop on Social Network Analysis and Conceptual Structures: Exploring Opportunities %D = 2007 %T = Role-equivalent Actors in Networks %U = http://www.inf.uni-konstanz.de/algo/publications/bl-rean-07.pdf

Novel aspects of human dynamics and social interactions are investigated by means of mobile phone data. Using extensive phone records resolved in both time and space, we study the mean collective behavior at large scales and focus on the occurrence of anomalous events. We discuss how these spatiotemporal anomalies can be described using standard percolation theory tools. We also investigate patterns of calling activity at the individual level and show that the interevent time of consecutive calls is heavy-tailed. This finding, which has implications for dynamics of spreading phenomena in social networks, agrees with results previously reported on other human activities.

@misc{candia-2007, author = {Candia, J. and Gonzalez, M. C. and Wang, P. and Schoenharl, T. and Madey, G. and Barabasi, A. L.}, title = {Uncovering individual and collective human dynamics from mobile phone records}, year = {2007}, url = {http://www.citebase.org/abstract?id=oai:arXiv.org:0710.2939}, keywords = {dynamic, mobile, phone, seminar2009, sna, analysis, network, social}, abstract = { Novel aspects of human dynamics and social interactions are investigated by means of mobile phone data. Using extensive phone records resolved in both time and space, we study the mean collective behavior at large scales and focus on the occurrence of anomalous events. We discuss how these spatiotemporal anomalies can be described using standard percolation theory tools. We also investigate patterns of calling activity at the individual level and show that the interevent time of consecutive calls is heavy-tailed. This finding, which has implications for dynamics of spreading phenomena in social networks, agrees with results previously reported on other human activities.} }

%0 = misc %A = Candia, J. and Gonzalez, M. C. and Wang, P. and Schoenharl, T. and Madey, G. and Barabasi, A. L. %B = } %C = %D = 2007 %I = %T = Uncovering individual and collective human dynamics from mobile phone records} %U = http://www.citebase.org/abstract?id=oai:arXiv.org:0710.2939

Social resource sharing systems like YouTube and del.icio.us have acquired a large number of users within the last few years. They provide rich resources for data analysis, information retrieval, and knowledge discovery applications. A first step towards this end is to gain better insights into content and structure of these systems. In this paper, we will analyse the main network characteristics of two of these systems. We consider their underlying data structures - so-called folksonomies - as tri-partite hypergraphs, and adapt classical network measures like characteristic path length and clustering coefficient to them. Subsequently, we introduce a network of tag co-occurrence and investigate some of its statistical properties, focusing on correlations in node connectivity and pointing out features that reflect emergent semantics within the folksonomy. We show that simple statistical indicators unambiguously spot non-social behavior such as spam.

@article{cattuto2007network, author = {Cattuto, Ciro and Schmitz, Christoph and Baldassarri, Andrea and Servedio, Vito D. P. and Loreto, Vittorio and Hotho, Andreas and Grahl, Miranda and Stumme, Gerd}, title = {Network Properties of Folksonomies}, journal = {AI Communications}, publisher = {IOS Press}, address = {Amsterdam, The Netherlands}, year = {2007}, volume = {20}, number = {4}, pages = {245--262}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/cattuto2007network.pdf}, issn = {0921-7126}, keywords = {folksonomy, ol_tut2010, property, sna, analysis, network, social}, abstract = {Social resource sharing systems like YouTube and del.icio.us have acquired a large number of users within the last few years. They provide rich resources for data analysis, information retrieval, and knowledge discovery applications. A first step towards this end is to gain better insights into content and structure of these systems. In this paper, we will analyse the main network characteristics of two of these systems. We consider their underlying data structures - so-called folksonomies - as tri-partite hypergraphs, and adapt classical network measures like characteristic path length and clustering coefficient to them. Subsequently, we introduce a network of tag co-occurrence and investigate some of its statistical properties, focusing on correlations in node connectivity and pointing out features that reflect emergent semantics within the folksonomy. We show that simple statistical indicators unambiguously spot non-social behavior such as spam. } }

%0 = article %A = Cattuto, Ciro and Schmitz, Christoph and Baldassarri, Andrea and Servedio, Vito D. P. and Loreto, Vittorio and Hotho, Andreas and Grahl, Miranda and Stumme, Gerd %C = Amsterdam, The Netherlands %D = 2007 %I = IOS Press %T = Network Properties of Folksonomies %U = http://www.kde.cs.uni-kassel.de/pub/pdf/cattuto2007network.pdf

@inproceedings{Jason_Euzenat_2007, author = {Jung, Jason and Euzenat, Jérôme}, title = {Towards Semantic Social Networks}, editor = {Franconi, Enrico and Kifer, Michael and May, Wolfgang}, booktitle = {Proceedings of the European Semantic Web Conference (ESWC2007)}, series = {LNCS}, publisher = {Springer-Verlag}, address = {Berlin Heidelberg, Germany}, year = {2007}, volume = {4519}, pages = {267-280}, url = {http://www.eswc2007.org/pdf/eswc07-jung.pdf}, keywords = {2007, eswc, semantic, sna, analysis, network, social} }

%0 = inproceedings %A = Jung, Jason and Euzenat, Jérôme %B = Proceedings of the European Semantic Web Conference (ESWC2007) %C = Berlin Heidelberg, Germany %D = 2007 %I = Springer-Verlag %T = Towards Semantic Social Networks %U = http://www.eswc2007.org/pdf/eswc07-jung.pdf

@inproceedings{1244292, author = {Kim, Hak Lae and Hwang, Suk Hyung and Kim, Hong Gee}, title = {FCA-based approach for mining contextualized folksonomy}, booktitle = {SAC '07: Proceedings of the 2007 ACM symposium on Applied computing}, publisher = {ACM Press}, address = {New York, NY, USA}, year = {2007}, pages = {1340--1345}, url = {http://portal.acm.org/citation.cfm?id=1244002.1244292&coll=GUIDE&dl=}, doi = {http://doi.acm.org/10.1145/1244002.1244292}, isbn = {1-59593-480-4}, keywords = {concept, fca, folksonomy, formal, mining, tagging, analysis, network, sna, social} }

%0 = inproceedings %A = Kim, Hak Lae and Hwang, Suk Hyung and Kim, Hong Gee %B = SAC '07: Proceedings of the 2007 ACM symposium on Applied computing %C = New York, NY, USA %D = 2007 %I = ACM Press %T = FCA-based approach for mining contextualized folksonomy %U = http://portal.acm.org/citation.cfm?id=1244002.1244292&coll=GUIDE&dl=

A key argument for modeling knowledge in ontologies is the easy reuse and re-engineering of the knowledge. However, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA).While social network structures currently receive high attention in the Semantic Web community, there are only very few SNA applications, and virtually none for analyzing the structure of ontologies. We illustrate the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size.

@incollection{hoser2006semantic, author = {Hoser, Bettina and Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, title = {Semantic Network Analysis of Ontologies}, editor = {Sure, York and Domingue, John}, booktitle = {The Semantic Web: Research and Applications}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, address = {Berlin/Heidelberg}, year = {2006}, volume = {4011}, pages = {514--529}, note = {10.1007/11762256_38}, url = {http://dx.doi.org/10.1007/11762256_38}, doi = {10.1007/11762256_38}, isbn = {978-3-540-34544-2}, keywords = {2006, iccs_example, l3s, myown, ontology, semantic, trias_example, sna, analysis, network, social}, abstract = { A key argument for modeling knowledge in ontologies is the easy reuse and re-engineering of the knowledge. However, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA).While social network structures currently receive high attention in the Semantic Web community, there are only very few SNA applications, and virtually none for analyzing the structure of ontologies. We illustrate the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size. } }

%0 = incollection %A = Hoser, Bettina and Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd %B = The Semantic Web: Research and Applications %C = Berlin/Heidelberg %D = 2006 %I = Springer %T = Semantic Network Analysis of Ontologies %U = http://dx.doi.org/10.1007/11762256_38

The dynamics of many social, technological and economic phenomena are driven by individual human actions, turning the quantitative understanding of human behavior into a central question of modern science. Current models of human dynamics, used from risk assessment to communications, assume that human actions are randomly distributed in time and thus well approximated by Poisson processes. Here we provide direct evidence that for five human activity patterns, such as email and letter based communications, web browsing, library visits and stock trading, the timing of individual human actions follow non-Poisson statistics, characterized by bursts of rapidly occurring events separated by long periods of inactivity. We show that the bursty nature of human behavior is a consequence of a decision based queuing process: when individuals execute tasks based on some perceived priority, the timing of the tasks will be heavy tailed, most tasks being rapidly executed, while a few experiencing very long waiting times. In contrast, priority blind execution is well approximated by uniform interevent statistics. We discuss two queuing models that capture human activity. The first model assumes that there are no limitations on the number of tasks an individual can hadle at any time, predicting that the waiting time of the individual tasks follow a heavy tailed distribution P(τw)∼τw−α with α=3∕2. The second model imposes limitations on the queue length, resulting in a heavy tailed waiting time distribution characterized by α=1. We provide empirical evidence supporting the relevance of these two models to human activity patterns, showing that while emails, web browsing and library visitation display α=1, the surface mail based communication belongs to the α=3∕2 universality class. Finally, we discuss possible extension of the proposed queuing models and outline some future challenges in exploring the statistical mechanics of human dynamics.

@article{vazquez2006modeling, author = {Vázquez, Alexei and Gama Oliveira, João and Dezsö, Zoltán and Goh, Kwang-Il and Kondor, Imre and Barabási, Albert-László}, title = {Modeling bursts and heavy tails in human dynamics}, journal = {Physical Review E}, publisher = {American Physical Society}, year = {2006}, volume = {73}, number = {3}, pages = {036127}, url = {http://link.aps.org/doi/10.1103/PhysRevE.73.036127}, doi = {10.1103/PhysRevE.73.036127}, keywords = {dynamics, sna, analysis, network, social}, abstract = { The dynamics of many social, technological and economic phenomena are driven by individual human actions, turning the quantitative understanding of human behavior into a central question of modern science. Current models of human dynamics, used from risk assessment to communications, assume that human actions are randomly distributed in time and thus well approximated by Poisson processes. Here we provide direct evidence that for five human activity patterns, such as email and letter based communications, web browsing, library visits and stock trading, the timing of individual human actions follow non-Poisson statistics, characterized by bursts of rapidly occurring events separated by long periods of inactivity. We show that the bursty nature of human behavior is a consequence of a decision based queuing process: when individuals execute tasks based on some perceived priority, the timing of the tasks will be heavy tailed, most tasks being rapidly executed, while a few experiencing very long waiting times. In contrast, priority blind execution is well approximated by uniform interevent statistics. We discuss two queuing models that capture human activity. The first model assumes that there are no limitations on the number of tasks an individual can hadle at any time, predicting that the waiting time of the individual tasks follow a heavy tailed distribution P(τw)∼τw−α with α=3∕2. The second model imposes limitations on the queue length, resulting in a heavy tailed waiting time distribution characterized by α=1. We provide empirical evidence supporting the relevance of these two models to human activity patterns, showing that while emails, web browsing and library visitation display α=1, the surface mail based communication belongs to the α=3∕2 universality class. Finally, we discuss possible extension of the proposed queuing models and outline some future challenges in exploring the statistical mechanics of human dynamics.} }

%0 = article %A = Vázquez, Alexei and Gama Oliveira, João and Dezsö, Zoltán and Goh, Kwang-Il and Kondor, Imre and Barabási, Albert-László %D = 2006 %I = American Physical Society %T = Modeling bursts and heavy tails in human dynamics %U = http://link.aps.org/doi/10.1103/PhysRevE.73.036127

@book{nooy2005pajek, author = {de Nooy, Wouter and Mrvar, Andrej and Batagelj, Vladimir}, title = {Exploratory Social Network Analysis with Pajek}, series = {Structural Analysis in the Social Sciences}, publisher = {Cambridge University Press}, address = {New York, NY, USA}, year = {2005}, number = {27}, url = {http://www.amazon.com/Exploratory-Network-Analysis-Structural-Sciences/dp/0521602629%3FSubscriptionId%3D192BW6DQ43CK9FN0ZGG2%26tag%3Dws%26linkCode%3Dxm2%26camp%3D2025%26creative%3D165953%26creativeASIN%3D0521602629}, isbn = {0521602629}, keywords = {graph, pajek, tool, visualisation, sna, analysis, network, social} }

%0 = book %A = de Nooy, Wouter and Mrvar, Andrej and Batagelj, Vladimir %C = New York, NY, USA %D = 2005 %I = Cambridge University Press %T = Exploratory Social Network Analysis with Pajek %U = http://www.amazon.com/Exploratory-Network-Analysis-Structural-Sciences/dp/0521602629%3FSubscriptionId%3D192BW6DQ43CK9FN0ZGG2%26tag%3Dws%26linkCode%3Dxm2%26camp%3D2025%26creative%3D165953%26creativeASIN%3D0521602629

Networked structures arise in a wide array of different contexts such as technological and transportation infrastructures, social phenomena, and biological systems. These highly interconnected systems have recently been the focus of a great deal of attention that has uncovered and characterized their topological complexity. Along with a complex topological structure, real networks display a large heterogeneity in the capacity and intensity of the connections. These features, however, have mainly not been considered in past studies where links are usually represented as binary states, i.e., either present or absent. Here, we study the scientific collaboration network and the world-wide air-transportation network, which are representative examples of social and large infrastructure systems, respectively. In both cases it is possible to assign to each edge of the graph a weight proportional to the intensity or capacity of the connections among the various elements of the network. We define appropriate metrics combining weighted and topological observables that enable us to characterize the complex statistical properties and heterogeneity of the actual strength of edges and vertices. This information allows us to investigate the correlations among weighted quantities and the underlying topological structure of the network. These results provide a better description of the hierarchies and organizational principles at the basis of the architecture of weighted networks.

@article{barrat2004architecture, author = {Barrat, A. and Barthélemy, M. and Pastor-Satorras, R. and Vespignani, A.}, title = {The architecture of complex weighted networks}, journal = {Proceedings of the National Academy of Sciences of the United States of America}, year = {2004}, volume = {101}, number = {11}, pages = {3747--3752}, url = {http://www.pnas.org/content/101/11/3747.abstract}, doi = {10.1073/pnas.0400087101}, keywords = {complex, sna, analysis, network, social}, abstract = {Networked structures arise in a wide array of different contexts such as technological and transportation infrastructures, social phenomena, and biological systems. These highly interconnected systems have recently been the focus of a great deal of attention that has uncovered and characterized their topological complexity. Along with a complex topological structure, real networks display a large heterogeneity in the capacity and intensity of the connections. These features, however, have mainly not been considered in past studies where links are usually represented as binary states, i.e., either present or absent. Here, we study the scientific collaboration network and the world-wide air-transportation network, which are representative examples of social and large infrastructure systems, respectively. In both cases it is possible to assign to each edge of the graph a weight proportional to the intensity or capacity of the connections among the various elements of the network. We define appropriate metrics combining weighted and topological observables that enable us to characterize the complex statistical properties and heterogeneity of the actual strength of edges and vertices. This information allows us to investigate the correlations among weighted quantities and the underlying topological structure of the network. These results provide a better description of the hierarchies and organizational principles at the basis of the architecture of weighted networks.} }

%0 = article %A = Barrat, A. and Barthélemy, M. and Pastor-Satorras, R. and Vespignani, A. %D = 2004 %T = The architecture of complex weighted networks %U = http://www.pnas.org/content/101/11/3747.abstract

A network is said to show assortative mixing if the nodes in the network that have many connections tend to be connected to other nodes with many connections. Here we measure mixing patterns in a variety of networks and find that social networks are mostly assortatively mixed, but that technological and biological networks tend to be disassortative. We propose a model of an assortatively mixed network, which we study both analytically and numerically. Within this model we find that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.

@article{newman2002assortative, author = {Newman, M. E. J.}, title = {Assortative Mixing in Networks}, journal = {Physical Review Letters}, publisher = {American Physical Society}, year = {2002}, volume = {89}, number = {20}, pages = {208701}, url = {http://link.aps.org/doi/10.1103/PhysRevLett.89.208701}, doi = {10.1103/PhysRevLett.89.208701}, keywords = {assortative, author, graph, mixing, newman, sna, analysis, network, social}, abstract = {A network is said to show assortative mixing if the nodes in the network that have many connections tend to be connected to other nodes with many connections. Here we measure mixing patterns in a variety of networks and find that social networks are mostly assortatively mixed, but that technological and biological networks tend to be disassortative. We propose a model of an assortatively mixed network, which we study both analytically and numerically. Within this model we find that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.} }

%0 = article %A = Newman, M. E. J. %D = 2002 %I = American Physical Society %T = Assortative Mixing in Networks %U = http://link.aps.org/doi/10.1103/PhysRevLett.89.208701

Galois lattices are introduced as a device to provide a general representation for two mode social network data. It is shown that Galois lattices yield a single visual image of such data in cases where most alternative models produce dual images. The inzage provided by the Galois lattice produces, moreover, an inzage that can suggest useful insights about the structural properties of the data. An example, based on data from Davis, Gardner, and Gardner (1941), is used to spell out in detail the kinds of structural insights that can be gained from this approach. In addition, other potential applications are suggested.

@article{freeman1993galois, author = {Freeman, L.C. and White, D.R.}, title = {Using Galois Lattices to Represent Network Data}, journal = {Sociological Methodology}, year = {1993}, volume = {23}, pages = {127--146}, url = {http://www.polisci.berkeley.edu/courses/coursepages/Fall2004/ps289/Galois.pdf}, keywords = {galois, graph, lattice, analysis, network, sna, social}, abstract = {Galois lattices are introduced as a device to provide a general representation for two mode social network data. It is shown that Galois lattices yield a single visual image of such data in cases where most alternative models produce dual images. The inzage provided by the Galois lattice produces, moreover, an inzage that can suggest useful insights about the structural properties of the data. An example, based on data from Davis, Gardner, and Gardner (1941), is used to spell out in detail the kinds of structural insights that can be gained from this approach. In addition, other potential applications are suggested.} }

%0 = article %A = Freeman, L.C. and White, D.R. %D = 1993 %T = Using Galois Lattices to Represent Network Data %U = http://www.polisci.berkeley.edu/courses/coursepages/Fall2004/ps289/Galois.pdf