Detecting degree symmetries in networks

The surrounding of a vertex in a network can be more or less symmetric. We derive measures of a specific kind of symmetry of a vertex which we call degree symmetry -- the property that many paths going out from a vertex have overlapping degree sequences. These measures are evaluated on artificial and real networks. Specifically we consider vertices in the human metabolic network. We also measure the average degree-symmetry coefficient for different classes of real-world network. We find that most studied examples are weakly positively degree-symmetric. The exceptions are an airport network (having a negative degree-symmetry coefficient) and one-mode projections of social affiliation networks that are rather strongly degree-symmetric

Discrete concavity and the half-plane property

Murota et al. have recently developed a theory of discrete convex analysis which concerns M-convex functions on jump systems. We introduce here a family of M-concave functions arising naturally from polynomials (over a field of generalized Puiseux series) with prescribed non-vanishing properties. This family contains several of the most studied M-concave functions in the literature. In the language of tropical geometry we study the tropicalization of the space of polynomials with the half-plane property, and show that it is strictly contained in the space of M-concave functions. We also provide a short proof of Speyer's hive theorem which he used to give a new proof of Horn's conjecture on eigenvalues of sums of Hermitian matrices.Comment: 14 pages. The proof of Theorem 4 is corrected

Neutral theory of chemical reaction networks

To what extent do the characteristic features of a chemical reaction network reflect its purpose and function? In general, one argues that correlations between specific features and specific functions are key to understanding a complex structure. However, specific features may sometimes be neutral and uncorrelated with any system-specific purpose, function or causal chain. Such neutral features are caused by chance and randomness. Here we compare two classes of chemical networks: one that has been subjected to biological evolution (the chemical reaction network of metabolism in living cells) and one that has not (the atmospheric planetary chemical reaction networks). Their degree distributions are shown to share the very same neutral system-independent features. The shape of the broad distributions is to a large extent controlled by a single parameter, the network size. From this perspective, there is little difference between atmospheric and metabolic networks; they are just different sizes of the same random assembling network. In other words, the shape of the degree distribution is a neutral characteristic feature and has no functional or evolutionary implications in itself; it is not a matter of life and death.Comment: 13 pages, 8 figure

Majority-vote model on hyperbolic lattices

We study the critical properties of a non-equilibrium statistical model, the majority-vote model, on heptagonal and dual heptagonal lattices. Such lattices have the special feature that they only can be embedded in negatively curved surfaces. We find, by using Monte Carlo simulations and finite-size analysis, that the critical exponents $1/\nu$, $\beta/\nu$ and $\gamma/\nu$ are different from those of the majority-vote model on regular lattices with periodic boundary condition, which belongs to the same universality class as the equilibrium Ising model. The exponents are also from those of the Ising model on a hyperbolic lattice. We argue that the disagreement is caused by the effective dimensionality of the hyperbolic lattices. By comparative studies, we find that the critical exponents of the majority-vote model on hyperbolic lattices satisfy the hyperscaling relation $2\beta/\nu+\gamma/\nu=D_{\mathrm{eff}}$, where $D_{\mathrm{eff}}$ is an effective dimension of the lattice. We also investigate the effect of boundary nodes on the ordering process of the model.Comment: 8 pages, 9 figure

Relativistic Images in Randall-Sundrum II Braneworld Lensing

In this paper, we explore the properties of gravitational lensing by black holes in the Randall-Sundrum II braneworld. We use numerical techniques to calculate lensing observables using the Tidal Reissner-Nordstrom (TRN) and Garriga-Tanaka metrics to examine supermassive black holes and primordial black holes. We introduce a new way tp parameterize tidal charge in the TRN metric which results in a large increase in image magnifications for braneworld primordial black holes compared to their 4 dimensional analogues. Finally, we offer a mathematical analysis that allows us to analyze the validity of the logarithmic approximation of the bending angle for any static, spherically symmetric metric. We apply this to the TRN metric and show that it is valid for any amount of tidal charge.Comment: 13 pages, 3 figures; Accepted for Publication in Physical Review

On the half-plane property and the Tutte group of a matroid

A multivariate polynomial is stable if it is non-vanishing whenever all variables have positive imaginary parts. A matroid has the weak half-plane property (WHPP) if there exists a stable polynomial with support equal to the set of bases of the matroid. If the polynomial can be chosen with all of its nonzero coefficients equal to one then the matroid has the half-plane property (HPP). We describe a systematic method that allows us to reduce the WHPP to the HPP for large families of matroids. This method makes use of the Tutte group of a matroid. We prove that no projective geometry has the WHPP and that a binary matroid has the WHPP if and only if it is regular. We also prove that T_8 and R_9 fail to have the WHPP.Comment: 8 pages. To appear in J. Combin. Theory Ser.

Hierarchy Measures in Complex Networks

Using each node's degree as a proxy for its importance, the topological hierarchy of a complex network is introduced and quantified. We propose a simple dynamical process used to construct networks which are either maximally or minimally hierarchical. Comparison with these extremal cases as well as with random scale-free networks allows us to better understand hierarchical versus modular features in several real-life complex networks. For random scale-free topologies the extent of topological hierarchy is shown to smoothly decline with $\gamma$ -- the exponent of a degree distribution -- reaching its highest possible value for $\gamma \leq 2$ and quickly approaching zero for $\gamma>3$.Comment: 4 pages, 4 figure

All Work and All Play? A Framework to Design Game- based Information Systems

Organizations have increasingly sought to develop and use game-based information systems to increase engagement among employees or customers. However, many game-based information systems have failed due to poor design. Game-based information systems’ design must align with an organization’s need or problem and users’ motives. To help designers create game-based information systems that align with an organization’s needs, we present the game- based system design framework (GSDF). Designers can use this framework to select game-based elements to support aesthetics, dynamics, and mechanics to encourage intrinsic or extrinsic motivation among users. We also create a game-based system design diagram (GSDD) and process in the spirit of UML diagrams for designers to communicate game-based information system designs. We explain how one can use the GSDF and GSDD and their value for practice and research