The Graph Analysis Toolbox: Image Processing on Arbitrary Graphs

Office of Naval Research (N00014-01-1-0624)

Triangular flow in event-by-event ideal hydrodynamics in Au+Au collisions at √SNN = 200A GeV

The first calculation of triangular flow ν3 in Au+Au collisions at √sNN = 200A GeV from an event-by-event (3 + 1) d transport+hydrodynamics hybrid approach is presented. As a response to the initial triangularity Ie{cyrillic, ukrainian}3 of the collision zone, ν3 is computed in a similar way to the standard event-plane analysis for elliptic flow ν2. It is found that the triangular flow exhibits weak centrality dependence and is roughly equal to elliptic flow in most central collisions. We also explore the transverse momentum and rapidity dependence of ν2 and ν3 for charged particles as well as identified particles. We conclude that an event-by-event treatment of the ideal hydrodynamic evolution startingwith realistic initial conditions generates the main features expected for triangular flow. © 2010 The American Physical Society.

PenPC: A two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs.

Estimation of the skeleton of a directed acyclic graph (DAG) is of great importance for understanding the underlying DAG and causal effects can be assessed from the skeleton when the DAG is not identifiable. We propose a novel method named PenPC to estimate the skeleton of a high-dimensional DAG by a two-step approach. We first estimate the nonzero entries of a concentration matrix using penalized regression, and then fix the difference between the concentration matrix and the skeleton by evaluating a set of conditional independence hypotheses. For high-dimensional problems where the number of vertices p is in polynomial or exponential scale of sample size n, we study the asymptotic property of PenPC on two types of graphs: traditional random graphs where all the vertices have the same expected number of neighbors, and scale-free graphs where a few vertices may have a large number of neighbors. As illustrated by extensive simulations and applications on gene expression data of cancer patients, PenPC has higher sensitivity and specificity than the state-of-the-art method, the PC-stable algorithm.

Exact colorations of graphs and digraphs

A coloration is an exact regular coloration if whenever two vertices are colored the same they have identically colored neighborhoods. For example, if one of the two vertices that are colored the same is connected to three yellow vertices, two white and red, then the other vertex is as well. Exact regular colorations have been discussed informally in the social network literature. However they have been part of the mathematical literature for some time, though in a different format. We explore this concept in terms of social networks and illustrate some important results taken from the mathematical literature. In addition we show how the concept can be extended to ecological and perfect colorations, and discuss how the CATREGE algorithm can be extended to find the maximal exact regular coloration of a graph.

A generational scheme for partitioning graphs

Graph partitioning divides a graph into several pieces by cutting edges. Very effective heuristic partitioning algorithms have been developed which run in real-time, but it is unknown how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. Distinctive features are the transmission and modification of whole subdomains (the partitioned units) that act as genes, and the use of a multilevel heuristic algorithm to effect the crossover and mutations. Its effectiveness is demonstrated by improvements on previously established benchmarks.

On Hamilton cycles in locally connected graphs with vertex degree constraints

It is shown that every connected, locally connected graph with the maximum vertex degree Δ(G)=5 and the minimum vertex degree δ(G)3 is fully cycle extendable. For Δ(G)4, all connected, locally connected graphs, including infinite ones, are explicitly described. The Hamilton Cycle problem for locally connected graphs with Δ(G)7 is shown to be NP-complete

Hall conditions for edge-weighted bipartite graphs

A weighted variant of Hall's condition for the existence of matchings is shown to be equivalent to the existence of a matching in a lexicographic product. This is used to introduce characterizations of those bipartite graphs whose edges may be replicated so as to yield semiregular multigraphs or, equivalently, semiregular edge-weightings. Such bipartite graphs will be called semiregularizable. Some infinite families of semiregularizable trees are described and all semiregularizable trees on at most 11 vertices are listed. Matrix analogues of some of the results are mentioned and are shown to imply some of the known characterizations of regularizable graphs.

Multi-zone TAP-reactors theory and application - IV. Ideal and non-ideal boundary conditions

We study the influence of non-ideal boundary and initial conditions (BIC) of a temporal analysis of products (TAP) reactor model on the data (observed exit flux) analysis. The general theory of multi-response state-defining experiments for a multi-zone TAP reactor is extended and applied to model several alternative boundary and initial conditions proposed in the literature. The method used is based on the Laplace transform and the transfer matrix formalism for multi-response experiments. Two non-idealities are studied: (1) the inlet pulse not being narrow enough (gas pulse not entering the reactor in Dirac delta function shape) and (2) the outlet non-ideality due to imperfect vacuum. The effect of these non-idealities is analyzed to the first and second order of approximation. The corresponding corrections were obtained and discussed in detail. It was found that they are negligible. Therefore, the model with ideal boundary conditions is proven to be completely adequate to the description and interpretation of transport-reaction data obtained with TAP-2 reactors.

Theoretical considerations of electrochemical phase formation for an ideal Frank-van der Merwe system - Ag on Au(111) and Au(100)

: Static calculation and preliminary kinetic Monte Carlo simulation studies are undertaken for the nucleation and growth on a model system which follows a Frank-van der Merwe mechanism. In the present case, we consider the deposition of Ag on Au(100) and Au(111) surfaces. The interactions were calculated using the embedded atom model. The kinetics of formation and growth of 2D Ag structures on Au(100) and Au(111) is investigated and the influence of surface steps on this phenomenon is studied. Very different time scales are predicted for Ag diffusion on Au(100) and Au(111), thus rendering very different regimes for the nucleation and growth of the related 2D phases. These observations are drawn from the application of a model free of any adjustable parameter.

Graphs of relations and Hilbert series

We are discussing certain combinatorial and counting problems related to quadratic algebras. First we give examples which confirm the Anick conjecture on the minimal Hilbert series for algebras given by $n$ generators and $\frac {n(n-1)}{2}$ relations for $n \leq 7$. Then we investigate combinatorial structure of colored graph associated to relations of RIT algebra. Precise descriptions of graphs (maps) corresponding to algebras with maximal Hilbert series are given in certain cases. As a consequence it turns out, for example, that RIT algebra may have a maximal Hilbert series only if components of the graph associated to each color are pairwise 2-isomorphic.