MARKET FAILURE IN MULTIPHASE ELECTRIC POWER DEVELOPMENT FOR AGRICULTURAL IRRIGATION

The adoption of multiphase electric power for electric irrigation has been limited in an area characterized by extremely rapid expansion of irrigated acreage despite production cost advantages. Theoretical and empirical evidence of failure in the existing market for multiphase power development are presented. Alternative development mechanisms are presented and discussed.Resource /Energy Economics and Policy,

Modeling Dynamics of Information Networks

We propose an information-based model for network dynamics in which imperfect information leads to networks where the different vertices have widely different number of edges to other vertices, and where the topology has hierarchical features. The possibility to observe scale free networks is linked to a minimally connected system where hubs remain dynamic.Comment: 4 pages, 5 figures; changed content and new fig

Random Unitaries Give Quantum Expanders

We show that randomly choosing the matrices in a completely positive map from the unitary group gives a quantum expander. We consider Hermitian and non-Hermitian cases, and we provide asymptotically tight bounds in the Hermitian case on the typical value of the second largest eigenvalue. The key idea is the use of Schwinger-Dyson equations from lattice gauge theory to efficiently compute averages over the unitary group.Comment: 14 pages, 1 figur

Interval Selection in the Streaming Model

A set of intervals is independent when the intervals are pairwise disjoint. In the interval selection problem we are given a set $\mathbb{I}$ of intervals and we want to find an independent subset of intervals of largest cardinality. Let $\alpha(\mathbb{I})$ denote the cardinality of an optimal solution. We discuss the estimation of $\alpha(\mathbb{I})$ in the streaming model, where we only have one-time, sequential access to the input intervals, the endpoints of the intervals lie in $\{1,...,n \}$, and the amount of the memory is constrained. For intervals of different sizes, we provide an algorithm in the data stream model that computes an estimate $\hat\alpha$ of $\alpha(\mathbb{I})$ that, with probability at least $2/3$, satisfies $\tfrac 12(1-\varepsilon) \alpha(\mathbb{I}) \le \hat\alpha \le \alpha(\mathbb{I})$. For same-length intervals, we provide another algorithm in the data stream model that computes an estimate $\hat\alpha$ of $\alpha(\mathbb{I})$ that, with probability at least $2/3$, satisfies $\tfrac 23(1-\varepsilon) \alpha(\mathbb{I}) \le \hat\alpha \le \alpha(\mathbb{I})$. The space used by our algorithms is bounded by a polynomial in $\varepsilon^{-1}$ and $\log n$. We also show that no better estimations can be achieved using $o(n)$ bits of storage. We also develop new, approximate solutions to the interval selection problem, where we want to report a feasible solution, that use $O(\alpha(\mathbb{I}))$ space. Our algorithms for the interval selection problem match the optimal results by Emek, Halld{\'o}rsson and Ros{\'e}n [Space-Constrained Interval Selection, ICALP 2012], but are much simpler.Comment: Minor correction

Viral antibody dynamics in a chiropteran host

1. Bats host many viruses that are significant for human and domestic animal health, but the dynamics of these infections in their natural reservoir hosts remain poorly elucidated.<p></p> 2. In these, and other, systems, there is evidence that seasonal life-cycle events drive infection dynamics, directly impacting the risk of exposure to spillover hosts. Understanding these dynamics improves our ability to predict zoonotic spillover from the reservoir hosts.<p></p> 3. To this end, we followed henipavirus antibody levels of >100 individual E. helvum in a closed, captive, breeding population over a 30-month period, using a powerful novel antibody quantitation method.<p></p> 4. We demonstrate the presence of maternal antibodies in this system and accurately determine their longevity. We also present evidence of population-level persistence of viral infection and demonstrate periods of increased horizontal virus transmission associated with the pregnancy/lactation period.<p></p> 5.The novel findings of infection persistence and the effect of pregnancy on viral transmission, as well as an accurate quantitation of chiropteran maternal antiviral antibody half-life, provide fundamental baseline data for the continued study of viral infections in these important reservoir hosts

Clustering and preferential attachment in growing networks

We study empirically the time evolution of scientific collaboration networks in physics and biology. In these networks, two scientists are considered connected if they have coauthored one or more papers together. We show that the probability of scientists collaborating increases with the number of other collaborators they have in common, and that the probability of a particular scientist acquiring new collaborators increases with the number of his or her past collaborators. These results provide experimental evidence in favor of previously conjectured mechanisms for clustering and power-law degree distributions in networks.Comment: 13 pages, 2 figure

Network robustness and fragility: Percolation on random graphs

Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or power transmission lines. Percolation models on random graphs provide a simple representation of this process, but have typically been limited to graphs with Poisson degree distribution at their vertices. Such graphs are quite unlike real world networks, which often possess power-law or other highly skewed degree distributions. In this paper we study percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolation, bond percolation, and models in which occupation probabilities depend on vertex degree. We discuss the application of our theory to the understanding of network resilience.Comment: 4 pages, 2 figure

Complexity transitions in global algorithms for sparse linear systems over finite fields

We study the computational complexity of a very basic problem, namely that of finding solutions to a very large set of random linear equations in a finite Galois Field modulo q. Using tools from statistical mechanics we are able to identify phase transitions in the structure of the solution space and to connect them to changes in performance of a global algorithm, namely Gaussian elimination. Crossing phase boundaries produces a dramatic increase in memory and CPU requirements necessary to the algorithms. In turn, this causes the saturation of the upper bounds for the running time. We illustrate the results on the specific problem of integer factorization, which is of central interest for deciphering messages encrypted with the RSA cryptosystem.Comment: 23 pages, 8 figure

You can't see what you can't see: Experimental evidence for how much relevant information may be missed due to Google's Web search personalisation

The influence of Web search personalisation on professional knowledge work is an understudied area. Here we investigate how public sector officials self-assess their dependency on the Google Web search engine, whether they are aware of the potential impact of algorithmic biases on their ability to retrieve all relevant information, and how much relevant information may actually be missed due to Web search personalisation. We find that the majority of participants in our experimental study are neither aware that there is a potential problem nor do they have a strategy to mitigate the risk of missing relevant information when performing online searches. Most significantly, we provide empirical evidence that up to 20% of relevant information may be missed due to Web search personalisation. This work has significant implications for Web research by public sector professionals, who should be provided with training about the potential algorithmic biases that may affect their judgments and decision making, as well as clear guidelines how to minimise the risk of missing relevant information.Comment: paper submitted to the 11th Intl. Conf. on Social Informatics; revision corrects error in interpretation of parameter Psi/p in RBO resulting from discrepancy between the documentation of the implementation in R (https://rdrr.io/bioc/gespeR/man/rbo.html) and the original definition (https://dl.acm.org/citation.cfm?id=1852106) as per 20/05/201

Minimum spanning trees on random networks

We show that the geometry of minimum spanning trees (MST) on random graphs is universal. Due to this geometric universality, we are able to characterise the energy of MST using a scaling distribution ($P(\epsilon)$) found using uniform disorder. We show that the MST energy for other disorder distributions is simply related to $P(\epsilon)$. We discuss the relationship to invasion percolation (IP), to the directed polymer in a random media (DPRM) and the implications for the broader issue of universality in disordered systems.Comment: 4 pages, 3 figure