Springer Proceedings in Mathematics & Statistics
This essay questions whether digital literary studies can still be meaningfully regarded as part of literary studies. This heretical question is motivated by a praxeological view of a research project for the network analysis of dramatic texts, in particular by reflecting on the project’s underlying ›epistemic thing‹, which in this case consists of specifically-formatted structural data (and not the actual primary texts themselves). What does this corpus of structural data, which was extracted from 465 plays spanning the period from 1730 to 1930, have to do with the ›epistemic things‹ of literary studies? We explore this question by providing insight into our analyses, which describe the structural evolution of the ›plays‹, try to locate ›small world‹ properties in our corpus, and develop new metrics for plot analysis. The results show not only how digital methods can supplement or enrich literary studies; they also raise questions about how digital the field of literary studies already is, since its research objects are increasingly available in digital forms.
We consider an application of long-range interaction centrality (LRIC) to the problem of the influence assessment in the global retail food network. Firstly, we reconstruct an initial graph into the graph of directed intensities based on individual node’s characteristics and possibility of the group influence. Secondly, we apply different models of the indirect influence estimation based on simple paths and random walks. This approach can help us to estimate node-to-node influence in networks. Finally, we aggregate node-to-node influence into the influence index. The model is applied to the food trade network based on the World International Trade Solution database. The results obtained for the global trade by different product commodities are compared with classical centrality measures.
In this paper we provide the methodology for evaluating ef- fectiveness of international sanctions using Data Envelopment Analysis (DEA), which we use for generating the network matrix for further anal- ysis. DEA is a non-parametric technique used to compare performance of similar units, such as departments or organizations. DEA has wide applications in all industries, and has been successfully used to compare performance of hospitals, banks, universities, etc. The most important advantage of this technique is that it can handle multiple input and out- put variables, even those not generally comparable to each other. We use the ”Threat and Imposition of Sanctions (TIES)” Data 4.0 for analysis. This database contains the largest number of cases of international sanctions (1412 from the years 1945-2005) imposed by some countries on others, takes into account simultaneous sanction imposition, and also estimates the cost of all sanctions - both for those who receive and those who impose them. As input variables for DEA model we use the impact of sender commitment, anticipated target and sender economic costs, and actual target and sender economic costs. As the output variable, we use the outcome of sanctions for senders. We describe how to use DEA cross-efficiency outputs to build the network of sanction episodes. Our proposed combination of DEA and network methodology allows us to cluster sanction episodes depending on their outcomes, and provides explanations of higher efficiency of one group of sanction episodes over the others.
The series “Studies in Computational Intelligence” (SCI) publishes new developments and advances in the various areas of computational intelligence—quickly and with a high quality. The intent is to cover the theory, applications, and design methods of computational intelligence, as embedded in the fields of engineering, computer science, physics and life sciences, as well as the methodologies behind them. The series contains monographs, lecture notes and edited volumes in computational intelligence spanning the areas of neural networks, connectionist systems, genetic algorithms, evolutionary computation, artificial intelligence, cellular automata, self-organizing systems, soft computing, fuzzy systems, and hybrid intelligent systems. Of particular value to both the contributors and the readership are the short publication timeframe and the world-wide distribution, which enable both wide and rapid dissemination of research output. The books of this series are submitted to indexing to Web of Science, EI-Compendex, DBLP, SCOPUS, Google Scholar and Springerlink.
Of late, the network analysis of literary texts has grown into an independent research field of digital literary studies. Since analysing the network structure of unique texts promises just marginal results, the perspective should shift towards a ‘distant reading’ of hundreds or thousands of texts. In this paper, we describe how the process of formalising literary data is facilitated by machine-readable corpora comprising hundreds of dramatic texts in several languages. Taking a corpus of roughly 500 German-language dramas as an example, we demonstrate how the calculation of network metrics and visualisations can deliver new material for interpretation and offer new insights into the evolution of drama.
Springer Proceedings in Complexity publishes proceedings from scholarly meetings on all topics relating to the interdisciplinary studies of complex systems science. Springer welcomes book ideas from authors. The series is indexed in Scopus. Proposals must include the following: - name, place and date of the scientific meeting - a link to the committees (local organization, international advisors etc.) - scientific description of the meeting - list of invited/plenary speakers - an estimate of the planned proceedings book parameters (number of pages/articles, requested number of bulk copies, submission deadline) Submit your proposals to: email@example.com
Contributions in this volume focus on computationally efficient algorithms and rigorous mathematical theories for analyzing large-scale networks. Researchers and students in mathematics, economics, statistics, computer science and engineering will find this collection a valuable resource filled with the latest research in network analysis. Computational aspects and applications of large-scale networks in market models, neural networks, social networks, power transmission grids, maximum clique problem, telecommunication networks, and complexity graphs are included with new tools for efficient network analysis of large-scale networks.
This proceeding is a result of the 7th International Conference in Network Analysis, held at the Higher School of Economics, Nizhny Novgorod in June 2017. The conference brought together scientists, engineers, and researchers from academia, industry, and government.