1 January 2014 in Open Geosciences
Modeling of dispersion of air pollutants in the atmosphere is one of the most important and challenging scientific problems. There are several natural and anthropogenic events where passive or chemically active compounds are emitted into the atmosphere. The effect of these chemical species can have serious impacts on our environment and human health. Modeling the dispersion of air pollutants can predict this effect. Therefore, development of various model strategies is a key element for the governmental and scientific communities. We provide here a brief review on the mathematical modeling of the dispersion of air pollutants in the atmosphere. We discuss the advantages and drawbacks of several model tools and strategies, namely Gaussian, Lagrangian, Eulerian and CFD models. We especially focus on several recent advances in this multidisciplinary research field, like parallel computing using graphical processing units, or adaptive mesh refinement.
26 April 2013 in Scientific Reports
We study the scaling behavior of the size of minimum dominating set (MDS) in scale-free networks, with respect to network size N and power-law exponent γ, while keeping the average degree fixed. We study ensembles generated by three different network construction methods, and we use a greedy algorithm to approximate the MDS. With a structural cutoff imposed on the maximal degree we find linear scaling of the MDS size with respect to N in all three network classes. Without any cutoff (kmax = N – 1) two of the network classes display a transition at γ ≈ 1.9, with linear scaling above, and vanishingly weak dependence below, but in the third network class we find linear scaling irrespective of γ. We find that the partial MDS, which dominates a given z < 1 fraction of nodes, displays essentially the same scaling behavior as the MDS.
17 July 2017 in IEEE Transactions on Control of Network Systems
A large variety of dynamical systems, such as chemical and biomolecular systems, can be seen as networks of nonlinear entities. Prediction, control, and identification of such nonlinear networks require knowledge of the state of the system. However, network states are usually unknown, and only a fraction of the state variables are directly measurable. The observability problem concerns reconstructing the network state from this limited information. Here, we propose a general optimization-based approach for observing the states of nonlinear networks and for optimally selecting the observed variables. Our results reveal several fundamental limitations in network observability, such as the tradeoff between the fraction of observed variables and the observation length on one side, and the estimation error on the other side. We also show that, owing to the crucial role played by the dynamics, purely graph-theoretic observability approaches cannot provide conclusions about one's practical ability to estimate the states. We demonstrate the effectiveness of our methods by finding the key components in biological and combustion reaction networks from which we determine the full system state. Our results can lead to the design of novel sensing principles that can greatly advance prediction and control of the dynamics of such networks.
13 February 2013 in Physical Review Letters
Helical and helicoidal precipitation patterns emerging in the wake of reaction-diffusion fronts are studied. In our experiments, these chiral structures arise with well-defined probabilities ${P}_{\mathrm{H}}$ controlled by conditions such as, e.g., the initial concentration of the reagents. We develop a model which describes the observed experimental trends. The results suggest that ${P}_{\mathrm{H}}$ is determined by a delicate interplay among the time and length scales related to the front and to the unstable precipitation modes and, furthermore, that the noise amplitude also plays a quantifiable role.
19 November 2018 in Nature Communications
Many real-life optimization problems can be formulated in Boolean logic as MaxSAT, a class of problems where the task is finding Boolean assignments to variables satisfying the maximum number of logical constraints. Since MaxSAT is NP-hard, no algorithm is known to efficiently solve these problems. Here we present a continuous-time analog solver for MaxSAT and show that the scaling of the escape rate, an invariant of the solver’s dynamics, can predict the maximum number of satisfiable constraints, often well before finding the optimal assignment. Simulating the solver, we illustrate its performance on MaxSAT competition problems, then apply it to two-color Ramsey number R ( m , m ) problems. Although it finds colorings without monochromatic 5-cliques of complete graphs on N ≤ 42 vertices, the best coloring for N = 43 has two monochromatic 5-cliques, supporting the conjecture that R (5, 5) = 43. This approach shows the potential of continuous-time analog dynamical systems as algorithms for discrete optimization.
1 January 2010 in Computer Physics Communications