We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
For the clustering problem with general (not necessarily symmetric) relational constraints, different sets of feasible clusterings, also called clustering types, determined by the same relation, can be defined. In this paper some clustering types are discussed and adaptations of the hierarchical clustering method compatible with these clustering types are proposed.
Drawing examples from real-world networks, this essential book traces the methods behind network analysis and explains how network data is first gathered, then processed and interpreted. The text will equip you with a toolbox of diverse methods and data modelling approaches, allowing you to quickly start making your own calculations on a huge variety of networked systems. This book sets you up to succeed, addressing the questions of what you need to know and what to do with it, when beginning to work with network data. The hands-on approach adopted throughout means that beginners quickly become capable practitioners, guided by a wealth of interesting examples that demonstrate key concepts. Exercises using real-world data extend and deepen your understanding, and develop effective working patterns in network calculations and analysis. Suitable for both graduate students and researchers across a range of disciplines, this novel text provides a fast-track to network data expertise.
The strengths of this book include the directness of its encounter with research data, its advice on practical data analysis issues, careful critiques of analysis results, its use of modern data analysis tools and approaches, its use of simulation and other computer-intensive methods where these provide insight or give results that are not otherwise available, its attention to graphical and other presentation issues, its use of examples drawn from across the range of statistical applications, the links that it makes into the debate over reproducibility in science, and the inclusion of code that reproduces analyses. The methods that we cover have wide application. The datasets, many of which have featured in published papers, are drawn from many different fields. They reflect a journey in learning and understanding, alike for the authors and for those with whom they have worked, that has ranged widely over many different research areas. The R system has brought into a common framework a huge range of abilities for data analysis, data manipulation and graphics. Our text has as its aim helping its readers to take full advantage of those abilities.
Given maps $f_1,\ldots ,f_n:X\to Y$ between (finite and connected) graphs, with $n\geq 3$ (the case $n=2$ is well known), we say that they are loose if they can be deformed by homotopy to coincidence free maps, and totally loose if they can be deformed by homotopy to maps which are two by two coincidence free. We prove that: (i) if Y is not homeomorphic to the circle, then any maps are totally loose; (ii) otherwise, any maps are loose and they are totally loose if and only if they are homotopic.
In this paper, we introduce a slight variation of the dominated-coupling-from-the-past (DCFTP) algorithm of Kendall, for bounded Markov chains. It is based on the control of a (typically non-monotonic) stochastic recursion by another (typically monotonic) one. We show that this algorithm is particularly suitable for stochastic matching models with bounded patience, a class of models for which the steady-state distribution of the system is in general unknown in closed form. We first show that the Markov chain of this model can easily be controlled by an infinite-server queue. We then investigate the particular case where patience times are deterministic, and this control argument may fail. In that case we resort to an ad-hoc technique that can also be seen as a control (this time, by the arrival sequence). We then compare this algorithm to the primitive coupling-from-the-past (CFTP) algorithm and to control by an infinite-server queue, and show how our perfect simulation results can be used to estimate and compare, for instance, the loss probabilities of various systems in equilibrium.
where $f: X \to {\Bbb R}$, X a set, finite or infinite, and K and $\mu $ denote a suitable kernel and a measure, respectively. Given a connected ordered graph G on n vertices, consider the multi-linear form
holds for all nonnegative real-valued functions $f_i$, $1\le i\le n$, on X. The basic question is, how does the structure of G and the mapping properties of the operator $T_K$ influence the sharp exponents in (0.1). In this paper, this question is investigated mainly in the case $X={\Bbb F}_q^d$, the d-dimensional vector space over the field with q elements, $K(x^i,x^j)$ is the indicator function of the sphere evaluated at $x^i-x^j$, and connected graphs G with at most four vertices.
Let G be a complex classical group, and let V be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of G-invariant polynomial functions on the space $\mathcal P^m(V)$ of degree-m homogeneous polynomial functions on V. In this paper, we replace $\mathcal P^m(V)$ with the full polynomial algebra $\mathcal P(V)$. As a result, the invariant ring is no longer finitely generated. Hence, instead of seeking generators, we aim to write down linear bases for bigraded components. Indeed, when G is of sufficiently high rank, we realize these bases as sets of graphs with prescribed number of vertices and edges. When the rank of G is small, there arise complicated linear dependencies among the graphs, but we remedy this setback via representation theory: in particular, we determine the dimension of an arbitrary component in terms of branching multiplicities from the general linear group to the symmetric group. We thereby obtain an expression for the bigraded Hilbert series of the ring of invariants on $\mathcal P(V)$. We conclude with examples using our graphical notation, several of which recover classical results.
This chapter is an introduction to Stata. We note the essential features and commands of the Stata statistical software package. Our objective is to familiarize the reader with the skills that will allow them to understand and complete the examples in the later chapters of our book. We describe the main components of the interface, followed by those of each Stata file option, e.g., do file, log file, and graphs. The third section of this chapter gives examples that readers can use to practice the most commonly used commands. Last, we summarize best practices for data management.
Human history has created a large variety of sign systems for communication. These systems were developed at different times for different purposes. While oral language has developed as part of human biological evolution, written texts, realistic pictures, maps, and graphs are cultural inventions. Human oral language might have originated from gestures supplemented by sound patterns. It is a biological anchored feature of the human species, as manifested in somatic, perceptual, and neurological pre-adaptations. Early writing systems used iconic ideograms which were gradually transformed into symbols. This made production and discrimination easier but increased the required amount of learning. Further development led to writing systems using phonograms plus orthographic ideograms. Realistic pictures are older than writing systems. They represent content by similarity but also show allegories of social relationships. Maps are realistic pictures of a geographic area facing the problem of how to present a curved earth surface on a two-dimensional surface. Graphs are visuo-spatial objects representing a subject matter based on analogy due to inherent common structural properties.
Interrupted time-series graphs are often judged by eye. Such a graph might show, for example, patient symptom severity (y) on each of several days (x) before and after a treatment was implemented (interruption). Such graphs might be prone to systematic misjudgment because of serial dependence, where random error at each timepoint persists into later timepoints. An earlier study (Matyas & Greenwood, 1990) showed evidence of systematic misjudgment, but that study has often been discounted due to methodological concerns. We address these concerns and others in two experiments. In both experiments, serial dependence increased mistaken judgments that the interrupting event led to a change in the outcome, though the pattern of results was less extreme than in previous work. Receiver operating characteristics suggested that serial dependence both decreased discriminability and increased the bias to decide that the interrupting event led to a change. This serial dependence effect appeared despite financial incentives for accuracy, despite feedback training, and even in participants who had graduate training relevant to the task. Serial dependence could cause random error to be misattributed to real change, thereby leading to judgments that interventions are effective even when they are not.
This chapter reviews the types, use, production, accessibility and efficacy of data visuals contained in IPCC assessments and special reports, drawing upon available published literature. Visuals of different types are key to the communication of IPCC assessments. They have been subject to academic interest among social and cognitive scientists. Furthermore, wider societal interest in the IPCC has increased, especially since the publication of its Fifth Assessment Report. In response, the IPCC has revisited its approach to communication including visuals, which has resulted in a greater professionalisation of its visualisations — involving information designers and cognitive scientists — and in new forms of co-production between authors and users.
A common belief is that systems of writing are committed to transparency and precise records of sound. The target is the language behind such marks. Readers, not viewers, matter most, and the most effective graphs largely record sound, not meaning. But what if embellishments mattered deeply - if hidden writing, slow to produce, slow to read, played as enduring a role as more accessible graphs? What if meaningful marks did service alongside records of spoken language? This book, a compilation of essays by global authorities on these subjects, zeroes in on hidden writing and alternative systems of graphic notation. Essays by leading scholars explore forms of writing that, by their formal intricacy, deflect attention from language. The volume also examines graphs that target meaning directly, without passing through the filter of words and the medium of sound. The many examples here testify to human ingenuity and future possibilities for exploring enriched graphic communication.
We consider a stochastic matching model with a general compatibility graph, as introduced by Mairesse and Moyal (2016). We show that the natural necessary condition of stability of the system is also sufficient for the natural ‘first-come, first-matched’ matching policy. To do so, we derive the stationary distribution under a remarkable product form, by using an original dynamic reversibility property related to that of Adan, Bušić, Mairesse, and Weiss (2018) for the bipartite matching model.
The chapter on visual models discusses basic ways that scientists create visual representations of their data, including charts and graphs, in order to understand their data better. Like all models, visual models are a simplified version of reality. Two of the visual models discussed in this chapter are the frequency table and histogram. The histogram, in particular, is useful in the shape of the distribution of data, skewness, kurtosis, and the number of peaks. Other visual models in the social sciences include frequency polygons, bar graphs, stem-and-leaf plots, line graphs, pie charts, and scatterplots. All of these visual models help researchers understand their data in different ways, though none is perfect for all situations. Modern technology has resulted in the creation of new ways to visualize data. These methods are more complex, but they provide data analysts with new insights into their data. The incorporation of geographic data, animations, and interactive tools give people more options than ever existed in previous eras.
Chapter 6 covers global flat foldability.This includes determining how we can tell if a crease pattern with multiple vertices will fold flat without forcing the paper to self-intersect, as well as discovering properties that all such crease patterns have, beyond what was covered in the previous chapter.Justin’s Theorem, which is a generalization of Kawasaki’s and Maekawa’s Theorems and whose proof uses elements of basic knot theory, is covered, as are Justin’s non-crossing conditions that provide necessary and sufficient conditions for a general crease pattern to fold flat.The matrix model from Chapter 5 is developed further to create a formal folding map for flat origami.Finally, Bern and Hayes’ seminal proof that determining flat foldability of a given crease pattern is NP-Hard is presented and updated with more recent results on box pleating.
The field of flat-foldable origami is introduced, which involves a mix of geometry and combinantorics.This chapter focuses on local properties of flat origami, meaning the study of how and when a single vertex in an origami crease pattern will be able to fold flat.The classic theorems of Kawasaki and Maekawa are proved and generalizations are made to folding vertices on cone-shaped (i.e., non-developable) paper.The problem of counting valid mountain-valley assignments of flat-foldable vertices is solved, and the configuration space of flat-foldable vertices of a fixed degree is characterized.A matrix model for formalizing flat-vertex folds is introduced, and the chapter ends with historical notes on this topic.
In this expository article we give an overview of recent developments in the study of optimal Hardy-type inequalityin the continuum and in the discrete setting. In particular, we present the technique of the {\emph supersolution construction} that yield “as large as possibleȍ Hardy weightswhich is made precise in terms ofthe notion of criticality. Instead of presenting the most general setting possible, we restrict ourselves to the case of the Laplacian on smooth manifolds and bounded combinatorial graphs. Although the results hold in far greater generality, the fundamental phenomena as well as the core ideas of the proofs become especially clear in these basic settings.
The interplay of geometry, spectral theory and stochastics has a long and fruitful history, and is the driving force behind many developments in modern mathematics. Bringing together contributions from a 2017 conference at the University of Potsdam, this volume focuses on global effects of local properties. Exploring the similarities and differences between the discrete and the continuous settings is of great interest to both researchers and graduate students in geometric analysis. The range of survey articles presented in this volume give an expository overview of various topics, including curvature, the effects of geometry on the spectrum, geometric group theory, and spectral theory of Laplacian and Schrödinger operators. Also included are shorter articles focusing on specific techniques and problems, allowing the reader to get to the heart of several key topics.