Social networks and democracy: Fightbacks and backlashes in the world wide agora

Keyword(s):  
Author(s):  
Artur Sancho Marques ◽  
José Figueiredo

Inspired by patterns of behavior generated in social networks, a prototype of a new object was designed and developed for the World Wide Web – the stigmergic hyperlink or “stigh”. In a system of stighs, like a Web page, the objects that users do use grow “healthier”, while the unused “weaken”, eventually to the extreme of their “death”, being autopoieticaly replaced by new destinations. At the single Web page scale, these systems perform like recommendation systems and embody an “ecological” treatment to unappreciated links. On the much wider scale of generalized usage, because each stigh has a method to retrieve information about its destination, Web agents in general and search engines in particular, would have the option to delegate the crawling and/or the parsing of the destination. This would be an interesting social change: after becoming not only consumers, but also content producers, Web users would, just by hosting (automatic) stighs, become information service providers too.


Author(s):  
Graham Cormode ◽  
Balachander Krishnamurthy

Web 2.0 is a buzzword introduced in 2003-04 which is commonly used to encompass various novel phenomena on the World Wide Web. Although largely a marketing term, some of the key attributes associated with Web 2.0 include the growth of social networks, bi-directional communication, various 'glue' technologies, and significant diversity in content types. We are not aware of a technical comparison between Web 1.0 and 2.0. While most of Web 2.0 runs on the same substrate as 1.0, there are some key differences. We capture those differences and their implications for technical work in this paper. Our goal is to identify the primary differences leading to the properties of interest in 2.0 to be characterized. We identify novel challenges due to the different structures of Web 2.0 sites, richer methods of user interaction, new technologies, and fundamentally different philosophy. Although a significant amount of past work can be reapplied, some critical thinking is needed for the networking community to analyze the challenges of this new and rapidly evolving environment.


Author(s):  
Antonis Sidiropoulos ◽  
Dimitrios Katsaros ◽  
Yannis Manolopoulos

The World Wide Web, or simply Web, is a characteristic example of a social network (Newman, 2003; Wasserman & Faust, 1994). Other examples of social networks include the food web network, scientific collaboration networks, sexual relationships networks, metabolic networks, and air transportation networks. Socials networks are usually abstracted as graphs, comprised by vertices, edges (directed or not), and in some cases, with weights on these edges. Social network theory is concerned with properties related to connectivity (degree, structure, centrality), distances (diameter, shortest paths), “resilience” (geodesic edges or vertices, articulation vertices) of these graphs, models of network growth. Social networks have been studied long before the conception of the Web. Pioneering works for the characterization of the Web as a social network and for the study of its basic properties are due to the work of Barabasi and its colleagues (Albert, Jeong & Barabasi, 1999). Later, several studies investigated other aspects like its growth (Bianconi & Barabasi, 2001; Menczer, 2004; Pennock, Flake, Lawrence, Glover, & Giles, 2002; Watts & Strogatz, 1998), its “small-world” nature in that pages can reach other pages with only a small number of links, and its scale-free nature (Adamic & Huberman, 2000; Barabasi & Albert, 1999; Barabasi & Bonabeau, 2003) (i.e., a feature implying that it is dominated by a relatively small number of Web pages that are connected to many others; these pages are called hubs and have a seemingly unlimited number of hyperlinks). Thus, the distribution of Web page linkages follows a power law in that most nodes have just a few hyperlinks and some have a tremendous number of links In that sense, the system has no “scale” (see Figure 1).


Information ◽  
2020 ◽  
Vol 11 (7) ◽  
pp. 361 ◽  
Author(s):  
Raji Ghawi ◽  
Jürgen Pfeffer

Linked Open Data (LOD) refers to freely available data on the World Wide Web that are typically represented using the Resource Description Framework (RDF) and standards built on it. LOD is an invaluable resource of information due to its richness and openness, which create new opportunities for many areas of application. In this paper, we address the exploitation of LOD by utilizing SPARQL queries in order to extract social networks among entities. This enables the application of de-facto techniques from Social Network Analysis (SNA) to study social relations and interactions among entities, providing deep insights into their latent social structure.


Percurso ◽  
2019 ◽  
Vol 1 (28) ◽  
pp. 156
Author(s):  
Carina PESCAROLO ◽  
Marina ZAGONEL

RESUMOPartindo do notório avanço da tecnologia e do crescente uso das redes sociais para os mais variados fins na sociedade da informação, a presente pesquisa busca analisar em que medida a informação, referente a um indivíduo ou os dados por ele fornecidos nos mais variados domínios virtuais, podem ser livremente difundidos na rede mundial de computadores. Para tanto, analisam-se os conceitos de dignidade humana e os direitos da personalidade como elementos balizadores das condutas virtuais, tanto na internet quanto nas redes sociais. PALAVRAS-CHAVES: Sociedade da Informação; Redes Sociais; Dignidade Humana; Direitos da Personalidade. ABSTRACTStarting from the notorious advancement of technology and the increasing use of social networks for the most varied purposes in the information society, the present research seeks to analyze to what extent the information, referring to an individual or the data provided by him in the most varied virtual domains, can be freely disseminated on the world wide web. For that, the concepts of human dignity and personality rights are analyzed as guiding elements of virtual behaviors, both on the Internet and in social networks. KEYWORDS: Information Society; Social Networks; Human Dignity; Rights of the Personality.


Author(s):  
Artur Sancho Marques ◽  
José Figueiredo

Inspired by patterns of behavior generated in social networks, a prototype of a new object was designed and developed for the World Wide Web – the stigmergic hyperlink or “stigh”. In a system of stighs, like a Web page, the objects that users do use grow “healthier”, while the unused “weaken”, eventually to the extreme of their “death”, being autopoieticaly replaced by new destinations. At the single Web page scale, these systems perform like recommendation systems and embody an “ecological” treatment to unappreciated links. On the much wider scale of generalized usage, because each stigh has a method to retrieve information about its destination, Web agents in general and search engines in particular, would have the option to delegate the crawling and/or the parsing of the destination. This would be an interesting social change: after becoming not only consumers, but also content producers, Web users would, just by hosting (automatic) stighs, become information service providers too.


Author(s):  
Mark Newman

An overview of topics discussed in the book. The introduction starts with a discussion of a range of example networks including the internet, social networks, the world wide web, and biological and ecological networks, followed by a discussion of methods for analyzing network data and properties of observed networks, such as degrees, centrality, degree distributions, the small-world effect, and community structure. The chapter ends with an outline of the rest of the book.


2019 ◽  
Vol 5 (5) ◽  
pp. 241-259
Author(s):  
Kyldes Batista Vicente ◽  
Fábio d'Abadia de Sousa

Neste texto discutimos alguns aspectos relacionados ao uso de fotografias em redes sociais. A nossa abordagem questiona o fato de a fotografia ser apresentada de forma geralmente editada, a fim de passar uma impressão falseada daquilo que o internauta realmente é. A nossa discussão também chama a atenção para o fato de que as vidas perfeitas divulgadas nas fotografias pessoais postadas na rede mundial de computadores contribuem também para a implantação de preconceitos contra os que não se encaixam no padrão de aparência ditado. Partiremos de um texto poético e, por isso, traremos algumas reflexões acerca da literatura como arte e a literatura de Álvaro de Campos, heterônimo de Fernando Pessoa.   PALAVRAS-CHAVE: Fotografias; redes sociais; arte e literatura.   ABSTRACT In this text we discuss some aspects related to the use of photographs in social networks. Our approach questions the fact that the photograph is presented in a generally edited way, in order to give a false impression of what the user really is. Our discussion also draws attention to the fact that the perfect lives revealed in personal photographs posted on the World Wide Web also contribute to the introduction of preconception against those who do not fit into the dictation appearance pattern. We will start with a poetic text and, therefore, we will bring some reflections about literature as art and the literature of Álvaro de Campos, heteronymous of Fernando Pessoa.   KEYWORDS: Photographs; social networks; art and literature.     RESUMEN En ese texto discutimos algunos aspectos relacionados al uso de fotografías en redes sociales. Nuestro abordaje cuestiona el hecho de la fotografía ser presentada de forma generalmente editada, con el fin de transmitir una impresión falsa de aquello que el internauta realmente es. Nuestra discusión también llama la atención para el hecho de que las vidas perfectas divulgadas en las fotografías personales publicadas en la red mundial de computadoras contribuyen también para la implantación de prejuicios contra los que no se encajan en el patrón de apariencia dictado. Partiremos de un texto poético y, por ello, traemos algunas reflexiones acerca de la literatura como arte y la literatura de Álvaro de Campos, heterónimo de Fernando Pessoa.   PALABRAS CLAVE: Fotografías; redes sociales; arte y literatura.


2021 ◽  
Vol 14 (5) ◽  
pp. 757-770
Author(s):  
Zhe Lin ◽  
Fan Zhang ◽  
Xuemin Lin ◽  
Wenjie Zhang ◽  
Zhihong Tian

The model of k -core and its decomposition have been applied in various areas, such as social networks, the world wide web, and biology. A graph can be decomposed into an elegant k -core hierarchy to facilitate cohesive subgraph discovery and network analysis. As many real-life graphs are fast evolving, existing works proposed efficient algorithms to maintain the coreness value of every vertex against structure changes. However, the maintenance of the k -core hierarchy in existing studies is not complete because the connections among different k -cores in the hierarchy are not considered. In this paper, we study hierarchical core maintenance which is to compute the k -core hierarchy incrementally against graph dynamics. The problem is challenging because the change of hierarchy may be large and complex even for a slight graph update. In order to precisely locate the area affected by graph dynamics, we conduct in-depth analyses on the structural properties of the hierarchy, and propose well-designed local update techniques. Our algorithms significantly outperform the baselines on runtime by up to 3 orders of magnitude, as demonstrated on 10 real-world large graphs.


2012 ◽  
Vol 67 (1-2) ◽  
pp. 61-64 ◽  
Author(s):  
Yilun Shang

A common property of many, though not all, massive real-world networks, including the World- Wide Web, the Internet, and social networks, is that the connectivity of the various nodes follows a scale-free distribution, P(k) ∞ k-α, with typical scaling exponent 2≤α≤3. In this letter, we prove that the Erdős-Ŕenyi random graph with unbounded expected degrees has a scale-free behaviour with scaling exponent 1=2 in a neighbourhood of expected degree hki. This interesting phenomenon shows a discrepancy from the Erdős-Ŕenyi random graph with bounded expected degree, which has a bell shaped connectivity distribution, peaking at 〈k〉, and decaying exponentially for large k.


Sign in / Sign up

Export Citation Format

Share Document