Long-Range Connections in Transportation Networks

Since its recent introduction, the small-world effect has been identified in several important real-world systems. Frequently, it is a consequence of the existence of a few long-range connections, which dominate the original regular structure of the systems and implies each node to become accessible from other nodes after a small number of steps, typically of order $\ell \propto \log N$. However, this effect has been observed in pure-topological networks, where the nodes have no spatial coordinates. In this paper, we present an alalogue of small-world effect observed in real-world transportation networks, where the nodes are embeded in a hree-dimensional space. Using the multidimensional scaling method, we demonstrate how the addition of a few long-range connections can suubstantially reduce the travel time in transportation systems. Also, we investigated the importance of long-range connections when the systems are under an attack process. Our findings are illustrated for two real-world systems, namely the London urban network (streets and underground) and the US highways network enhanced by some of the main US airlines routes

Sznajd Complex Networks

The Sznajd cellular automata corresponds to one of the simplest and yet most interesting models of complex systems. While the traditional two-dimensional Sznajd model tends to a consensus state (pro or cons), the assignment of the contrary to the dominant opinion to some of its cells during the system evolution is known to provide stabilizing feedback implying the overall system state to oscillate around null magnetization. The current article presents a novel type of geographic complex network model whose connections follow an associated feedbacked Sznajd model, i.e. the Sznajd dynamics is run over the network edges. Only connections not exceeding a maximum Euclidean distance $D$ are considered, and any two nodes within such a distance are randomly selected and, in case they are connected, all network nodes which are no further than $D$ are connected to them. In case they are not connected, all nodes within that distance are disconnected from them. Pairs of nodes are then randomly selected and assigned to the contrary of the dominant connectivity. The topology of the complex networks obtained by such a simple growth scheme, which are typically characterized by patches of connected communities, is analyzed both at global and individual levels in terms of a set of hierarchical measurements introduced recently. A series of interesting properties are identified and discussed comparatively to random and scale-free models with the same number of nodes and similar connectivity.Comment: 10 pages, 4 figure

Arbitrary bi-dimensional finite strain crack propagation

In the past two decades numerous numerical procedures for crack propagation have been developed. Lately, enrichment methods (either local, such as SDA or global, such as XFEM) have been applied with success to simple problems, typically involving some intersections. For arbitrary finite strain propagation, numerous difficulties are encountered: modeling of intersection and coalescence, step size dependence and the presence of distorted finite elements. In order to overcome these difficulties, an approach fully capable of dealing with multiple advancing cracks and self-contact is presented (see Fig.1). This approach makes use of a coupled Arbitrary Lagrangian-Eulerian method (ALE) and local tip remeshing. This is substantially less costly than a full remeshing while retaining its full versatility. Compared to full remeshing, angle measures and crack paths are superior. A consistent continuationbased linear control is used to force the critical tip to be exactly critical, while moving around the candidate set. The critical crack front is identified and propagated when one of the following criteria reaches a material limiting value: (i) the stress intensity factor; or (ii) the element-ahead tip stress. These are the control equations. The ability to solve crack intersection and coalescence problems is shown. Additionally, the independence from crack tip and step size and the absence of blade and dagger-shaped finite elements is observed. Classic benchmarks are computed leading to excellent crack path and load-deflection results, where convergence rate is quadratic

The Redner - Ben-Avraham - Kahng cluster system

We consider a coagulation model first introduced by Redner, Ben-Avraham and Krapivsky in [Redner, Ben-Avraham, Kahng: Kinetics of 'cluster eating', J. Phys. A: Math. Gen., 20 (1987), 1231-1238], the main feature of which is that the reaction between a j-cluster and a k-cluster results in the creation of a |j-k|-cluster, and not, as in Smoluchowski's model, of a (j+k)-cluster. In this paper we prove existence and uniqueness of solutions under reasonably general conditions on the coagulation coefficients, and we also establish differenciability properties and continuous dependence of solutions. Some interesting invariance properties are also proved. Finally, we study the long-time behaviour of solutions, and also present a preliminary analysis of their scaling behaviour.Comment: 24 pages. 2 figures. Dedicated to Carlos Rocha and Luis Magalhaes on the occasion of their sixtieth birthday

On the convergence to critical scaling profiles in submonolayer deposition models

In this work we study the rate of convergence to similarity profiles in a mean field model for the deposition of a submonolayer of atoms in a crystal facet, when there is a critical minimal size $n\geq 2$ for the stability of the formed clusters. The work complements recently published related results by the same authors in which the rate of convergence was studied outside of a critical direction $x=\tau$ in the cluster size $x$ vs. time $\tau$ plane. In this paper we consider a different similarity variable, $\xi := (x-\tau)/\sqrt{\tau}$, corresponding to an inner expansion of that critical direction, and prove the convergence of solutions to a similarity profile $\Phi_{2,n}(\xi)$ when $x, \tau\to +\infty$ with $\xi$ fixed, as well as the rate at which the limit is approached.Comment: Dedicated to the memory of Jack Car

Rates of convergence to scaling profiles in a submonolayer deposition model and the preservation of memory of the initial condition

We establish rates of convergence of solutions to scaling (or similarity) profiles in a coagulation type system modelling submonolayer deposition. We prove that, although all memory of the initial condition is lost in the similarity limit, information about the large cluster tail of the initial condition is preserved in the rate of approach to the similarity profile. The proof relies in a change of variables that allows for the decoupling of the original infinite system of ordinary differential equations into a closed two-dimensional nonlinear system for the monomer--bulk dynamics and a lower triangular infinite dimensional linear one for the cluster dynamics. The detailed knowledge of the long time monomer concentration, which was obtained earlier by Costin et al. in (O. Costin, M. Grinfeld, K.P. O'Neill and H. Park, Long-time behaviour of point islands under fixed rate deposition, Commun. Inf. Syst. 13, (2), (2013), pp.183-200) using asymptotic methods and is rederived here by center manifold arguments, is then used for the asymptotic evaluation of an integral representation formula for the concentration of $j$-clusters. The use of higher order expressions, both for the Stirling expansion and for the monomer evolution at large times allow us to obtain, not only the similarity limit, but also the rate at which it is approached.Comment: Revised according to referee's suggestions; to be published in SIAM J. Math. Ana

The Redner - Ben-Avraham - Kahng coagulation system with constant coefficients: the finite dimensional case

We study the behaviour as $t\to\infty$ of solutions $(c_j(t))$ to the Redner--Ben-Avraham--Kahng coagulation system with positive and compactly supported initial data, rigorously proving and slightly extending results originally established in [4] by means of formal arguments.Comment: 13 pages, 1 figur