From neurons to epidemics: How trophic coherence affects spreading processes

Trophic coherence, a measure of the extent to which the nodes of a directed network are organised in levels, has recently been shown to be closely related to many structural and dynamical aspects of complex systems, including graph eigenspectra, the prevalence or absence of feed-back cycles, and linear stability. Furthermore, non-trivial trophic structures have been observed in networks of neurons, species, genes, metabolites, cellular signalling, concatenated words, P2P users, and world trade. Here we consider two simple yet apparently quite different dynamical models -- one a Susceptible-Infected-Susceptible (SIS) epidemic model adapted to include complex contagion, the other an Amari-Hopfield neural network -- and show that in both cases the related spreading processes are modulated in similar ways by the trophic coherence of the underlying networks. To do this, we propose a network assembly model which can generate structures with tunable trophic coherence, limiting in either perfectly stratified networks or random graphs. We find that trophic coherence can exert a qualitative change in spreading behaviour, determining whether a pulse of activity will percolate through the entire network or remain confined to a subset of nodes, and whether such activity will quickly die out or endure indefinitely. These results could be important for our understanding of phenomena such as epidemics, rumours, shocks to ecosystems, neuronal avalanches, and many other spreading processes

Deconstructing Interrupts with Ara

The emulation of DHTs is a natural issue. After years of important research into lambda calculus, we demonstrate the refinement of multicast frameworks. In order to answer this challenge, we disprove that despite the fact that spreadsheets and kernels are mostly incompatible, 128 bit architectures and active networks are regularly incompatible

AROUSING FEAR IN DENTAL HEALTH EDUCATION * , †

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/65851/1/j.1752-7325.1965.tb00484.x.pd

Staying true with the help of others: doxastic self-control through interpersonal commitment

I explore the possibility and rationality of interpersonal mechanisms of doxastic self-control, that is, ways in which individuals can make use of other people in order to get themselves to stick to their beliefs. I look, in particular, at two ways in which people can make interpersonal epistemic commitments, and thereby willingly undertake accountability to others, in order to get themselves to maintain their beliefs in the face of anticipated “epistemic temptations”. The first way is through the avowal of belief, and the second is through the establishment of collective belief. I argue that both of these forms of interpersonal epistemic commitment can function as effective tools for doxastic self-control, and, moreover, that the control they facilitate should not be dismissed as irrational from an epistemic perspective

Numerical treatment of the hyperboloidal initial value problem for the vacuum Einstein equations. III. On the determination of radiation

We discuss the issue of radiation extraction in asymptotically flat space-times within the framework of conformal methods for numerical relativity. Our aim is to show that there exists a well defined and accurate extraction procedure which mimics the physical measurement process. It operates entirely intrisically within \scri^+ so that there is no further approximation necessary apart from the basic assumption that the arena be an asymptotically flat space-time. We define the notion of a detector at infinity by idealising local observers in Minkowski space. A detailed discussion is presented for Maxwell fields and the generalisation to linearised and full gravity is performed by way of the similar structure of the asymptotic fields.Comment: LaTeX2e,13 pages,2 figure

Dynamic scaling regimes of collective decision making

We investigate a social system of agents faced with a binary choice. We assume there is a correct, or beneficial, outcome of this choice. Furthermore, we assume agents are influenced by others in making their decision, and that the agents can obtain information that may guide them towards making a correct decision. The dynamic model we propose is of nonequilibrium type, converging to a final decision. We run it on random graphs and scale-free networks. On random graphs, we find two distinct regions in terms of the "finalizing time" -- the time until all agents have finalized their decisions. On scale-free networks on the other hand, there does not seem to be any such distinct scaling regions

Zipf law in the popularity distribution of chess openings

We perform a quantitative analysis of extensive chess databases and show that the frequencies of opening moves are distributed according to a power-law with an exponent that increases linearly with the game depth, whereas the pooled distribution of all opening weights follows Zipf's law with universal exponent. We propose a simple stochastic process that is able to capture the observed playing statistics and show that the Zipf law arises from the self-similar nature of the game tree of chess. Thus, in the case of hierarchical fragmentation the scaling is truly universal and independent of a particular generating mechanism. Our findings are of relevance in general processes with composite decisions.Comment: 5 pages, 4 figure

Interior of a Schwarzschild black hole revisited

The Schwarzschild solution has played a fundamental conceptual role in general relativity, and beyond, for instance, regarding event horizons, spacetime singularities and aspects of quantum field theory in curved spacetimes. However, one still encounters the existence of misconceptions and a certain ambiguity inherent in the Schwarzschild solution in the literature. By taking into account the point of view of an observer in the interior of the event horizon, one verifies that new conceptual difficulties arise. In this work, besides providing a very brief pedagogical review, we further analyze the interior Schwarzschild black hole solution. Firstly, by deducing the interior metric by considering time-dependent metric coefficients, the interior region is analyzed without the prejudices inherited from the exterior geometry. We also pay close attention to several respective cosmological interpretations, and briefly address some of the difficulties associated to spacetime singularities. Secondly, we deduce the conserved quantities of null and timelike geodesics, and discuss several particular cases in some detail. Thirdly, we examine the Eddington-Finkelstein and Kruskal coordinates directly from the interior solution. In concluding, it is important to emphasize that the interior structure of realistic black holes has not been satisfactorily determined, and is still open to considerable debate.Comment: 15 pages, 7 figures, Revtex4. V2: Version to appear in Foundations of Physic

Entanglement transmission and generation under channel uncertainty: Universal quantum channel coding

We determine the optimal rates of universal quantum codes for entanglement transmission and generation under channel uncertainty. In the simplest scenario the sender and receiver are provided merely with the information that the channel they use belongs to a given set of channels, so that they are forced to use quantum codes that are reliable for the whole set of channels. This is precisely the quantum analog of the compound channel coding problem. We determine the entanglement transmission and entanglement-generating capacities of compound quantum channels and show that they are equal. Moreover, we investigate two variants of that basic scenario, namely the cases of informed decoder or informed encoder, and derive corresponding capacity results.Comment: 45 pages, no figures. Section 6.2 rewritten due to an error in equation (72) of the old version. Added table of contents, added section 'Conclusions and further remarks'. Accepted for publication in 'Communications in Mathematical Physics

Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels

We investigate entanglement transmission over an unknown channel in the presence of a third party (called the adversary), which is enabled to choose the channel from a given set of memoryless but non-stationary channels without informing the legitimate sender and receiver about the particular choice that he made. This channel model is called arbitrarily varying quantum channel (AVQC). We derive a quantum version of Ahlswede's dichotomy for classical arbitrarily varying channels. This includes a regularized formula for the common randomness-assisted capacity for entanglement transmission of an AVQC. Quite surprisingly and in contrast to the classical analog of the problem involving the maximal and average error probability, we find that the capacity for entanglement transmission of an AVQC always equals its strong subspace transmission capacity. These results are accompanied by different notions of symmetrizability (zero-capacity conditions) as well as by conditions for an AVQC to have a capacity described by a single-letter formula. In he final part of the paper the capacity of the erasure-AVQC is computed and some light shed on the connection between AVQCs and zero-error capacities. Additionally, we show by entirely elementary and operational arguments motivated by the theory of AVQCs that the quantum, classical, and entanglement-assisted zero-error capacities of quantum channels are generically zero and are discontinuous at every positivity point.Comment: 49 pages, no figures, final version of our papers arXiv:1010.0418v2 and arXiv:1010.0418. Published "Online First" in Communications in Mathematical Physics, 201