Colour-Singlet Exchange in ep Interactions

Results presented at the DIS97 workshop by the H1, ZEUS and E665 collaborations on processes yielding large rapidity gaps and energetic leading baryons are reviewed. A consistent picture begins to emerge in which diffractive processes dominate when the fractional longitudinal momentum loss at the baryon vertex \xpom is small, with substantial contributions from other processes as \xpom increases. The diffractive mechanism in the deep-inelastic regime is found, both from inclusive measurements and final state studies, to involve the exchange of a gluon carrying a large fraction of the exchange momentum. Vector meson results show the transition from soft to hard production mechanisms with increasing precision.Comment: 18 pages, 8 figures, LATEX, aipproc.sty. Summary talk from the diffractive sessions of the DIS97 workshop, Chicag

Input description for Jameson's three-dimensional transonic airfoil analysis program

The input parameters are presented for a computer program which performs calculations for inviscid isentropic transonic flow over three dimensional airfoils with straight leading edges. The free stream Mach number is restricted only by the isentropic assumption. Weak shock waves are automatically located where they occur in the flow. The finite difference form of the full equation for the velocity potential is solved by the method of relaxation, after the flow exterior to the airfoil is mapped to the upper half plane

Generating Robust and Efficient Networks Under Targeted Attacks

Much of our commerce and traveling depend on the efficient operation of large scale networks. Some of those, such as electric power grids, transportation systems, communication networks, and others, must maintain their efficiency even after several failures, or malicious attacks. We outline a procedure that modifies any given network to enhance its robustness, defined as the size of its largest connected component after a succession of attacks, whilst keeping a high efficiency, described in terms of the shortest paths among nodes. We also show that this generated set of networks is very similar to networks optimized for robustness in several aspects such as high assortativity and the presence of an onion-like structure

MonALISA : A Distributed Monitoring Service Architecture

The MonALISA (Monitoring Agents in A Large Integrated Services Architecture) system provides a distributed monitoring service. MonALISA is based on a scalable Dynamic Distributed Services Architecture which is designed to meet the needs of physics collaborations for monitoring global Grid systems, and is implemented using JINI/JAVA and WSDL/SOAP technologies. The scalability of the system derives from the use of multithreaded Station Servers to host a variety of loosely coupled self-describing dynamic services, the ability of each service to register itself and then to be discovered and used by any other services, or clients that require such information, and the ability of all services and clients subscribing to a set of events (state changes) in the system to be notified automatically. The framework integrates several existing monitoring tools and procedures to collect parameters describing computational nodes, applications and network performance. It has built-in SNMP support and network-performance monitoring algorithms that enable it to monitor end-to-end network performance as well as the performance and state of site facilities in a Grid. MonALISA is currently running around the clock on the US CMS test Grid as well as an increasing number of other sites. It is also being used to monitor the performance and optimize the interconnections among the reflectors in the VRVS system.Comment: Talk from the 2003 Computing in High Energy and Nuclear Physics (CHEP03), La Jolla, Ca, USA, March 2003, 8 pages, pdf. PSN MOET00

Signatures of currency vertices

Many real-world networks have broad degree distributions. For some systems, this means that the functional significance of the vertices is also broadly distributed, in other cases the vertices are equally significant, but in different ways. One example of the latter case is metabolic networks, where the high-degree vertices -- the currency metabolites -- supply the molecular groups to the low-degree metabolites, and the latter are responsible for the higher-order biological function, of vital importance to the organism. In this paper, we propose a generalization of currency metabolites to currency vertices. We investigate the network structural characteristics of such systems, both in model networks and in some empirical systems. In addition to metabolic networks, we find that a network of music collaborations and a network of e-mail exchange could be described by a division of the vertices into currency vertices and others.Comment: to appear in Journal of the Physical Society of Japa

Wang-Landau Algorithm: a Theoretical Analysis of the Saturation of the Error

In this work we present a theoretical analysis of the convergence of the Wang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)] which was introduced years ago to calculate the density of states in statistical models. We study the dynamical behavior of the error in the calculation of the density of states.We conclude that the source of the saturation of the error is due to the decreasing variations of the refinement parameter. To overcome this limitation, we present an analytical treatment in which the refinement parameter is scaled down as a power law instead of exponentially. An extension of the analysis to the N-fold way variation of the method is also discussed.Comment: 7 pages, 5 figure

Limit curve theorems in Lorentzian geometry

The subject of limit curve theorems in Lorentzian geometry is reviewed. A general limit curve theorem is formulated which includes the case of converging curves with endpoints and the case in which the limit points assigned since the beginning are one, two or at most denumerable. Some applications are considered. It is proved that in chronological spacetimes, strong causality is either everywhere verified or everywhere violated on maximizing lightlike segments with open domain. As a consequence, if in a chronological spacetime two distinct lightlike lines intersect each other then strong causality holds at their points. Finally, it is proved that two distinct components of the chronology violating set have disjoint closures or there is a lightlike line passing through each point of the intersection of the corresponding boundaries.Comment: 25 pages, 1 figure. v2: Misprints fixed, matches published versio

Relaxation dynamics of maximally clustered networks

We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics---the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erd\H{o}s--R\'enyi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erd\H{o}s--R\'enyi phenomenology

Graph Metrics for Temporal Networks

Temporal networks, i.e., networks in which the interactions among a set of elementary units change over time, can be modelled in terms of time-varying graphs, which are time-ordered sequences of graphs over a set of nodes. In such graphs, the concepts of node adjacency and reachability crucially depend on the exact temporal ordering of the links. Consequently, all the concepts and metrics proposed and used for the characterisation of static complex networks have to be redefined or appropriately extended to time-varying graphs, in order to take into account the effects of time ordering on causality. In this chapter we discuss how to represent temporal networks and we review the definitions of walks, paths, connectedness and connected components valid for graphs in which the links fluctuate over time. We then focus on temporal node-node distance, and we discuss how to characterise link persistence and the temporal small-world behaviour in this class of networks. Finally, we discuss the extension of classic centrality measures, including closeness, betweenness and spectral centrality, to the case of time-varying graphs, and we review the work on temporal motifs analysis and the definition of modularity for temporal graphs.Comment: 26 pages, 5 figures, Chapter in Temporal Networks (Petter Holme and Jari Saram\"aki editors). Springer. Berlin, Heidelberg 201