Maps of random walks on complex networks reveal community structure

To comprehend the multipartite organization of large-scale biological and social systems, we introduce a new information theoretic approach that reveals community structure in weighted and directed networks. The method decomposes a network into modules by optimally compressing a description of information flows on the network. The result is a map that both simplifies and highlights the regularities in the structure and their relationships. We illustrate the method by making a map of scientific communication as captured in the citation patterns of more than 6000 journals. We discover a multicentric organization with fields that vary dramatically in size and degree of integration into the network of science. Along the backbone of the network -- including physics, chemistry, molecular biology, and medicine -- information flows bidirectionally, but the map reveals a directional pattern of citation from the applied fields to the basic sciences.Comment: 7 pages and 4 figures plus supporting material. For associated source code, see http://www.tp.umu.se/~rosvall

The Effect of Lane Changing on Long-Span Highway Bridge Traffic Loading

Maximum loading on long-span bridges typically occurs in congested traffic conditions. As traffic becomes congested car drivers may change lane, increasing the tendency for trucks to travel in platoons. For long-span bridges this phenomenon may increase the regularity and severity of bridge repair programs, with potential significant associated costs. This research investigates the effect of lane changing by car drivers on bridge loading. A Monte Carlo simulation model in which individual car drivers probabilistically decide, based on a lane-changing bias probability, whether or not to change lane has been developed. The sensitivity of bridge loading to this factor is investigated for different bridge lengths and traffic compositions. This research concludes that the lane-changing behavior of car drivers has an effect on bridge loading for long-span bridges, and the magnitude of this effect is quite sensitive to the percentage of trucks in the traffic

A New Congested Traffic Load Model for Highway Bridges

Long span highway bridges are critical components of any nation’s infrastructure. Therefore accurate assessment of highway bridge loading is essential, and it is well known that congested traffic governs load effect for such bridges. Current congestion models use conservative assumptions about traffic and inter-vehicle gaps. This research investigates congested traffic flow through the use of traffic microsimulation which has the ability to reproduce complex traffic phenomena based on driver interactions. A time series model has been developed to produce a speed time-series similar to the results of the microsimulation. The speed time-series from the new model, combined with the established speed-gap relationship from the microsimulation, form the basis of a more computationally efficient congested traffic model. It is shown that the new model replicates aspects of microsimulation traffic well. However, the resulting load effects do not match as well as expected, and so further development of the model is required

Lane Changing Control to Reduce Traffic Load Effect on Long-Span Bridges

Long span bridges are critical parts of a nation’s infrastructure network and congested traffic loading is the governing form of traffic loading. Groups of trucks travelling in conveys are created when fast-er moving vehicles, such as cars, change lane. In this research the authors investigate how the control of these lane-changing events can help reduce the traffic load effects on long span bridges. Real traffic data is used to simulate a traffic stream on a virtual road and bridge using a microsimulation model. Various lane-changing restrictions are examined and compared to the typical case of free lane changing. It is shown that restriction of lane changing is an effective means of reducing long-span bridge traffic load effect. This result may assist bridge owners in implementing measures to prolong the life of existing infrastructure

Study of Same-lane and Inter-lane GVW Correlation

Extensive work has been done over the last two decades on the simulation of traffic loading on bridges. The methodology used is to generate a number of years of simulated traffic and to use extreme value statistics to predict more accurately the characteristic loading for a given bridge. The parameters and probability distributions used in the Monte Carlo simulation must be based on observed sample traffic data. Some previous studies have made unsubstantiated assumptions regarding correlation between the Gross Vehicle Weights (GVW) of trucks in the same lane, or between trucks in adjacent, same direction lanes. For this paper, an extensive database of Dutch Weigh-in-Motion data is analysed. Data are collected from two same-direction lanes and are time-stamped to the nearest 0.01 seconds. The statistical characteristics of this set of data are presentd, and various techniques are used to establish the nature and extend of GVW correlation

Lattice Kinetics of Diffusion-Limited Coalescence and Annihilation with Sources

We study the 1D kinetics of diffusion-limited coalescence and annihilation with back reactions and different kinds of particle input. By considering the changes in occupation and parity of a given interval, we derive sets of hierarchical equations from which exact expressions for the lattice coverage and the particle concentration can be obtained. We compare the mean-field approximation and the continuum approximation to the exact solutions and we discuss their regime of validity.Comment: 24 pages and 3 eps figures, Revtex, accepted for publication in J. Phys.

Restrictions of generalized Verma modules to symmetric pairs

We initiate a new line of investigation on branching problems for generalized Verma modules with respect to complex reductive symmetric pairs (g,k). Here we note that Verma modules of g may not contain any simple module when restricted to a reductive subalgebra k in general. In this article, using the geometry of K_C orbits on the generalized flag variety G_C/P_C, we give a necessary and sufficient condition on the triple (g,k, p) such that the restriction X|_k always contains simple k-modules for any g-module $X$ lying in the parabolic BGG category O^p attached to a parabolic subalgebra p of g. Formulas are derived for the Gelfand-Kirillov dimension of any simple k-module occurring in a simple generalized Verma module of g. We then prove that the restriction X|_k is multiplicity-free for any generic g-module X \in O if and only if (g,k) is isomorphic to a direct sum of (A_n,A_{n-1}), (B_n,D_n), or (D_{n+1},B_n). We also see that the restriction X|_k is multiplicity-free for any symmetric pair (g, k) and any parabolic subalgebra p with abelian nilradical and for any generic g-module X \in O^p. Explicit branching laws are also presented.Comment: 31 pages, To appear in Transformation Group

Visualisation of BioPAX Networks using BioLayout Express (3D).

BioLayout Express (3D) is a network analysis tool designed for the visualisation and analysis of graphs derived from biological data. It has proved to be powerful in the analysis of gene expression data, biological pathways and in a range of other applications. In version 3.2 of the tool we have introduced the ability to import, merge and display pathways and protein interaction networks available in the BioPAX Level 3 standard exchange format. A graphical interface allows users to search for pathways or interaction data stored in the Pathway Commons database. Queries using either gene/protein or pathway names are made via the cPath2 client and users can also define the source and/or species of information that they wish to examine. Data matching a query are listed and individual records may be viewed in isolation or merged using an 'Advanced' query tab. A visualisation scheme has been defined by mapping BioPAX entity types to a range of glyphs. Graphs of these data can be viewed and explored within BioLayout as 2D or 3D graph layouts, where they can be edited and/or exported for visualisation and editing within other tools

Defining forgiveness: Christian clergy and general population perspectives.

The lack of any consensual definition of forgiveness is a serious weakness in the research literature (McCullough, Pargament &amp; Thoresen, 2000). As forgiveness is at the core of Christianity, this study returns to the Christian source of the concept to explore the meaning of forgiveness for practicing Christian clergy. Comparisons are made with a general population sample and social science definitions of forgiveness to ensure that a shared meaning of forgiveness is articulated. Anglican and Roman Catholic clergy (N = 209) and a general population sample (N = 159) completed a postal questionnaire about forgiveness. There is agreement on the existence of individual differences in forgiveness. Clergy and the general population perceive reconciliation as necessary for forgiveness while there is no consensus within psychology. The clergy suggests that forgiveness is limitless and that repentance is unnecessary while the general population suggests that there are limits and that repentance is necessary. Psychological definitions do not conceptualize repentance as necessary for forgiveness and the question of limits has not been addressed although within therapy the implicit assumption is that forgiveness is limitless.</p