Recrafting in/formality, leveraging public market trade in Baguio, Philippines

With growing urbanization, Southern governments often privilege large-scale developments that frustrate urbanites’ livelihood needs. In Baguio, Philippines public marketers counter such top-down disenfranchisement by operationalizing formal “advocacy” and informal “everyday” politics. That authorities negotiate agreements to accept payments for marketers’ infractions, I argue, materializes complex and complicit intersections of formal/informal and legal/illegal practices.With growing urbanization, Southern governments often privilege large-scale developments that frustrate urbanites’ livelihood needs. In Baguio, Philippines public marketers counter such top-down disenfranchisement by operationalizing formal “advocacy” and informal “everyday” politics. That authorities negotiate agreements to accept payments for marketers’ infractions, I argue, materializes complex and complicit intersections of formal/informal and legal/illegal practices

This is Research; Milgram: Activating Alternatives for a Sustainable Trade: Social Entrepreneurship and Coffee Production in the Upland Northern Philippines

This project explores the channels through which Philippine social entrepreneurs in upland northern Luzon develop new specialty Arabica coffee enterprises that follow a socially responsible and environmentally sustainable model of production and distribution. The project analyzes the opportunities and constraints entrepreneurs and producers face as they scale-up from their small start-up premises to yield an industry for, and more responsive to, producers’ and consumers’ needs

Quantum computing of delocalization in small-world networks

We study a quantum small-world network with disorder and show that the system exhibits a delocalization transition. A quantum algorithm is built up which simulates the evolution operator of the model in a polynomial number of gates for exponential number of vertices in the network. The total computational gain is shown to depend on the parameters of the network and a larger than quadratic speed-up can be reached. We also investigate the robustness of the algorithm in presence of imperfections.Comment: 4 pages, 5 figures, research done at http://www.quantware.ups-tlse.fr

Mining Missing Hyperlinks from Human Navigation Traces: A Case Study of Wikipedia

Hyperlinks are an essential feature of the World Wide Web. They are especially important for online encyclopedias such as Wikipedia: an article can often only be understood in the context of related articles, and hyperlinks make it easy to explore this context. But important links are often missing, and several methods have been proposed to alleviate this problem by learning a linking model based on the structure of the existing links. Here we propose a novel approach to identifying missing links in Wikipedia. We build on the fact that the ultimate purpose of Wikipedia links is to aid navigation. Rather than merely suggesting new links that are in tune with the structure of existing links, our method finds missing links that would immediately enhance Wikipedia's navigability. We leverage data sets of navigation paths collected through a Wikipedia-based human-computation game in which users must find a short path from a start to a target article by only clicking links encountered along the way. We harness human navigational traces to identify a set of candidates for missing links and then rank these candidates. Experiments show that our procedure identifies missing links of high quality

Link Prediction with Social Vector Clocks

State-of-the-art link prediction utilizes combinations of complex features derived from network panel data. We here show that computationally less expensive features can achieve the same performance in the common scenario in which the data is available as a sequence of interactions. Our features are based on social vector clocks, an adaptation of the vector-clock concept introduced in distributed computing to social interaction networks. In fact, our experiments suggest that by taking into account the order and spacing of interactions, social vector clocks exploit different aspects of link formation so that their combination with previous approaches yields the most accurate predictor to date.Comment: 9 pages, 6 figure

Weighted network modules

The inclusion of link weights into the analysis of network properties allows a deeper insight into the (often overlapping) modular structure of real-world webs. We introduce a clustering algorithm (CPMw, Clique Percolation Method with weights) for weighted networks based on the concept of percolating k-cliques with high enough intensity. The algorithm allows overlaps between the modules. First, we give detailed analytical and numerical results about the critical point of weighted k-clique percolation on (weighted) Erdos-Renyi graphs. Then, for a scientist collaboration web and a stock correlation graph we compute three-link weight correlations and with the CPMw the weighted modules. After reshuffling link weights in both networks and computing the same quantities for the randomised control graphs as well, we show that groups of 3 or more strong links prefer to cluster together in both original graphs.Comment: 19 pages, 7 figure

Statistical Analysis of Airport Network of China

Through the study of airport network of China (ANC), composed of 128 airports (nodes) and 1165 flights (edges), we show the topological structure of ANC conveys two characteristics of small worlds, a short average path length (2.067) and a high degree of clustering (0.733). The cumulative degree distributions of both directed and undirected ANC obey two-regime power laws with different exponents, i.e., the so-called Double Pareto Law. In-degrees and out-degrees of each airport have positive correlations, whereas the undirected degrees of adjacent airports have significant linear anticorrelations. It is demonstrated both weekly and daily cumulative distributions of flight weights (frequencies) of ANC have power-law tails. Besides, the weight of any given flight is proportional to the degrees of both airports at the two ends of that flight. It is also shown the diameter of each sub-cluster (consisting of an airport and all those airports to which it is linked) is inversely proportional to its density of connectivity. Efficiency of ANC and of its sub-clusters are measured through a simple definition. In terms of that, the efficiency of ANC's sub-clusters increases as the density of connectivity does. ANC is found to have an efficiency of 0.484.Comment: 6 Pages, 5 figure

Exact results and scaling properties of small-world networks

We study the distribution function for minimal paths in small-world networks. Using properties of this distribution function, we derive analytic results which greatly simplify the numerical calculation of the average minimal distance, $\bar{\ell}$, and its variance, $\sigma^2$. We also discuss the scaling properties of the distribution function. Finally, we study the limit of large system sizes and obtain some analytic results.Comment: RevTeX, 4 pages, 5 figures included. Minor corrections and addition