1,721,541 research outputs found
Generalized minimum spanning tree games
No full textThe minimum-cost spanning tree game is a special class of cooperative games defined on a graph with a set of vertices and a set of edges, where each player owns a vertex. Solutions of the game represent ways to distribute the total cost of a minimum-cost spanning tree among all the players. When the graph is partitioned into clusters, the generalized minimum spanning tree problem is to determine a minimum-cost tree including exactly one vertex from each cluster. This paper introduces the generalized minimum spanning tree game and studies some properties of this game. The paper also describes a constraint generation algorithm to calculate a stable payoff distribution and presents computational results obtained using the proposed algorith
Tier structure of strongly endotactic reaction networks
Full text linkReaction networks are mainly used to model the time-evolution of molecules of interacting chemical species. Stochastic models are typically used when the counts of the molecules are low, whereas deterministic models are often used when the counts are in high abundance. The mathematical study of reaction networks has increased dramatically over the last two decades as these models are now routinely used to investigate cellular behavior. In 2011, the notion of “tiers” was introduced to study the long time behavior of deterministically modeled reaction networks that are weakly reversible and have a single linkage class. This “tier” based argument was analytical in nature. Later, in 2014, the notion of a strongly endotactic network was introduced in order to generalize the previous results from weakly reversible networks with a single linkage class to this wider family of networks. The point of view of this later work was more geometric and algebraic in nature. The notion of strongly endotactic networks was later used in 2018 to prove a large deviation principle for a class of stochastically modeled reaction networks. In the current paper we provide an analytical characterization of strongly endotactic networks in terms of tier structures. By doing so, we not only shed light on the connection between the two points of view, but also make available a new proof technique for the study of strongly endotactic networks. We show the power of this new technique in two distinct ways. First, we demonstrate how the main previous results related to strongly endotactic networks, both for the deterministic and stochastic modeling choices, can be quickly obtained from our characterization. Second, we demonstrate how new results can be obtained by proving that a sub-class of strongly endotactic networks, when modeled stochastically, is positive recurrent. Finally, and similarly to recent independent work by Agazzi and Mattingly, we provide an example which closes a conjecture in the negative by showing that stochastically modeled strongly endotactic networks can be transient (and even explosive)
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Optimization techniques for multivariate least trimmed absolute deviation estimation
No full textGiven a dataset an outlier can be defined as an observation that it is unlikely to follow the statistical properties of the majority of the data. Computation of the location estimate of is fundamental in data analysis, and it is well known in statistics that classical methods, such as taking the sample average, can be greatly affected by the presence of outliers in the data. Using the median instead of the mean can partially resolve this issue but not completely. For the univariate case, a robust version of the median is the Least Trimmed Absolute Deviation (LTAD) robust estimator introduced in [18], which has desirable asymptotic properties such as robustness, consistently, high breakdown and normality. There are different generalizations of the LTAD for multivariate data, depending on the choice of norm. In [5] we present such a generalization using the Euclidean norm and propose a solution technique for the resulting combinatorialoptimization problem, based on a necessary condition, that results in a highly convergent local search algorithm. In this subsequent work we use the L1 norm to generalize the LTAD to higher dimensions, and show that the resulting mixed integer programming problem has an integral relaxation, after applying an appropriate data transformation. Moreover, we utilize the structure of the problem to show that the resulting LP’s can be solved efficiently using a subgradient optimization approach. The robust statistical properties of the proposed estimator are verified by extensive computational results
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
