Road traffic injuries to children during the school commute in Hyderabad, India: cross-sectional survey.

BACKGROUND: India is motorising rapidly. With increasing motorisation, road traffic injuries are predicted to increase. A third of a billion children travel to school every day in India, but little is known about children's safety during the school commute. We investigated road traffic injury to children during school journeys. METHODS: We conducted a cross-sectional survey in Hyderabad using a two-stage stratified cluster sampling design. We used school travel questionnaires to record any road injury in the past 12 months that resulted in at least 1 day of school missed or required treatment by a doctor or nurse. We estimated the prevalence of road injury by usual mode of travel and distance to school. RESULTS: The total sample was 5842 children, of whom 5789 (99.1%) children answered the question on road injury. The overall prevalence of self-reported road injury in the last 12 months during school journeys was 17% (95% CI 12.9% to 21.7%). A higher proportion of boys (25%) reported a road injury than girls (11%). There was a strong association between road injury, travel mode and distance to school. Children who cycled to school were more likely to be injured compared with children who walked (OR 1.5; 95% CI 1.2 to 2.0). Travel by school bus was safer than walking (OR 0.5; 95% CI 0.3 to 0.9). CONCLUSIONS: A sixth of the children reported a road traffic injury in the past 12 months during school journeys in Hyderabad. Injury prevention interventions should focus on making walking and cycling safer for children

Fermions and Loops on Graphs. II. Monomer-Dimer Model as Series of Determinants

We continue the discussion of the fermion models on graphs that started in the first paper of the series. Here we introduce a Graphical Gauge Model (GGM) and show that : (a) it can be stated as an average/sum of a determinant defined on the graph over $\mathbb{Z}_{2}$ (binary) gauge field; (b) it is equivalent to the Monomer-Dimer (MD) model on the graph; (c) the partition function of the model allows an explicit expression in terms of a series over disjoint directed cycles, where each term is a product of local contributions along the cycle and the determinant of a matrix defined on the remainder of the graph (excluding the cycle). We also establish a relation between the MD model on the graph and the determinant series, discussed in the first paper, however, considered using simple non-Belief-Propagation choice of the gauge. We conclude with a discussion of possible analytic and algorithmic consequences of these results, as well as related questions and challenges.Comment: 11 pages, 2 figures; misprints correcte

Transport Properties of Random Walks on Scale-Free/Regular-Lattice Hybrid Networks

We study numerically the mean access times for random walks on hybrid disordered structures formed by embedding scale-free networks into regular lattices, considering different transition rates for steps across lattice bonds ($F$) and across network shortcuts ($f$). For fast shortcuts ($f/F\gg 1$) and low shortcut densities, traversal time data collapse onto an universal curve, while a crossover behavior that can be related to the percolation threshold of the scale-free network component is identified at higher shortcut densities, in analogy to similar observations reported recently in Newman-Watts small-world networks. Furthermore, we observe that random walk traversal times are larger for networks with a higher degree of inhomogeneity in their shortcut distribution, and we discuss access time distributions as functions of the initial and final node degrees. These findings are relevant, in particular, when considering the optimization of existing information networks by the addition of a small number of fast shortcut connections.Comment: 8 pages, 6 figures; expanded discussions, added figures and references. To appear in J Stat Phy

Distributed flow optimization and cascading effects in weighted complex networks

We investigate the effect of a specific edge weighting scheme $\sim (k_i k_j)^{\beta}$ on distributed flow efficiency and robustness to cascading failures in scale-free networks. In particular, we analyze a simple, yet fundamental distributed flow model: current flow in random resistor networks. By the tuning of control parameter $\beta$ and by considering two general cases of relative node processing capabilities as well as the effect of bandwidth, we show the dependence of transport efficiency upon the correlations between the topology and weights. By studying the severity of cascades for different control parameter $\beta$, we find that network resilience to cascading overloads and network throughput is optimal for the same value of $\beta$ over the range of node capacities and available bandwidth

On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms

We introduce a version of the cavity method for diluted mean-field spin models that allows the computation of thermodynamic quantities similar to the Franz-Parisi quenched potential in sparse random graph models. This method is developed in the particular case of partially decimated random constraint satisfaction problems. This allows to develop a theoretical understanding of a class of algorithms for solving constraint satisfaction problems, in which elementary degrees of freedom are sequentially assigned according to the results of a message passing procedure (belief-propagation). We confront this theoretical analysis to the results of extensive numerical simulations.Comment: 32 pages, 24 figure

Efficient Distributed Random Walks with Applications

We focus on the problem of performing random walks efficiently in adistributed network. Given bandwidth constraints, the goal is to minimize thenumber of rounds required to obtain a random walk sample. We first present afast sublinear time distributed algorithm for performing random walks whosetime complexity is sublinear in the length of the walk. Our algorithm performsa random walk of length $\ell$ in $\tilde{O}(\sqrt{\ell D})$ rounds (with highprobability) on an undirected network, where $D$ is the diameter of thenetwork. This improves over the previous best algorithm that ran in$\tilde{O}(\ell^{2/3}D^{1/3})$ rounds (Das Sarma et al., PODC 2009). We furtherextend our algorithms to efficiently perform $k$ independent random walks in$\tilde{O}(\sqrt{k\ell D} + k)$ rounds. We then show that there is afundamental difficulty in improving the dependence on $\ell$ any further byproving a lower bound of $\Omega(\sqrt{\frac{\ell}{\log \ell}} + D)$ under ageneral model of distributed random walk algorithms. Our random walk algorithmsare useful in speeding up distributed algorithms for a variety of applicationsthat use random walks as a subroutine. We present two main applications. First,we give a fast distributed algorithm for computing a random spanning tree (RST)in an arbitrary (undirected) network which runs in $\tilde{O}(\sqrt{m}D)$rounds (with high probability; here $m$ is the number of edges). Our secondapplication is a fast decentralized algorithm for estimating mixing time andrelated parameters of the underlying network. Our algorithm is fullydecentralized and can serve as a building block in the design oftopologically-aware networks.<br

Scaling of mean first-passage time as efficiency measure of nodes sending information on scale-free Koch networks

A lot of previous work showed that the sectional mean first-passage time (SMFPT), i.e., the average of mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) averaged over all starting points in scale-free small-world networks exhibits a sublinear or linear dependence on network order $N$ (number of nodes), which indicates that hub nodes are very efficient in receiving information if one looks upon the random walker as an information messenger. Thus far, the efficiency of a hub node sending information on scale-free small-world networks has not been addressed yet. In this paper, we study random walks on the class of Koch networks with scale-free behavior and small-world effect. We derive some basic properties for random walks on the Koch network family, based on which we calculate analytically the partial mean first-passage time (PMFPT) defined as the average of MFPTs from a hub node to all other nodes, excluding the hub itself. The obtained closed-form expression displays that in large networks the PMFPT grows with network order as $N \ln N$, which is larger than the linear scaling of SMFPT to the hub from other nodes. On the other hand, we also address the case with the information sender distributed uniformly among the Koch networks, and derive analytically the entire mean first-passage time (EMFPT), namely, the average of MFPTs between all couples of nodes, the leading scaling of which is identical to that of PMFPT. From the obtained results, we present that although hub nodes are more efficient for receiving information than other nodes, they display a qualitatively similar speed for sending information as non-hub nodes. Moreover, we show that the location of information sender has little effect on the transmission efficiency. The present findings are helpful for better understanding random walks performed on scale-free small-world networks.Comment: Definitive version published in European Physical Journal

Ecology of ficus religiosa accounts for its association with religion

While many plants and trees in specific areas acquire cult significance, very few such as Ficus religiosa L. have acquired a universal status. This hemiepiphyte, Ficus religiosa L., is of dual interest since it venerated by a quarter of the present mankind (Hindus and Buddhists, largely Asian) on one hand and also since these plants are blamed for destruction of buildings due to their ability to grow on buildings. Divergence in views exists whether epiphytic plants exert a destructive influence on buildings. A focused survey of the coastal forts on land and sea has shown uniformly that the naturally growing plants of certain Ficus sp., notably Ficus religiosa L., grow exclusively on the vertical sheer side of rock faces and not either on the ground or on the top surface of these 8-10 centuries old rock structures; also seen on the side of rock piles as recent as 4-5 years as well as in sacred groves of several centuries to millennia old. We could trace the roots through these structures from beginning to the end in many parts of these forts, especially when there are overhanging structures at entrances. The root tips, the point of growth, would be far too insignificant to account for destruction in any of these large rock-and-lime masonry structures while vibration per se was insignificant as the tree was seen in all forts on land or sea. The association with religion of the distinctive Ficus religiosa itself appears to be self-evident from its socio-anthropological association with rock piles, hitherto not visualized for any flora and logically appears to pre-date both Hinduism and Buddhism

Improved approximations for min sum vertex cover and generalized min sum set cover

We study the generalized min sum set cover (GMSSC) problem, wherein given a collection of hyperedges E with arbitrary covering requirements {ke ∈ Z+ : e ∈ E}, the goal is to find an ordering of the vertices to minimize the total cover time of the hyperedges; a hyperedge e is considered covered by the first time when ke many of its vertices appear in the ordering. We give a 4.642 approximation algorithm for GMSSC, coming close to the best possible bound of 4, already for the classical special case (with all ke = 1) of min sum set cover (MSSC) studied by Feige, Lovász and Tetali [11], and improving upon the previous best known bound of 12.4 due to Im, Sviridenko and van der Zwaan [20]. Our algorithm is based on transforming the LP solution by a suitable kernel and applying randomized rounding. This also gives an LP-based 4 approximation for MSSC. As part of the analysis of our algorithm, we also derive an inequality on the lower tail of a sum of independent Bernoulli random variables, which might be of independent interest and broader utility. Another well-known special case is the min sum vertex cover (MSVC) problem, in which the input hypergraph is a graph (i.e., |e| = 2) and ke = 1, for every edge e ∈ E. We give a 16/9 ' 1.778 approximation for MSVC, and show a matching integrality gap for the natural LP relaxation. This improves upon the previous best 1.999946 approximation of Barenholz, Feige and Peleg [6]. (The claimed 1.79 approximation result of Iwata, Tetali and Tripathi [21] for the MSVC turned out have an unfortunate, seemingly unfixable, mistake in it.) Finally, we revisit MSSC and consider the lp norm of cover-time of the hyperedges. Using a dual fitting argument, we show that the natural greedy algorithm simultaneously achieves approximation guarantees of (p + 1)1+1/p, for all p ≥ 1, giving another proof of the result of Golovin, Gupta, Kumar and Tangwongsan [13], and showing its tightness up to NP-hardness. For p = 1, this gives yet another proof of the 4 approximation for MSSC