Power Allocation Games in Wireless Networks of Multi-antenna Terminals

We consider wireless networks that can be modeled by multiple access channels in which all the terminals are equipped with multiple antennas. The propagation model used to account for the effects of transmit and receive antenna correlations is the unitary-invariant-unitary model, which is one of the most general models available in the literature. In this context, we introduce and analyze two resource allocation games. In both games, the mobile stations selfishly choose their power allocation policies in order to maximize their individual uplink transmission rates; in particular they can ignore some specified centralized policies. In the first game considered, the base station implements successive interference cancellation (SIC) and each mobile station chooses his best space-time power allocation scheme; here, a coordination mechanism is used to indicate to the users the order in which the receiver applies SIC. In the second framework, the base station is assumed to implement single-user decoding. For these two games a thorough analysis of the Nash equilibrium is provided: the existence and uniqueness issues are addressed; the corresponding power allocation policies are determined by exploiting random matrix theory; the sum-rate efficiency of the equilibrium is studied analytically in the low and high signal-to-noise ratio regimes and by simulations in more typical scenarios. Simulations show that, in particular, the sum-rate efficiency is high for the type of systems investigated and the performance loss due to the use of the proposed suboptimum coordination mechanism is very small

Distance distribution in random graphs and application to networks exploration

We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of determining the proportion of edges connecting nodes that are at identical distance from the source node. The evolution of this quantity with the probability of existence of the edges exhibits intriguing oscillatory behavior. In order to perform our analysis, we introduce a new way of computing the distribution of distances between nodes. Our method outperforms previous similar analyses and leads to estimates that coincide remarkably well with numerical simulations. It allows us to characterize the phase transitions appearing when the connectivity probability varies.Comment: 12 pages, 8 figures (18 .eps files

Synchronizing automata with random inputs

We study the problem of synchronization of automata with random inputs. We present a series of automata such that the expected number of steps until synchronization is exponential in the number of states. At the same time, we show that the expected number of letters to synchronize any pair of the famous Cerny automata is at most cubic in the number of states

Synchronizing Automata on Quasi Eulerian Digraph

In 1964 \v{C}ern\'{y} conjectured that each $n$-state synchronizing automaton posesses a reset word of length at most $(n-1)^2$. From the other side the best known upper bound on the reset length (minimum length of reset words) is cubic in $n$. Thus the main problem here is to prove quadratic (in $n$) upper bounds. Since 1964, this problem has been solved for few special classes of \sa. One of this result is due to Kari \cite{Ka03} for automata with Eulerian digraphs. In this paper we introduce a new approach to prove quadratic upper bounds and explain it in terms of Markov chains and Perron-Frobenius theories. Using this approach we obtain a quadratic upper bound for a generalization of Eulerian automata.Comment: 8 pages, 1 figur

Transition Property For Cube-Free Words

We study cube-free words over arbitrary non-unary finite alphabets and prove the following structural property: for every pair $(u,v)$ of $d$-ary cube-free words, if $u$ can be infinitely extended to the right and $v$ can be infinitely extended to the left respecting the cube-freeness property, then there exists a "transition" word $w$ over the same alphabet such that $uwv$ is cube free. The crucial case is the case of the binary alphabet, analyzed in the central part of the paper. The obtained "transition property", together with the developed technique, allowed us to solve cube-free versions of three old open problems by Restivo and Salemi. Besides, it has some further implications for combinatorics on words; e.g., it implies the existence of infinite cube-free words of very big subword (factor) complexity.Comment: 14 pages, 5 figure

Double Exponential Instability of Triangular Arbitrage Systems

If financial markets displayed the informational efficiency postulated in the efficient markets hypothesis (EMH), arbitrage operations would be self-extinguishing. The present paper considers arbitrage sequences in foreign exchange (FX) markets, in which trading platforms and information are fragmented. In Kozyakin et al. (2010) and Cross et al. (2012) it was shown that sequences of triangular arbitrage operations in FX markets containing 4 currencies and trader-arbitrageurs tend to display periodicity or grow exponentially rather than being self-extinguishing. This paper extends the analysis to 5 or higher-order currency worlds. The key findings are that in a 5-currency world arbitrage sequences may also follow an exponential law as well as display periodicity, but that in higher-order currency worlds a double exponential law may additionally apply. There is an "inheritance of instability" in the higher-order currency worlds. Profitable arbitrage operations are thus endemic rather that displaying the self-extinguishing properties implied by the EMH.Comment: 22 pages, 22 bibliography references, expanded Introduction and Conclusion, added bibliohraphy reference

Power laws of complex systems from Extreme physical information

Many complex systems obey allometric, or power, laws y=Yx^{a}. Here y is the measured value of some system attribute a, Y is a constant, and x is a stochastic variable. Remarkably, for many living systems the exponent a is limited to values +or- n/4, n=0,1,2... Here x is the mass of a randomly selected creature in the population. These quarter-power laws hold for many attributes, such as pulse rate (n=-1). Allometry has, in the past, been theoretically justified on a case-by-case basis. An ultimate goal is to find a common cause for allometry of all types and for both living and nonliving systems. The principle I - J = extrem. of Extreme physical information (EPI) is found to provide such a cause. It describes the flow of Fisher information J => I from an attribute value a on the cell level to its exterior observation y. Data y are formed via a system channel function y = f(x,a), with f(x,a) to be found. Extremizing the difference I - J through variation of f(x,a) results in a general allometric law f(x,a)= y = Yx^{a}. Darwinian evolution is presumed to cause a second extremization of I - J, now with respect to the choice of a. The solution is a=+or-n/4, n=0,1,2..., defining the particular powers of biological allometry. Under special circumstances, the model predicts that such biological systems are controlled by but two distinct intracellular information sources. These sources are conjectured to be cellular DNA and cellular transmembrane ion gradient

A complexity analysis of Policy Iteration through combinatorial matrices arising from Unique Sink Orientations

Unique Sink Orientations (USOs) are an appealing abstraction of several major optimization problems of applied mathematics such as Linear Programming (LP), Markov Decision Processes (MDPs) or 2-player Turn Based Stochastic Games (2TBSGs). A polynomial time algorithm to find the sink of a USO would translate into a strongly polynomial time algorithm to solve the aforementioned problems—a major quest for all three cases. In the case of an acyclic USO of a cube, a situation that captures both MDPs and 2TBSGs, one can apply the well-known Policy Iteration (PI) algorithm. The study of its complexity is the object of this work. Despite its exponential worst case complexity, the principle of PI is a powerful source of inspiration for other methods. In 2012, Hansen and Zwick introduced a new combinatorial relaxation of the complexity problem for PI resulting in what we call Order-Regular (OR) matrices. They conjectured that the maximum number of rows of such matrices—an upper bound on the number of steps of PI—should follow the Fibonacci sequence. As our first contribution, we disprove the lower bound part of Hansen and Zwick's conjecture. Then, for our second contribution, we (exponentially) improve the Ω(1.4142n) lower bound on the number of steps of PI from Schurr and Szabó in the case of OR matrices and obtain an Ω(1.4269n) bound. © 2017 Elsevier B.V

Convergence and divergence in the evolution of cat skulls: temporal and spatial patterns of morphological diversity

Background: Studies of biological shape evolution are greatly enhanced when framed in a phylogenetic perspective. Inclusion of fossils amplifies the scope of macroevolutionary research, offers a deep-time perspective on tempo and mode of radiations, and elucidates life-trait changes. We explore the evolution of skull shape in felids (cats) through morphometric analyses of linear variables, phylogenetic comparative methods, and a new cladistic study of saber-toothed cats. Methodology/Principal Findings: A new phylogenetic analysis supports the monophyly of saber-toothed cats (Machairodontinae) exclusive of Felinae and some basal felids, but does not support the monophyly of various sabertoothed tribes and genera. We quantified skull shape variation in 34 extant and 18 extinct species using size-adjusted linear variables. These distinguish taxonomic group membership with high accuracy. Patterns of morphospace occupation are consistent with previous analyses, for example, in showing a size gradient along the primary axis of shape variation and a separation between large and small-medium cats. By combining the new phylogeny with a molecular tree of extant Felinae, we built a chronophylomorphospace (a phylogeny superimposed onto a two-dimensional morphospace through time). The evolutionary history of cats was characterized by two major episodes of morphological divergence, one marking the separation between saber-toothed and modern cats, the other marking the split between large and small-medium cats. Conclusions/Significance: Ancestors of large cats in the ‘Panthera’ lineage tend to occupy, at a much later stage, morphospace regions previously occupied by saber-toothed cats. The latter radiated out into new morphospace regions peripheral to those of extant large cats. The separation between large and small-medium cats was marked by considerable morphologically divergent trajectories early in feline evolution. A chronophylomorphospace has wider applications in reconstructing temporal transitions across two-dimensional trait spaces, can be used in ecophenotypical and functional diversity studies, and may reveal novel patterns of morphospace occupation