1,720,989 research outputs found
Blobbed topological recursion for correlation functions in tensor models
No full textInternational audienceTensor models are generalizations of matrix models and as such, it is a natural question to ask whether they satisfy some form of the topological recursion. The world of unitary-invariant observables is however much richer in tensor models than in matrix models. It is therefore a priori unclear which set of observables could satisfy the topological recursion. Such a set of observables was identified a few years ago in the context of the quartic melonic model by the first author and Dartois. It was shown to satisfy an extension of the topological recursion introduced by Borot and called the blobbed topological recursion. Here we show that this set of observables is present in arbitrary tensor models which have non-vanishing couplings for the quartic melonic interactions. It satisfies the blobbed topological recursion in a universal way, i.e. independently of the choices of the other interactions. In combinatorial terms, the correlation functions describe stuffed maps with colored boundary components. The specifics of the model only appear in the generating functions of the stuffings and the blobbed topological recursion only requires them to have well-defined expansions. The spectral curve is a disjoint union of Gaussian spectral curves, with the cylinder function receiving an additional holomorphic part. This result is achieved via a perturbative rewriting of tensor models as multi-matrix models due to the first author, Lionni and Rivasseau. It is then possible to formally integrate all degrees of freedom except those which enter the topological recursion, meaning interpreting the Feynman graphs as stuffed maps. We further provide new expressions to relate the expectations of -invariant observables on the tensor and matrix sides
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
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
Maximizing the number of edges in three-dimensional colored triangulations whose building blocks are balls
No full textInternational audienceColored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like maps are gluings of polygons, colored triangulations are built as gluings of special, higher-dimensional building blocks, such as octahedra, which we call colored building blocks and known in the dual as bubbles. A colored building block is determined by its boundary triangulation, which in the case of polygons is simply characterized by its length. In three dimensions, colored building blocks are labeled by some 2D triangulations and those homeomorphic to the 3-ball are labeled by the subset of planar ones. Similarly to Euler's formula in 2D which provides an upper bound to the number of vertices at fixed number of polygons with given lengths, we look in three dimensions for an upper bound on the number of edges at fixed number of given colored building blocks. In this article we solve this problem when all colored building blocks, except possibly one, are homeomorphic to the 3-ball. To do this, we find a characterization of the way a colored building block homeomorphic to the ball has to be glued to other blocks of arbitrary topology in a colored triangulation which maximizes the number of edges. This local characterization can be extended to the whole triangulation as long as there is at most one colored building block which is not a 3-ball. The triangulations obtained this way are in bijection with trees. The number of edges is given as an independent sum over the building blocks of such a triangulation. In the case of all colored building blocks being homeomorphic to the 3-ball, we show that these triangulations are homeomorphic to the 3-sphere. Those results were only known for the octahedron and for melonic building blocks before. This article is self-contained and can be used as an introduction to colored triangulations and their bubbles from a purely combinatorial point of view
Tensor models with generalized melonic interactions
No full textInternational audienceTensor models are natural generalizations of matrix models. The interactions and observables in the case of unitary invariant models are generalizations of matrix traces. Some notable interactions in the literature include the melonic ones, the tetrahedral one as well as the planar ones in rank three, or necklaces in even ranks. Here we introduce generalized melonic interactions which generalize the melonic and necklace interactions. We characterize them as tree-like gluings of quartic interactions. We also completely characterize the Feynman graphs which contribute to the large limit. For a subclass of generalized melonic interactions called totally unbalanced interactions, we prove that the large limit is Gaussian and therefore the Feynman graphs are in bijection with trees. This result further extends the class of tensor models which fall into the Gaussian universality class. Another key aspect of tensor models with generalized melonic interactions is that they can be written as matrix models without increasing the number of degrees of freedom of the original tensor models. In the case of totally unbalanced interactions, this new matrix model formulation in fact decreases the number of degrees of freedom, meaning that some of the original degrees of freedom are effectively integrated. We then show how the large Gaussian behavior can be reproduced using a saddle point analysis on those matrix models
Another Proof of the Expansion of the Rank Three Tensor Model with Tetrahedral Interaction
No full textInternational audienceThe rank three tensor model with tetrahedral interaction was shown by Carrozza and Tanasa to admit a expansion, dominated by melonic diagrams, and double tadpoles decorated with melons at next-to-leading order. This model has generated a renewed interest in tensor models because it has the same large limit as the SYK model. In contrast with matrix models, there is no method which would be able to prove the existence of expansions in arbitrary tensor models. The method used by Carrozza and Tanasa proves the existence of the expansion using two-dimensional topology, before identifying the leading order and next-to-leading graphs. However, another method was required for complex, rank three tensor models with planar interactions, which is based on flips. The latter are moves which cut two propagators of Feynman graphs and reglue them differently. They allow transforming graphs while tracking their orders in the expansion. Here we use this method to re-prove the results of Carrozza and Tanasa, thereby proving the existence of the expansion, the melonic dominance at leading order and the melon-decorated double tadpoles at next-to-leading order, all in one go
- …
