Post-mission Viking data anaysis

Three Mars data analysis projects from the Viking Mars program were identified initially, and three more came into being as the work proceeded. All together, these six pertained to: (1) the veritical distribution of scattering particles in the Martian atmosphere at various locations in various seasons, (2) the physical parameters that define photometric properties of the Martian surface and atmosphere, (3) patterns of dust-cloud and global dust-storm development, (4) a direct comparison of near-simultaneous Viking and ground-based observations, (5) the annual formation and dissipation of polar frost caps, and (6) evidence concerning possible present-day volcanism or venting. A list of publications pertaining to the appropriate projects is included

Patterns of link reciprocity in directed networks

We address the problem of link reciprocity, the non-random presence of two mutual links between pairs of vertices. We propose a new measure of reciprocity that allows the ordering of networks according to their actual degree of correlation between mutual links. We find that real networks are always either correlated or anticorrelated, and that networks of the same type (economic, social, cellular, financial, ecological, etc.) display similar values of the reciprocity. The observed patterns are not reproduced by current models. This leads us to introduce a more general framework where mutual links occur with a conditional connection probability. In some of the studied networks we discuss the form of the conditional connection probability and the size dependence of the reciprocity.Comment: Final version accepted for publication on Physical Review Letter

Waiting time dynamics of priority-queue networks

We study the dynamics of priority-queue networks, generalizations of the binary interacting priority queue model introduced by Oliveira and Vazquez [Physica A {\bf 388}, 187 (2009)]. We found that the original AND-type protocol for interacting tasks is not scalable for the queue networks with loops because the dynamics becomes frozen due to the priority conflicts. We then consider a scalable interaction protocol, an OR-type one, and examine the effects of the network topology and the number of queues on the waiting time distributions of the priority-queue networks, finding that they exhibit power-law tails in all cases considered, yet with model-dependent power-law exponents. We also show that the synchronicity in task executions, giving rise to priority conflicts in the priority-queue networks, is a relevant factor in the queue dynamics that can change the power-law exponent of the waiting time distribution.Comment: 5 pages, 3 figures, minor changes, final published versio

Continuum states from time-dependent density functional theory

Linear response time-dependent density functional theory is used to study low-lying electronic continuum states of targets that can bind an extra electron. Exact formulas to extract scattering amplitudes from the susceptibility are derived in one dimension. A single-pole approximation for scattering phase shifts in three dimensions is shown to be more accurate than static exchange for singlet electron-He$^+$ scattering.Comment: 5 pages, 2 figures, J. Chem. Phys. accepte

Analysis of weighted networks

The connections in many networks are not merely binary entities, either present or not, but have associated weights that record their strengths relative to one another. Recent studies of networks have, by and large, steered clear of such weighted networks, which are often perceived as being harder to analyze than their unweighted counterparts. Here we point out that weighted networks can in many cases be analyzed using a simple mapping from a weighted network to an unweighted multigraph, allowing us to apply standard techniques for unweighted graphs to weighted ones as well. We give a number of examples of the method, including an algorithm for detecting community structure in weighted networks and a new and simple proof of the max-flow/min-cut theorem.Comment: 9 pages, 3 figure

Characteristic length of random knotting for cylindrical self-avoiding polygons

We discuss the probability of random knotting for a model of self-avoiding polygons whose segments are given by cylinders of unit length with radius $r$. We show numerically that the characteristic length of random knotting is roughly approximated by an exponential function of the chain thickness $r$.Comment: 5 pages, 4 figure

Maximal-entropy random walk unifies centrality measures

In this paper analogies between different (dis)similarity matrices are derived. These matrices, which are connected to path enumeration and random walks, are used in community detection methods or in computation of centrality measures for complex networks. The focus is on a number of known centrality measures, which inherit the connections established for similarity matrices. These measures are based on the principal eigenvector of the adjacency matrix, path enumeration, as well as on the stationary state, stochastic matrix or mean first-passage times of a random walk. Particular attention is paid to the maximal-entropy random walk, which serves as a very distinct alternative to the ordinary random walk used in network analysis. The various importance measures, defined both with the use of ordinary random walk and the maximal-entropy random walk, are compared numerically on a set of benchmark graphs. It is shown that groups of centrality measures defined with the two random walks cluster into two separate families. In particular, the group of centralities for the maximal-entropy random walk, connected to the eigenvector centrality and path enumeration, is strongly distinct from all the other measures and produces largely equivalent results.Comment: 7 pages, 2 figure

Clustering in Complex Directed Networks

Many empirical networks display an inherent tendency to cluster, i.e. to form circles of connected nodes. This feature is typically measured by the clustering coefficient (CC). The CC, originally introduced for binary, undirected graphs, has been recently generalized to weighted, undirected networks. Here we extend the CC to the case of (binary and weighted) directed networks and we compute its expected value for random graphs. We distinguish between CCs that count all directed triangles in the graph (independently of the direction of their edges) and CCs that only consider particular types of directed triangles (e.g., cycles). The main concepts are illustrated by employing empirical data on world-trade flows

Anderson lattice with explicit Kondo coupling: general features and the field-induced suppression of heavy-fermion state in ferromagnetic phase

We apply the extended (statistically-consistent, SGA) Gutzwiller-type approach to the periodic Anderson model (PAM) in an applied magnetic field and in the strong correlation limit. The finite-U corrections are included systematically by transforming PAM into the form with Kondo-type interaction and residual hybridization, appearing both at the same time. This effective Hamiltonian represents the essence of \textit{Anderson-Kondo lattice model}. We show that in ferromagnetic phases the low-energy single-particle states are strongly affected by the presence of the applied magnetic field. We also find that for large values of hybridization strength the system enters the so-called \textit{locked heavy fermion state}. In this state the chemical potential lies in the majority-spin hybridization gap and as a consequence, the system evolution is insensitive to further increase of the applied field. However, for a sufficiently strong magnetic field, the system transforms from the locked state to the fully spin-polarized phase. This is accompanied by a metamagnetic transition, as well as by drastic reduction of the effective mass of quasiparticles. In particular, we observe a reduction of effective mass enhancement in the majority-spin subband by as much as 20% in the fully polarized state. The findings are consistent with experimental results for Ce$_x$La$_{1-x}$B$_6$ compounds. The mass enhancement for the spin-minority electrons may also diminish with the increasing field, unlike for the quasiparticles states in a single narrow band in the same limit of strong correlations