Asymptotic Properties of Random Unlabelled Block-Weighted Graphs

We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As their number of vertices tends to infinity, we show that they admit the Brownian tree as Gromov–Hausdorff–Prokhorov scaling limit, and converge in a strengthened Benjamini–Schramm sense toward an infinite random graph. We also consider models of random graphs that are allowed to be disconnected. Here a giant connected component emerges and the small fragments converge without any rescaling towards a finite random limit graph. Our main application of these general results treats subcritical classes of unlabelled graphs. We study the special case of unlabelled outerplanar graphs in depth and calculate its scaling constant.

Inferring the Limit Behavior of Some Elementary Cellular Automata

Cellular automata locally define dynamical systems, discrete in space, time and in the state variables, capable of displaying arbitrarily complex global emergent behavior. One core question in the study of cellular automata refers to their limit behavior, that is, to the global dynamical features in an infinite time evolution. Previous works have shown that for finite time evolutions, the dynamics of one-dimensional cellular automata can be described by regular languages and, therefore, by finite automata. Such studies have shown the existence of growth patterns in the evolution of such finite automata for some elementary cellular automata rules and also inferred the limit behavior of such rules based upon the growth patterns; however, the results on the limit behavior were obtained manually, by direct inspection of the structures that arise during the time evolution. Here we present the formalization of an automatic method to compute such structures. Based on this, the rules of the elementary cellular automata space were classified according to the existence of a growth pattern in their finite automata. Also, we present a method to infer the limit graph of some elementary cellular automata rules, derived from the analysis of the regular expressions that describe their behavior in finite time. Finally, we analyze some attractors of two rules for which we could not compute the whole limit set.

Graphical reporting practices in the annual reports of jordanian banks: An empirical analysis

This study aims at investigating graphical reporting practices in the annual reports of Jordanian banks. Data are collected from the annual reports of 15 banks listed on Amman Stock Exchange for the period 2008-2013. The study revealed that graphs are being moderately used by Jordanian banks to present information in their annual reports. The presence of non-executive directors on the boards of Jordanian banks tend to limit graph usage in their annual reports. In addition, the study provides clear evidence for the presence of improperly designed graphs in the annual reports of Jordanian Banks. Thus, regulators in Jordan such as the Security Exchange Commission may need to develop a set of guiding principle for properly designed graphs. Furthermore, effort has to be devoted to encourage firms to comply with these principles.

Constitutive Description for Drawing Limit of Magnesium Alloy Tube Based on Continuum Damage Mechanics

The elasto-plastic behavior and the drawing limit of a kind of magnesium alloy tube were investigated based on the foundational theories of the larger deformation of material and continuum damage constitutive model. The corresponding finite element numerical algorithm was developed based on the constitutive model. The non-mandrel drawing limit graph according to the diameter at different tube thickness of an AZ31B tube with diameter 10mm at 250°C and drawing velocity 100mm/s was achieved, and safe & unsafe area got partitioned. The maximum damage value was evaluated to be 0.324 according to height reduction ratio limit and rigid-plastic FE analysis.