Clones in Graphs

Finding structural similarities in graph data, like social networks, is a far-ranging task in data mining and knowledge discovery. A (conceptually) simple reduction would be to compute the automorphism group of a graph. However, this approach is ineffective in data mining since real world data does not exhibit enough structural regularity. Here we step in with a novel approach based on mappings that preserve the maximal cliques. For this we exploit the well known correspondence between bipartite graphs and the data structure formal context $(G,M,I)$ from Formal Concept Analysis. From there we utilize the notion of clone items. The investigation of these is still an open problem to which we add new insights with this work. Furthermore, we produce a substantial experimental investigation of real world data. We conclude with demonstrating the generalization of clone items to permutations.Comment: 11 pages, 2 figures, 1 tabl

Seeds Buffering for Information Spreading Processes

Seeding strategies for influence maximization in social networks have been studied for more than a decade. They have mainly relied on the activation of all resources (seeds) simultaneously in the beginning; yet, it has been shown that sequential seeding strategies are commonly better. This research focuses on studying sequential seeding with buffering, which is an extension to basic sequential seeding concept. The proposed method avoids choosing nodes that will be activated through the natural diffusion process, which is leading to better use of the budget for activating seed nodes in the social influence process. This approach was compared with sequential seeding without buffering and single stage seeding. The results on both real and artificial social networks confirm that the buffer-based consecutive seeding is a good trade-off between the final coverage and the time to reach it. It performs significantly better than its rivals for a fixed budget. The gain is obtained by dynamic rankings and the ability to detect network areas with nodes that are not yet activated and have high potential of activating their neighbours.Comment: Jankowski, J., Br\'odka, P., Michalski, R., & Kazienko, P. (2017, September). Seeds Buffering for Information Spreading Processes. In International Conference on Social Informatics (pp. 628-641). Springe

Controls on the composition and lability of dissolved organic matter in Siberia's Kolyma River basin

High-latitude northern rivers export globally significant quantities of dissolved organic carbon (DOC) to the Arctic Ocean. Climate change, and its associated impacts on hydrology and potential mobilization of ancient organic matter from permafrost, is likely to modify the flux, composition, and thus biogeochemical cycling and fate of exported DOC in the Arctic. This study examined DOC concentration and the composition of dissolved organic matter (DOM) across the hydrograph in Siberia's Kolyma River, with a particular focus on the spring freshet period when the majority of the annual DOC load is exported. The composition of DOM within the Kolyma basin was characterized using absorbance-derived measurements (absorbance coefficienta330, specific UV absorbance (SUVA254), and spectral slope ratio SR) and fluorescence spectroscopy (fluorescence index and excitation-emission matrices (EEMs)), including parallel factor analyses of EEMs. Increased surface runoff during the spring freshet led to DOM optical properties indicative of terrestrial soil inputs with high humic-like fluorescence, SUVA254, and low SRand fluorescence index (FI). Under-ice waters, in contrast, displayed opposing trends in optical properties representing less aromatic, lower molecular weight DOM. We demonstrate that substantial losses of DOC can occur via biological (∼30% over 28 days) and photochemical pathways (>29% over 14 days), particularly in samples collected during the spring freshet. The emerging view is therefore that of a more dynamic and labile carbon pool than previously thought, where DOM composition plays a fundamental role in controlling the fate and removal of DOC at a pan-Arctic scale

The Parameterized Complexity of Centrality Improvement in Networks

The centrality of a vertex v in a network intuitively captures how important v is for communication in the network. The task of improving the centrality of a vertex has many applications, as a higher centrality often implies a larger impact on the network or less transportation or administration cost. In this work we study the parameterized complexity of the NP-complete problems Closeness Improvement and Betweenness Improvement in which we ask to improve a given vertex' closeness or betweenness centrality by a given amount through adding a given number of edges to the network. Herein, the closeness of a vertex v sums the multiplicative inverses of distances of other vertices to v and the betweenness sums for each pair of vertices the fraction of shortest paths going through v. Unfortunately, for the natural parameter "number of edges to add" we obtain hardness results, even in rather restricted cases. On the positive side, we also give an island of tractability for the parameter measuring the vertex deletion distance to cluster graphs

Safety and Pharmacokinetics of Multiple Doses of Intravenous Ofloxacin in Healthy Volunteers

The safety and pharmacokinetics of ofloxacin in 48 healthy male volunteers were studied in a two-center, randomized, double-blind, placebo-controlled study. Ofloxacin (200 or 400 mg) or placebo was administered as 1-h infusions every 12 h for 7 days. Plasma ofloxacin concentrations were measured by high-performance liquid chromatography. Mean harmonic half-lives ranged from 4.28 to 4.98 h in the 200-mg dosing group and from 5.06 to 6.67 h in the 400-mg dosing group. Intragroup comparisons of trough plasma concentration-versus-time data from study days 2 through 7 revealed that steady state was achieved by day 2 of both multiple-dose regimens. Intergroup comparisons of mean harmonic half-lives, the areas under the concentration-time curve from 0 to 12 and 0 to 60 h, clearance, and apparent volume of distribution (area method) revealed that the pharmacokinetics of ofloxacin are dose independent. Both ofloxacin dosage regimens appeared to be reasonably well tolerated. The two dosage regimens of ofloxacin, 200 or 400 mg every 12 h, appear to be safe and provide serum drug concentrations in excess of the MICs for most susceptible pathogens over the entire dosing interval

Null Models of Economic Networks: The Case of the World Trade Web

In all empirical-network studies, the observed properties of economic networks are informative only if compared with a well-defined null model that can quantitatively predict the behavior of such properties in constrained graphs. However, predictions of the available null-model methods can be derived analytically only under assumptions (e.g., sparseness of the network) that are unrealistic for most economic networks like the World Trade Web (WTW). In this paper we study the evolution of the WTW using a recently-proposed family of null network models. The method allows to analytically obtain the expected value of any network statistic across the ensemble of networks that preserve on average some local properties, and are otherwise fully random. We compare expected and observed properties of the WTW in the period 1950-2000, when either the expected number of trade partners or total country trade is kept fixed and equal to observed quantities. We show that, in the binary WTW, node-degree sequences are sufficient to explain higher-order network properties such as disassortativity and clustering-degree correlation, especially in the last part of the sample. Conversely, in the weighted WTW, the observed sequence of total country imports and exports are not sufficient to predict higher-order patterns of the WTW. We discuss some important implications of these findings for international-trade models.Comment: 39 pages, 46 figures, 2 table

Hierarchy measure for complex networks

Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure.Comment: 29 pages, 9 figures, 4 table

Community structure and patterns of scientific collaboration in Business and Management

This is the author's accepted version of this article deposited at arXiv (arXiv:1006.1788v2 [physics.soc-ph]) and subsequently published in Scientometrics October 2011, Volume 89, Issue 1, pp 381-396. The final publication is available at link.springer.com http://link.springer.com/article/10.1007%2Fs11192-011-0439-1Author's note: 17 pages. To appear in special edition of Scientometrics. Abstract on arXiv meta-data a shorter version of abstract on actual paper (both in journal and arXiv full pape

Social Cohesion, Structural Holes, and a Tale of Two Measures

EMBARGOED - author can archive pre-print or post-print on any open access repository after 12 months from publication. Publication date is May 2013 so embargoed until May 2014.This is an author’s accepted manuscript (deposited at arXiv arXiv:1211.0719v2 [physics.soc-ph] ), which was subsequently published in Journal of Statistical Physics May 2013, Volume 151, Issue 3-4, pp 745-764. The final publication is available at link.springer.com http://link.springer.com/article/10.1007/s10955-013-0722-

Dynamics in online social networks

An increasing number of today's social interactions occurs using online social media as communication channels. Some online social networks have become extremely popular in the last decade. They differ among themselves in the character of the service they provide to online users. For instance, Facebook can be seen mainly as a platform for keeping in touch with close friends and relatives, Twitter is used to propagate and receive news, LinkedIn facilitates the maintenance of professional contacts, Flickr gathers amateurs and professionals of photography, etc. Albeit different, all these online platforms share an ingredient that pervades all their applications. There exists an underlying social network that allows their users to keep in touch with each other and helps to engage them in common activities or interactions leading to a better fulfillment of the service's purposes. This is the reason why these platforms share a good number of functionalities, e.g., personal communication channels, broadcasted status updates, easy one-step information sharing, news feeds exposing broadcasted content, etc. As a result, online social networks are an interesting field to study an online social behavior that seems to be generic among the different online services. Since at the bottom of these services lays a network of declared relations and the basic interactions in these platforms tend to be pairwise, a natural methodology for studying these systems is provided by network science. In this chapter we describe some of the results of research studies on the structure, dynamics and social activity in online social networks. We present them in the interdisciplinary context of network science, sociological studies and computer science.Comment: 17 pages, 4 figures, book chapte