X-ray view of four high-luminosity Swift/BAT AGN: Unveiling obscuration and reflection with Suzaku

The Swift/BAT nine-month survey observed 153 AGN, all with ultra-hard X-ray BAT fluxes in excess of 10^-11 erg cm^-2 s^-1 and an average redshift of 0.03. Among them, four of the most luminous BAT AGN (44.73 < Log L(BAT) < 45.31) were selected as targets of Suzaku follow-up observations: J2246.0+3941 (3C 452), J0407.4+0339 (3C 105), J0318.7+6828, and J0918.5+0425. The column density, scattered/reflected emission, the properties of the Fe K line, and a possible variability are fully analyzed. For the latter, the spectral properties from Chandra, XMM-Newton and Swift/XRT public observations were compared with the present Suzaku analysis. Of our sample, 3C 452 is the only certain Compton-thick AGN candidate because of i) the high absorption and strong Compton reflection; ii) the lack of variability; iii) the "buried" nature, i.e. the low scattering fraction (<0.5%) and the extremely low relative [OIII] luminosity. In contrast 3C 105 is not reflection-dominated, despite the comparable column density, X-ray luminosity and radio morphology, but shows a strong long-term variability in flux and scattering fraction, consistent with the soft emission being scattered from a distant region (e.g., the narrow emission line region). The sample presents high (>100) X-to-[OIII] luminosity ratios, confirming the [OIII] luminosity to be affected by residual extinction in presence of mild absorption, especially for "buried" AGN such as 3C 452. Three of our targets are powerful FRII radio galaxies, making them the most luminous and absorbed AGN of the BAT Seyfert survey despite the inversely proportional N_H - L_X relation.Comment: A&A paper in press, 17 page

Identification of network modules by optimization of ratio association

We introduce a novel method for identifying the modular structures of a network based on the maximization of an objective function: the ratio association. This cost function arises when the communities detection problem is described in the probabilistic autoencoder frame. An analogy with kernel k-means methods allows to develop an efficient optimization algorithm, based on the deterministic annealing scheme. The performance of the proposed method is shown on a real data set and on simulated networks

Hierarchical Partial Planarity

In this paper we consider graphs whose edges are associated with a degree of {\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to construct layouts of these graphs in which the readability of an edge is proportional to its importance, that is, more important edges have fewer crossings. We formalize this problem and study the case in which there exist three different degrees of importance. We give a polynomial-time testing algorithm when the graph induced by the two most important sets of edges is biconnected. We also discuss interesting relationships with other constrained-planarity problems.Comment: Conference version appeared in WG201

Euclidean Greedy Drawings of Trees

Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence of greedy embeddings in the Euclidean plane R^2 is known for certain graph classes such as 3-connected planar graphs. We completely characterize the trees that admit a greedy embedding in R^2. This answers a question by Angelini et al. (Graph Drawing 2009) and is a further step in characterizing the graphs that admit Euclidean greedy embeddings.Comment: Expanded version of a paper to appear in the 21st European Symposium on Algorithms (ESA 2013). 24 pages, 20 figure

Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity

We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be interpreted as a variant of Level Planarity in which the vertices on each level appear in a prescribed total order. We establish a complexity dichotomy with respect to both the maximum degree and the level-width, that is, the maximum number of vertices that share a level. Our study of Ordered Level Planarity is motivated by connections to several other graph drawing problems. Geodesic Planarity asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a polygonal path composed of line segments with two adjacent directions from a given set $S$ of directions symmetric with respect to the origin. Our results on Ordered Level Planarity imply $NP$-hardness for any $S$ with $|S|\ge 4$ even if the given graph is a matching. Katz, Krug, Rutter and Wolff claimed that for matchings Manhattan Geodesic Planarity, the case where $S$ contains precisely the horizontal and vertical directions, can be solved in polynomial time [GD'09]. Our results imply that this is incorrect unless $P=NP$. Our reduction extends to settle the complexity of the Bi-Monotonicity problem, which was proposed by Fulek, Pelsmajer, Schaefer and \v{S}tefankovi\v{c}. Ordered Level Planarity turns out to be a special case of T-Level Planarity, Clustered Level Planarity and Constrained Level Planarity. Thus, our results strengthen previous hardness results. In particular, our reduction to Clustered Level Planarity generates instances with only two non-trivial clusters. This answers a question posed by Angelini, Da Lozzo, Di Battista, Frati and Roselli.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Simultaneous Orthogonal Planarity

We introduce and study the $\textit{OrthoSEFE}-k$ problem: Given $k$ planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there an assignment of the vertices to grid points and of the edges to paths on the grid such that the same edges in distinct graphs are assigned the same path and such that the assignment induces a planar orthogonal drawing of each of the $k$ graphs? We show that the problem is NP-complete for $k \geq 3$ even if the shared graph is a Hamiltonian cycle and has sunflower intersection and for $k \geq 2$ even if the shared graph consists of a cycle and of isolated vertices. Whereas the problem is polynomial-time solvable for $k=2$ when the union graph has maximum degree five and the shared graph is biconnected. Further, when the shared graph is biconnected and has sunflower intersection, we show that every positive instance has an OrthoSEFE with at most three bends per edge.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Competing interactions in arrested states of colloidal clays

Using experiments, theory and simulations, we show that the arrested state observed in a colloidal clay at intermediate concentrations is stabilized by the screened Coulomb repulsion (Wigner glass). Dilution experiments allow us to distinguish this high-concentration disconnected state, which melts upon addition of water, from a low-concentration gel state, which does not melt. Theoretical modelling and simulations reproduce the measured Small Angle X-Ray Scattering static structure factors and confirm the long-range electrostatic nature of the arrested structure. These findings are attributed to the different timescales controlling the competing attractive and repulsive interactions.Comment: Accepted for publication in Physical Review Letter

Arrested state of clay-water suspensions: gel or glass?

The aging of a charged colloidal system has been studied by Small Angle X-rays Scattering, in the exchanged momentum range Q=0.03 - 5 nm-1, and by Dynamic Light Scattering, at different clay concentrations (Cw =0.6 % - 2.8 %). The static structure factor, S(Q), has been determined as a function of both aging time and concentration. This is the first direct experimental evidence of the existence and evolution with aging time of two different arrested states in a single system simply obtained only by changing its volume fraction: an inhomogeneous state is reached at low concentrations, while a homogenous one is found at high concentrations.Comment: 5 pages, 2 figure

A Universal Point Set for 2-Outerplanar Graphs

A point set $S \subseteq \mathbb{R}^2$ is universal for a class $\cal G$ if every graph of ${\cal G}$ has a planar straight-line embedding on $S$. It is well-known that the integer grid is a quadratic-size universal point set for planar graphs, while the existence of a sub-quadratic universal point set for them is one of the most fascinating open problems in Graph Drawing. Motivated by the fact that outerplanarity is a key property for the existence of small universal point sets, we study 2-outerplanar graphs and provide for them a universal point set of size $O(n \log n)$.Comment: 23 pages, 11 figures, conference version at GD 201