Locking-free two-layer Timoshenko beam element with interlayer slip

A new locking-free strain-based finite element formulation for the numerical treatment of linear static analysis of two-layer planar composite beams with interlayer slip is proposed. In this formulation, the modified principle of virtual work is introduced as a basis for the finite element discretization. The linear kinematic equations are included into the principle by the procedure, similar to that of Lagrangian multipliers. A strain field vector remains the only unknown function to be interpolated in the finite element implementation of the principle. In contrast with some of the displacement-based and mixed finite element formulations of the composite beams with interlayer slip, the present formulation is completely locking-free. Hence, there are no shear and slip locking, poor convergence and stress oscillations in these finite elements. The generalization of the composite beam theory with the consideration of the Timoshenko beam theory for the individual component of a composite beam represents a substantial contribution in the field of analysis of non-slender composite beams with an interlayer slip. An extension of the present formulation to the non-linear material problems is straightforward. As only a few finite elements are needed to describe a composite beam with great precision, the new finite element formulations is perfectly suited for practical calculations. (c) 2007 Elsevier B.V. All rights reserved

Statistical physics of the Schelling model of segregation

We investigate the static and dynamic properties of a celebrated model of social segregation, providing a complete explanation of the mechanisms leading to segregation both in one- and two-dimensional systems. Standard statistical physics methods shed light on the rich phenomenology of this simple model, exhibiting static phase transitions typical of kinetic constrained models, nontrivial coarsening like in driven-particle systems and percolation-related phenomena.Comment: 4 pages, 3 figure

Critical fluctuations in spatial complex networks

An anomalous mean-field solution is known to capture the non trivial phase diagram of the Ising model in annealed complex networks. Nevertheless the critical fluctuations in random complex networks remain mean-field. Here we show that a break-down of this scenario can be obtained when complex networks are embedded in geometrical spaces. Through the analysis of the Ising model on annealed spatial networks, we reveal in particular the spectral properties of networks responsible for critical fluctuations and we generalize the Ginsburg criterion to complex topologies.Comment: (4 pages, 2 figures

Non-equilibrium mean-field theories on scale-free networks

Many non-equilibrium processes on scale-free networks present anomalous critical behavior that is not explained by standard mean-field theories. We propose a systematic method to derive stochastic equations for mean-field order parameters that implicitly account for the degree heterogeneity. The method is used to correctly predict the dynamical critical behavior of some binary spin models and reaction-diffusion processes. The validity of our non-equilibrium theory is furtherly supported by showing its relation with the generalized Landau theory of equilibrium critical phenomena on networks.Comment: 4 pages, no figures, major changes in the structure of the pape

Agent Based Models of Language Competition: Macroscopic descriptions and Order-Disorder transitions

We investigate the dynamics of two agent based models of language competition. In the first model, each individual can be in one of two possible states, either using language $X$ or language $Y$, while the second model incorporates a third state XY, representing individuals that use both languages (bilinguals). We analyze the models on complex networks and two-dimensional square lattices by analytical and numerical methods, and show that they exhibit a transition from one-language dominance to language coexistence. We find that the coexistence of languages is more difficult to maintain in the Bilinguals model, where the presence of bilinguals in use facilitates the ultimate dominance of one of the two languages. A stability analysis reveals that the coexistence is more unlikely to happen in poorly-connected than in fully connected networks, and that the dominance of only one language is enhanced as the connectivity decreases. This dominance effect is even stronger in a two-dimensional space, where domain coarsening tends to drive the system towards language consensus.Comment: 30 pages, 11 figure

Statistical Mechanics of maximal independent sets

The graph theoretic concept of maximal independent set arises in several practical problems in computer science as well as in game theory. A maximal independent set is defined by the set of occupied nodes that satisfy some packing and covering constraints. It is known that finding minimum and maximum-density maximal independent sets are hard optimization problems. In this paper, we use cavity method of statistical physics and Monte Carlo simulations to study the corresponding constraint satisfaction problem on random graphs. We obtain the entropy of maximal independent sets within the replica symmetric and one-step replica symmetry breaking frameworks, shedding light on the metric structure of the landscape of solutions and suggesting a class of possible algorithms. This is of particular relevance for the application to the study of strategic interactions in social and economic networks, where maximal independent sets correspond to pure Nash equilibria of a graphical game of public goods allocation

Optimizing spread dynamics on graphs by message passing

Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been successfully applied to describe cascades in a large variety of contexts. Over the last decades, many efforts have been devoted to understand the typical behaviour of the cascades arising from initial conditions extracted at random from some given ensemble. However, the problem of optimizing the trajectory of the system, i.e. of identifying appropriate initial conditions to maximize (or minimize) the final number of active nodes, is still considered to be practically intractable, with the only exception of models that satisfy a sort of diminishing returns property called submodularity. Submodular models can be approximately solved by means of greedy strategies, but by definition they lack cooperative characteristics which are fundamental in many real systems. Here we introduce an efficient algorithm based on statistical physics for the optimization of trajectories in cascade processes on graphs. We show that for a wide class of irreversible dynamics, even in the absence of submodularity, the spread optimization problem can be solved efficiently on large networks. Analytic and algorithmic results on random graphs are complemented by the solution of the spread maximization problem on a real-world network (the Epinions consumer reviews network).Comment: Replacement for "The Spread Optimization Problem

Transport on weighted Networks: when correlations are independent of degree

Most real-world networks are weighted graphs with the weight of the edges reflecting the relative importance of the connections. In this work, we study non degree dependent correlations between edge weights, generalizing thus the correlations beyond the degree dependent case. We propose a simple method to introduce weight-weight correlations in topologically uncorrelated graphs. This allows us to test different measures to discriminate between the different correlation types and to quantify their intensity. We also discuss here the effect of weight correlations on the transport properties of the networks, showing that positive correlations dramatically improve transport. Finally, we give two examples of real-world networks (social and transport graphs) in which weight-weight correlations are present.Comment: 8 pages, 8 figure

Preventing the Interaction between Coronaviruses Spike Protein and Angiotensin I Converting Enzyme 2: An In Silico Mechanistic Case Study on Emodin as a Potential Model Compound

Emodin, a widespread natural anthraquinone, has many biological activities including health-protective and adverse effects. Amongst beneficial effects, potential antiviral activity against coronavirus responsible for the severe acute respiratory syndrome outbreak in 2002–2003 has been described associated with the inhibition of the host cells target receptors recognition by the viral Spike protein. However, the inhibition mechanisms have not been fully characterized, hindering the rational use of emodin as a model compound to develop more effective analogues. This work investigates emodin interaction with the Spike protein to provide a mechanistic explanation of such inhibition. A 3D molecular modeling approach consisting of docking simulations, pharmacophoric analysis and molecular dynamics was used. The plausible mechanism is described as an interaction of emodin at the protein–protein interface which destabilizes the viral protein-target receptor complex. This analysis has been extended to the Spike protein of the coronavirus responsible for the current pandemic hypothesizing emodin’s functional conservation. This solid knowledge-based foothold provides a possible mechanistic rationale of the antiviral activity of emodin as a future basis for the potential development of efficient antiviral cognate compounds. Data gaps and future work on emodin-related adverse effects in parallel to its antiviral pharmacology are explored

Optimization in task--completion networks

We discuss the collective behavior of a network of individuals that receive, process and forward to each other tasks. Given costs they store those tasks in buffers, choosing optimally the frequency at which to check and process the buffer. The individual optimizing strategy of each node determines the aggregate behavior of the network. We find that, under general assumptions, the whole system exhibits coexistence of equilibria and hysteresis.Comment: 18 pages, 3 figures, submitted to JSTA