### Book

## Models, Algorithms, and Technologies for Network Analysis

This volume contains a selection of contributions from the "First International Conference in Network Analysis," held at the University of Florida, Gainesville, on December 14-16, 2011. The remarkable diversity of fields that take advantage of Network Analysis makes the endeavor of gathering up-to-date material in a single compilation a useful, yet very difficult, task. The purpose of this volume is to overcome this difficulty by collecting the major results found by the participants and combining them in one easily accessible compilation.

The notion of a metric modular on an arbitrary set and the corresponding modular spaces, generalizing classical modulars over linear spaces and Orlicz spaces, were recently introduced and studied by the author [Chistyakov: Dokl. Math. 73(1):32–35, 2006 and Nonlinear Anal. 72(1):1–30, 2010]. In this chapter we present yet one more application of the metric modulars theory to the existence of fixed points of modular contractive maps in modular metric spaces. These are related to contracting generalized average velocities rather than metric distances, and the successive approximations of fixed points converge to the fixed points in the modular sense, which is weaker than the metric convergence. We prove the existence of solutions to a Carathéodory-type differential equation with the right-hand side from the Orlicz space. Metric modular, Modular convergence, Modular contraction, Fixed point, Mapping of finite f-variation, Carathéodory-type differential equation

The distribution of the sum of independent random variables plays an important role in many problems of applied mathematics. In this paper we concentrate on the case when random variables have a continuous distribution with a discontinuity (or a probability mass) at a certain point r. Such a distribution arises naturally in actuarial mathematics when a responsibility or a retention limit is applied to every claim payment. An analytical expression for the distribution of the sum of i.i.d. random variables, which have a uniform distribution with a discontinuity, is reported.

In this paper we introduce a new pattern-based approach within the Linear Assignment Model with the purpose to design heuristics for a combinatorial optimization problem (COP). We assume that the COP has an additive (separable) objective function and the structure of a feasible (optimal) solution to the COP is predefined by a collection of cells (positions) in an input file. We define a pattern as a collection of positions in an instance problem represented by its input file (matrix). We illustrate the notion of pattern by means of some well known problems in COP among them the Linear Ordering Problem, Cell Formation Problem (CFP) just to mention a couple. The CFP is defined on a Boolean input matrix which rows represent machines and columns - parts. The CFP consists in finding three optimal objects: a block-diagonal collection of rectangles, a rows (machines) permutation, and a columns (parts) permutation such that the grouping efficacy is maximized. The suggested heuristic combines two procedures: the pattern-based procedure to build an initial solution and an improvement procedure to obtain a final solution with high grouping efficacy for the CFP. Our computational experiments with the most popular set of 35 benchmark instances show that our heuristic outperforms all well known heuristics and returns either the best known or improved solutions to the CFP.

Dynamics of solitons in the frame of the extended nonlinear Schr¨odinger equation (NSE) taking into account stimulated Raman scattering (SRS) and inhomogeneous second-order dispersion (SOD) is considered. Compensation of soliton Raman self-wave number downshift in media with increasing second-order linear dispersion is shown. Quasi-soliton solution with small wave number spectrum variation, amplitude and extension are found analytically in adiabatic approximation and numerically. The soliton is considered as the equilibrium of SRS and increasing SOD. For dominate SRS soliton wave number spectrum tends to long wave region. For dominate increasing SOD soliton wave number spectrum tends to shortwave region.

The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkin’s ground breaking contributions in various fields of decision making and data analysis have marked the fourth quarter of the 20th century and beyond. Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hidden structures—first of all, clusters, orderings, and hierarchies—in multivariate and/or network data.

This volume contains a collection of papers reflecting recent developments rooted in Mirkin's fundamental contribution to the state-of-the-art in group choice, ordering, clustering, data mining, and knowledge discovery. Researchers, students, and software engineers will benefit from new knowledge discovery techniques and application directions.

Methods of network analysis are used in this paper for mapping the local academic community of St. Petersburg sociologists. The survey data on relations between individual scholars serve as a guide in reconstruction of the communitys network history as well as a system of independent variables in accounting for differences between its various natural zones. In this manner, the paper explores the points of convergence between Chicago school social ecology and modern social network analysis.

The article introduces a historical-sociological research project reconstructing intellectual and institutional transformations of post-soviet social sciences in the last 25 years. The projects ambition was to achieve this aim via applying classical community study research strategy and various methods derived from social science history to the case of St. Petersburg sociologists. We identified 622 individuals as St. Petersburg sociologists and traced records of their institutional trajectories, appearance in print, citing behaviour, social networks, political attitudes, sources of income, professional authorities, and attention spaces through 25 years.

This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.

The current paper aims to present the Scan-4-Light study, which was conducted for the systematic scanning and analysis of the Searchlight newsletters as a rapidly growing collection of articles on trends and topics in development and poverty. Built upon the concept of the systemic foresight methodology, the Scan-4-Light approach involves the integrated use of horizon scanning, network analysis and evolutionary scenarios combined with expert consultations and workshops. The study identified the emerging trends, issues, weak signals and wild cards; created high-value visualisations to emphasize the results and findings; and produced narratives to increase the impact and awareness of the development issues. The Scan-4-Light project has resulted in a large number of specific outputs, providing the views of the Searchlight newsletters' contents at various levels of granularity. It has set out to show how the tools used here can be applied to illustrate the relationships among issues, and how these vary across countries and regions over time, and are linked to various stakeholders and possible solutions to problems. Scan-4-Light demonstrates how foresight tools and techniques can be used for the analysis of complex and uncertain issues, such as development and poverty, in a systemic way. The Scan-4-Light approach can be applied in a number of areas for scanning and identifying emerging trends and issues, and understanding the relationships between systems and solutions. The paper gives evidence that most of the issues, if not all, related to development are not isolated, but interlinked and interconnected. They require more holistic understanding and intervention with an effective collaboration between stakeholders.

The manual is devoted to the mathematical theory and methods of optimization applied to administrative decisions in economy. Volume 1 described approaches to mathematical modeling of management problems in economy and methods of mathematical programming tasks solution. Besides strict mathematical proofs, there are directing reasons, which is sometimes enough for understanding. There are many economic examples and exercises with detailed solutions. Readers are supposed to know the bases of the mathematical analysis and linear algebra, though necessary data from these courses in a concise form are provided in appendices.

Semantic network reduction is considered in application to visual analytics of relational data. Merging structurally equivalent nodes it is straightforward to construct a reduced semantic network that completely species the initial structure of relations between nodes. This paper presents the analysis of such reduction applied to the communication network from Stanford Large Network Dataset Collection. It is shown how the reduction based on structural equivalence can help in visualization of large semantic networks.

Let k be a field of characteristic zero, let G be a connected reductive algebraic group over k and let g be its Lie algebra. Let k(G), respectively, k(g), be the field of k- rational functions on G, respectively, g. The conjugation action of G on itself induces the adjoint action of G on g. We investigate the question whether or not the field extensions k(G)/k(G)^G and k(g)/k(g)^G are purely transcendental. We show that the answer is the same for k(G)/k(G)^G and k(g)/k(g)^G, and reduce the problem to the case where G is simple. For simple groups we show that the answer is positive if G is split of type A_n or C_n, and negative for groups of other types, except possibly G_2. A key ingredient in the proof of the negative result is a recent formula for the unramified Brauer group of a homogeneous space with connected stabilizers. As a byproduct of our investigation we give an affirmative answer to a question of Grothendieck about the existence of a rational section of the categorical quotient morphism for the conjugating action of G on itself.

Let G be a connected semisimple algebraic group over an algebraically closed field k. In 1965 Steinberg proved that if G is simply connected, then in G there exists a closed irreducible cross-section of the set of closures of regular conjugacy classes. We prove that in arbitrary G such a cross-section exists if and only if the universal covering isogeny Ĝ → G is bijective; this answers Grothendieck's question cited in the epigraph. In particular, for char k = 0, the converse to Steinberg's theorem holds. The existence of a cross-section in G implies, at least for char k = 0, that the algebra k[G]G of class functions on G is generated by rk G elements. We describe, for arbitrary G, a minimal generating set of k[G]G and that of the representation ring of G and answer two Grothendieck's questions on constructing generating sets of k[G]G. We prove the existence of a rational (i.e., local) section of the quotient morphism for arbitrary G and the existence of a rational cross-section in G (for char k = 0, this has been proved earlier); this answers the other question cited in the epigraph. We also prove that the existence of a rational section is equivalent to the existence of a rational W-equivariant map T- - - >G/T where T is a maximal torus of G and W the Weyl group.