48,635 research outputs found
Local stability in a transient Markov chain
We prove two propositions with conditions that a system, which is described
by a transient Markov chain, will display local stability. Examples of such
systems include partly overloaded Jackson networks, partly overloaded polling
systems, and overloaded multi-server queues with skill based service, under
first come first served policy.Comment: 6 page
A uniformization-based algorithm for model checking the CSL until operator on labeled queueing networks
We present a model checking procedure for the CSL until operator on the CTMCs that underlie Jackson queueing networks. The key issue lies in the fact that the underlying CTMC is infinite in as many dimension as there are queues in the JQN. We need to compute the transient state probabilities for all goal states and for all possible starting states. However, for these transient probabilities no computational procedures are readily available. The contribution of this paper is the proposal of a new uniformization-based approach to compute the transient state probabilities. Furthermore, we show how the highly structured state space of JQNs allows us to compute the possible infinite satisfaction set for until formulas. A case study on an e-business site shows the feasibility of our approach
Towards a System Theoretic Approach to Wireless Network Capacity in Finite Time and Space
In asymptotic regimes, both in time and space (network size), the derivation
of network capacity results is grossly simplified by brushing aside queueing
behavior in non-Jackson networks. This simplifying double-limit model, however,
lends itself to conservative numerical results in finite regimes. To properly
account for queueing behavior beyond a simple calculus based on average rates,
we advocate a system theoretic methodology for the capacity problem in finite
time and space regimes. This methodology also accounts for spatial correlations
arising in networks with CSMA/CA scheduling and it delivers rigorous
closed-form capacity results in terms of probability distributions. Unlike
numerous existing asymptotic results, subject to anecdotal practical concerns,
our transient one can be used in practical settings: for example, to compute
the time scales at which multi-hop routing is more advantageous than single-hop
routing
Endogenous Network Dynamics
In all social and economic interactions, individuals or coalitions choose not only with whom to interact but how to interact, and over time both the structure (the “with whom”) and the strategy (“the how”) of interactions change. Our objectives here are to model the structure and strategy of interactions prevailing at any point in time as a directed network and to address the following open question in the theory of social and economic network formation: given the rules of network and coalition formation, the preferences of individuals over networks, the strategic behavior of coalitions in forming networks, and the trembles of nature, what network and coalitional dynamics are likely to emergence and persist. Our main contributions are (i) to formulate the problem of network and coalition formation as a dynamic, stochastic game, (ii) to show that this game possesses a stationary correlated equilibrium (in network and coalition formation strategies), (iii) to show that, together with the trembles of nature, this stationary correlated equilibrium determines an equilibrium Markov process of network and coalition formation which respects the rules of network and coalition formation and the preferences of individuals, and (iv) to show that, although uncountably many networks may form, this endogenous process of network and coalition formation possesses a nonempty finite set of ergodic measures and generates a finite, disjoint collection of nonempty subsets of networks and coalitions, each constituting a basin of attraction. Moreover, we extend to the setting of endogenous Markov dynamics the notions of pairwise stability (Jackson-Wolinsky, 1996), strong stability (Jackson-van den Nouweland, 2005), and Nash stability (Bala-Goyal, 2000), and we show that in order for any network-coalition pair to be stable (pairwise, strong, or Nash) it is necessary and sufficient that the pair reside in one of finitely many basins of attraction - and hence reside in the support of an ergodic measure. The results we obtain here for endogenous network dynamics and stochastic basins of attraction are the dynamic analogs of our earlier results on endogenous network formation and strategic basins of attraction in static, abstract games of network formation (Page and Wooders, 2008), and build on the seminal contributions of Jackson and Watts (2002), Konishi and Ray (2003), and Dutta, Ghosal, and Ray (2005).
Endogenous Network Dynamics
In all social and economic interactions, individuals or coalitions choose not only with whom to interact but how to interact, and over time both the structure (the “with whom”) and the strategy (“the how”) of interactions change. Our objectives here are to model the structure and strategy of interactions prevailing at any point in time as a directed network and to address the following open question in the theory of social and economic network formation: given the rules of network and coalition formation, the preferences of individuals over networks, the strategic behavior of coalitions in forming networks, and the trembles of nature, what network and coalitional dynamics are likely to emerge and persist. Our main contributions are (i) to formulate the problem of network and coalition formation as a dynamic, stochastic game, (ii) to show that this game possesses a stationary correlated equilibrium (in network and coalition formation strategies), (iii) to show that, together with the trembles of nature, this stationary correlated equilibrium determines an equilibrium Markov process of network and coalition formation, and (iv) to show that this endogenous process possesses a finite, nonempty set of ergodic measures, and generates a finite, disjoint collection of nonempty subsets of networks and coalitions, each constituting a basin of attraction. We also extend to the setting of endogenous Markov dynamics the notions of pairwise stability (Jackson-Wolinsky, 1996), strong stability (Jacksonvan den Nouweland, 2005), and Nash stability (Bala-Goyal, 2000), and we show that in order for any network-coalition pair to persist and be stable (pairwise, strong, or Nash) it is necessary and sufficient that the pair reside in one of finitely many basins of attraction. The results we obtain here for endogenous network dynamics and stochastic basins of attraction are the dynamic analogs of our earlier results on endogenous network formation and strategic basins of attraction in static, abstract games of network formation (Page and Wooders, 2008), and build on the seminal contributions of Jackson and Watts (2002), Konishi and Ray (2003), and Dutta, Ghosal, and Ray (2005).Endogenous Network Dynamics, Dynamic Stochastic Games of Network Formation, Equilibrium Markov Process of Network Formation, Basins of Attraction, Harris Decomposition, Ergodic Probability Measures, Dynamic Path Dominance Core, Dynamic Pairwise Stability
Large deviations of a modified Jackson network: stability and rough asymptotics
Consider a modified, stable, two node Jackson network where server 2 helps
server 1 when server 2 is idle. The probability of a large deviation of the
number of customers at node one can be calculated using the flat boundary
theory of Schwartz and Weiss [Large Deviations Performance Analysis (1994),
Chapman and Hall, New York]. Surprisingly, however, these calculations show
that the proportion of time spent on the boundary, where server 2 is idle, may
be zero. This is in sharp contrast to the unmodified Jackson network which
spends a nonzero proportion of time on this boundary.Comment: Published at http://dx.doi.org/10.1214/105051604000000666 in the
Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute
of Mathematical Statistics (http://www.imstat.org
Hot-spot analysis for drug discovery targeting protein-protein interactions
Introduction: Protein-protein interactions are important for biological processes and pathological situations, and are attractive targets for drug discovery. However, rational drug design targeting protein-protein interactions is still highly challenging. Hot-spot residues are seen as the best option to target such interactions, but their identification requires detailed structural and energetic characterization, which is only available for a tiny fraction of protein interactions.
Areas covered: In this review, the authors cover a variety of computational methods that have been reported for the energetic analysis of protein-protein interfaces in search of hot-spots, and the structural modeling of protein-protein complexes by docking. This can help to rationalize the discovery of small-molecule inhibitors of protein-protein interfaces of therapeutic interest. Computational analysis and docking can help to locate the interface, molecular dynamics can be used to find suitable cavities, and hot-spot predictions can focus the search for inhibitors of protein-protein interactions.
Expert opinion: A major difficulty for applying rational drug design methods to protein-protein interactions is that in the majority of cases the complex structure is not available. Fortunately, computational docking can complement experimental data. An interesting aspect to explore in the future is the integration of these strategies for targeting PPIs with large-scale mutational analysis.This work has been funded by grants BIO2016-79930-R and SEV-2015-0493 from the Spanish Ministry of Economy, Industry and Competitiveness, and grant EFA086/15 from EU Interreg V POCTEFA. M Rosell is supported by an FPI fellowship from the Severo Ochoa program. The authors are grateful for the support of the the Joint BSC-CRG-IRB Programme in Computational Biology.Peer ReviewedPostprint (author's final draft
Cosmic Necklaces from String Theory
We present the properties of a cosmic superstring network in the scenario of
flux compactification. An infinite family of strings, the (p,q)-strings, are
allowed to exist. The flux compactification leads to a string tension that is
periodic in 'p'. Monopoles, appearing here as beads on a string, are formed in
certain interactions in such networks. This allows bare strings to become
cosmic necklaces. We study network evolution in this scenario, outlining what
conditions are necessary to reach a cosmologically viable scaling solution. We
also analyze the physics of the beads on a cosmic necklace, and present general
conditions for which they will be cosmologically safe, leaving the network's
scaling undisturbed. In particular, we find that a large average loop size is
sufficient for the beads to be cosmologically safe. Finally, we argue that loop
formation will promote a scaling solution for the interbead distance in some
situations.Comment: 14 pages, 5 figures; v3, typos corrected, comments added, published
versio
How conscious experience and working memory interact
Active components of classical working memory are conscious, but traditional theory does not account for this fact. Global Workspace theory suggests that consciousness is needed to recruit unconscious specialized networks that carry out detailed working memory functions. The IDA model provides a fine-grained analysis of this process, specifically of two classical workingmemory tasks, verbal rehearsal and the utilization of a visual image. In the process, new light is shed on the interactions between conscious and unconscious\ud
aspects of working memory
Iterating influence between players in a social network
We generalize a yes-no model of influence in a social network with a single step of mutual influence to a framework with iterated influence. Each agent makes an acceptance- rejection decision and has an inclination to say either ‘yes' or ‘no'. Due to influence by others, an agent's decision may be different from his original inclination. Such a transformation from the inclinations to the decisions is represented by an influence function. We analyze the decision process in which the mutual influence does not stop after one step but iterates. Any classical influence function can be coded by a stochastic matrix, and a generalization leads to stochastic influence functions. We apply Markov chains theory to the analysis of stochastic binary influence functions. We deliver a general analysis of the convergence of an influence function and then study the convergence of particular influence functions. This model is compared with the Asavathiratham model of influence. We also investigate models based on aggregation functions. In this context, we give a complete description of terminal classes, and show that the only terminal states are the consensus states if all players are weakly essential.Social network, influence, stochastic influence function, convergence, terminal class, Markov chains, aggregation functions.
- …