Search

Discussion of "Network routing in a dynamic environment" by N.D. Singpurwalla [arXiv:1107.4852], Comment: Published in at http://dx.doi.org/10.1214/11-AOAS453A the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org)

In the game of Scrabble, letter tiles are drawn uniformly at random from a bag. The variability of possible draws as the game progresses is a source of variation that makes it more likely for an inferior player to win a head-to-head match against a superior player, and more difficult to determine the true ability of a player in a tournament or contest. I propose a new format for drawing tiles in a two-player game that allows for the same tile pattern (though not the same board) to be replicated over multiple matches, so that a player's result can be better compared against others, yet is indistinguishable from the bag-based draw within a game. A large number of simulations conducted with Scrabble software shows that the variance from the tile order in this scheme accounts for as much variance as the different patterns of letters on the board as the game progresses. I use these simulations as well as the experimental design to show how much various tiles are able to affect player scores depending on their placement in the tile seeding., Comment: 16 pages, 7 figures

Various methods have been proposed for creating a binary version of a complex network with valued ties. Rather than the default method of choosing a single threshold value about which to dichotomize, we consider a method of choosing the highest k outbound arcs from each person and assigning a binary tie, as this has the advantage of minimizing the isolation of nodes that may otherwise be weakly connected. However, simulations and real data sets establish that this method is worse than the default thresholding method and should not be generally considered to deal with valued networks., Comment: 15 pages, 5 figures

In order to conduct analyses of networked systems where connections between individuals take on a range of values - counts, continuous strengths or ordinal rankings - a common technique is to dichotomize the data according to their positions with respect to a threshold value. However, there are two issues to consider: how the results of the analysis depend on the choice of threshold, and what role the presence of noise has on a system with respect to a fixed threshold value. We show that while there are principled criteria of keeping information from the valued graph in the dichotomized version, they produce such a wide range of binary graphs that only a fraction of the relevant information will be kept. Additionally, while dichotomization of predictors in linear models has a known asymptotic efficiency loss, the same process applied to network edges in a time series model will lead to an efficiency loss that grows larger as the network increases in size., Comment: 36 pages, 15 figures

The deployment of improvised explosive devices (IEDs) along major roadways has been a favoured strategy of insurgents in recent war zones, both for the ability to cause damage to targets along roadways at minimal cost, but also as a means of controlling the flow of traffic and causing additional expense to opposing forces. Among other related approaches (which we discuss), the adversarial problem has an analogue in the Canadian Traveller Problem, wherein a stretch of road is blocked with some independent probability, and the state of the road is only discovered once the traveller reaches one of the intersections that bound this stretch of road. We discuss the implementation of ideas from social network analysis, namely the notion of "betweenness centrality", and how this can be adapted to the notion of deployment of IEDs with the aid of Generalized Linear Models (GLMs): namely, how we can model the probability of an IED deployment in terms of the increased effort due to Canadian betweenness, how we can include expert judgement on the probability of a deployment, and how we can extend the approach to estimation and updating over several time steps., Comment: 25 pages, 3 figures

I examine the consequences of modelling contagious influence in a social network with incomplete edge information, namely in the situation where each individual may name a limited number of friends, so that extra outbound ties are censored. In particular, I consider a prototypical time series configuration where a property of the "ego" is affected in a causal fashion by the properties of their "alters" at a previous time point, both in the total number of alters as well as the deviation from a central value. This is considered with three potential methods for naming one's friends: a strict upper limit on the number of declarations, a flexible limit, and an instruction where a person names a prespecified fraction of their friends. I find that one of two effects is present in the estimation of these effects: either that the size of the effect is inflated in magnitude, or that the estimators instead are centered about zero rather than related to the true effect. The degree of heterogeneity in friend count is one of the major factors into whether such an analysis can be salvaged by post-hoc adjustments., Comment: 22 pages, 8 figures

We consider processes on social networks that can potentially involve three factors: homophily, or the formation of social ties due to matching individual traits; social contagion, also known as social influence; and the causal effect of an individual's covariates on their behavior or other measurable responses. We show that, generically, all of these are confounded with each other. Distinguishing them from one another requires strong assumptions on the parametrization of the social process or on the adequacy of the covariates used (or both). In particular we demonstrate, with simple examples, that asymmetries in regression coefficients cannot identify causal effects, and that very simple models of imitation (a form of social contagion) can produce substantial correlations between an individual's enduring traits and their choices, even when there is no intrinsic affinity between them. We also suggest some possible constructive responses to these results., Comment: 27 pages, 9 figures. V2: Revised in response to referees. V3: Ditto

The goals of this project were to acquire, process, QC, archive and analyze SeaWiFS chlorophyll fields over the Gulf of Maine and Scotia Shelf region. The focus of the analysis effort was to calculate and quantify seasonality and interannual. variability of SeaWiFS-measured phytoplankton biomass in the study area and compare these to physical forcing and hydrography. An additional focus within this effort was on regional differences within the heterogeneous biophysical regions of the Gulf of Maine / Scotia Shelf. Overall goals were approached through the combined use of SeaWiFS and AVHRR data and the development of a coupled biology-physical numerical model.

The large-scale patterns of satellite-derived surface pigment concentration off the west coast of North America are presented and are averaged into monthly mean surface wind fields over the California Current system (CCS) for the July 1979 to June 1986 period. The patterns are discussed in terms of both seasonal and nonseasonal variability for the indicated time period. The large-scale seasonal characteristics of the California Current are summarized. The data and methods used are described, and the problems known to affect the satellite-derived pigment concentrations and the wind data used in the study are discussed. The statistical analysis results are then presented and discussed in light of past observations and theory. Details of the CZCS data processing are described, and details of the principal estimator pattern methodology used here are given.