A one-to-one correspondence between colorings and stable sets

Given a graph G, we construct an auxiliary graph with vertices such that the set of all stable sets of is in one-to-one correspondence with the set of all colorings of G. Then, we show that the Max-Coloring problem in G reduces to the Maximum Weighted Stable set problem in .     

Abnormal hysteresis effect and phase transitions in a velocity-difference dependent randomization CA model

Additional to the basic Nagel-Schreckenberg model for single-lane traffic flow, we consider the effect of the velocity-difference between two successive vehicles on the randomization of the latter one. This modification improves the transit capacity of the model, which results in a much higher simulated flux. Moreover, in a circular road, this model simulates an abnormal hysteresis effect. The characteristic shape of hysteresis curves may shed some light on the distinguish of synchronized flow and jams.     

The dynamical temperature and the standard map

Numerical experiments with the standard map at high values of the stochasticity parameter reveal the existence of simple analytical relations connecting the volume and the dynamical temperature of the chaotic component of the phase space.     

Cascading failures on weighted urban traffic equilibrium networks

In this paper, we study the cascading failure on weighted urban traffic equilibrium networks by introducing a more practical flow assignment mechanism. The whole process including edges overloading to node malfunctioning, dynamic spanning clustering and the phase transitions trigged with O-D flow evolving is simulated. It is found that there are three districts: slow, fast and stationary (collapse for scale-free networks) cascading failure districts. And different topologies have large effects on the ranges of these districts. Simulations also show that, although the latter can support larger traffic flow, homogeneous networks appear to be more robust against cascading failures than heterogeneous ones.     

Information theoretic description of networks

We present a new information theoretic approach for network characterizations. It is developed to describe the general type of networks with n nodes and L directed and weighted links, i.e., it also works for the simpler undirected and unweighted networks. The new information theoretic measures for network characterizations are based on a transmitter-receiver analogy of effluxes and influxes. Based on these measures, we classify networks as either complex or non-complex and as either democracy or dictatorship networks. Directed networks, in particular, are furthermore classified as either information spreading and information collecting networks.The complexity classification is based on the information theoretic network complexity measure medium articulation (MA). It is proven that special networks with a medium number of links (L∼n^1.5) show the theoretical maximum complexity . A network is complex if its MA is larger than the average MA of appropriately randomized networks: MA>MA_r. A network is of the democracy type if its redundancy R<R_r, otherwise it is a dictatorship network. In democracy networks all nodes are, on average, of similar importance, whereas in dictatorship networks some nodes play distinguished roles in network functioning. In other words, democracy networks are characterized by cycling of information (or mass, or energy), while in dictatorship networks there is a straight through-flow from sources to sinks. The classification of directed networks into information spreading and information collecting networks is based on the conditional entropies of the considered networks (H(A/B)=uncertainty of sender node if receiver node is known, H(B/A)=uncertainty of receiver node if sender node is known): if H(A/B)>H(B/A), it is an information collecting network, otherwise an information spreading network.Finally, different real networks (directed and undirected, weighted and unweighted) are classified according to our general scheme.     

Assessing symmetry of financial returns series

Testing symmetry of a probability distribution is a common question arising from applications in several fields. Particularly, in the study of observables used in the analysis of stock market index variations, the question of symmetry has not been fully investigated by means of statistical procedures. In this work a distribution-free test statistic T_n for testing symmetry, derived by Einmahl and McKeague, based on the empirical likelihood approach, is used to address the study of symmetry of financial returns. The asymptotic points of the test statistic T_n are also calculated and a procedure for assessing symmetry for the analysis of the returns of stock market indices is presented.     

Least and most colored bases

Consider a matroid M=(E,B), where B denotes the family of bases of M, and assign a color c(e) to every element e∈E (the same color can go to more than one element). The palette of a subset F of E, denoted by c(F), is the image of F under c. Assume also that colors have prices (in the form of a function π(?), where ? is the label of a color), and define the chromatic price as: π(F)=∑_?∈c(F)π(?). We consider the following problem: find a base B∈B such that π(B) is minimum. We show that the greedy algorithm delivers a lnr(M)-approximation of the unknown optimal value, where r(M) is the rank of matroid M. By means of a reduction from SETCOVER, we prove that the lnr(M) ratio cannot be further improved, even in the special case of partition matroids, unless . The results apply to the special case where M is a graphic matroid and where the prices π(?) are restricted to be all equal. This special case was previously known as the minimum label spanning tree (MLST) problem. For the MLST, our results improve over the ln(n-1)+1 ratio achieved by Wan, Chen and Xu in 2002. Inspired by the generality of our results, we study the approximability of coloring problems with different objective function π(F), where F is a common independent set on matroids M₁,…,M_k and, more generally, to independent systems characterized by the k-for-1 property.     

Satisfiability of mixed Horn formulas

In this paper the class of mixed Horn formulas is introduced that contain a Horn part and a 2-CNF (conjunctive normal form) (also called quadratic) part. We show that SAT remains NP-complete for such instances and also that any CNF formula can be encoded in terms of a mixed Horn formula in polynomial time. Further, we provide an exact deterministic algorithm showing that SAT for mixed Horn formulas containing n variables is solvable in time O(2^0.5284n). A strong argument showing that it is hard to improve a time bound of O(2^n/2) for mixed Horn formulas is provided. We also obtain a fixed-parameter tractability classification for SAT restricted to mixed Horn formulas C of at most k variables in its positive 2-CNF part providing the bound O(∥C∥2^0.5284k). We further show that the NP-hard optimization problem minimum weight SAT for mixed Horn formulas can be solved in time O(2^0.5284n) if non-negative weights are assigned to the variables. Motivating examples for mixed Horn formulas are level graph formulas [B. Randerath, E. Speckenmeyer, E. Boros, P. Hammer, A. Kogan, K. Makino, B. Simeone, O. Cepek, A satisfiability formulation of problems on level graphs, ENDM 9 (2001)] and graph colorability formulas.     

A group-based search for solutions of the n-queens problem

The n-queens problem is a well-known problem in mathematics, yet a full search for n-queens solutions has been tackled until now using only simple algorithms (with the exception of the Rivin-Zabih algorithm). In this article, we discuss optimizations that mainly rely on group actions on the set of n-queens solutions. Most of our arguments deal with the case of toroidal queens; at the end, the application to the regular n-queens problem is discussed, and also the Rivin-Zabih algorithm.     

Existence and porosity for a class of perturbed optimization problems in Banach spaces

Let X be a Banach space and Z a nonempty closed subset of X. Let be an upper semicontinuous function bounded from above. This paper is concerned with the perturbed optimization problem supz∈Z{J(z)+‖x−z‖}, which is denoted by (x,J)-sup. We shall prove in the present paper that if Z is a closed boundedly relatively weakly compact nonempty subset, then the set of all x∈X for which the problem (x,J)-sup has a solution is a dense Gδ-subset of X. In the case when X is uniformly convex and J is bounded, we will show that the set of all points x in X for which there does not exist z₀∈Z such that J(z₀)+‖x−z₀‖=supz∈Z{J(z)+‖x−z‖} is a σ-porous subset of X and the set of all points x∈X?Z⁰ such that there exists a maximizing sequence of the problem (x,J)-sup which has no convergent subsequence is a σ-porous subset of X?Z⁰, where Z⁰ denotes the set of all z∈Z such that z is in the solution set of (z,J)-sup.