Search results for "Ergodicity"
showing 10 items of 31 documents
Conformational dynamics of a single protein monitored for 24 hours at video rate
2018
We use plasmon rulers to follow the conformational dynamics of a single protein for up to 24 h at a video rate. The plasmon ruler consists of two gold nanospheres connected by a single protein linker. In our experiment, we follow the dynamics of the molecular chaperone heat shock protein 90 (Hsp90), which is known to show “open” and “closed” conformations. Our measurements confirm the previously known conformational dynamics with transition times in the second to minute time scale and reveals new dynamics on the time scale of minutes to hours. Plasmon rulers thus extend the observation bandwidth 3–4 orders of magnitude with respect to single-molecule fluorescence resonance energy transfer a…
Retrieving infinite numbers of patterns in a spin-glass model of immune networks
2013
The similarity between neural and immune networks has been known for decades, but so far we did not understand the mechanism that allows the immune system, unlike associative neural networks, to recall and execute a large number of memorized defense strategies {\em in parallel}. The explanation turns out to lie in the network topology. Neurons interact typically with a large number of other neurons, whereas interactions among lymphocytes in immune networks are very specific, and described by graphs with finite connectivity. In this paper we use replica techniques to solve a statistical mechanical immune network model with `coordinator branches' (T-cells) and `effector branches' (B-cells), a…
The case of equality in the dichotomy of Mohammadi–Oh
2019
If $n \geq 3$ and $\Gamma$ is a convex-cocompact Zariski-dense discrete subgroup of $\mathbf{SO}^o(1,n+1)$ such that $\delta_\Gamma=n-m$ where $m$ is an integer, $1 \leq m \leq n-1$, we show that for any $m$-dimensional subgroup $U$ in the horospheric group $N$, the Burger-Roblin measure associated to $\Gamma$ on the quotient of the frame bundle is $U$-recurrent.
Determining a Random Schrödinger Operator : Both Potential and Source are Random
2020
We study an inverse scattering problem associated with a Schr\"odinger system where both the potential and source terms are random and unknown. The well-posedness of the forward scattering problem is first established in a proper sense. We then derive two unique recovery results in determining the rough strengths of the random source and the random potential, by using the corresponding far-field data. The first recovery result shows that a single realization of the passive scattering measurements uniquely recovers the rough strength of the random source. The second one shows that, by a single realization of the backscattering data, the rough strength of the random potential can be recovered…
Classes of sum-of-cisoids processes and their statistics for the modeling and simulation of mobile fading channels
2013
Published version of an article in the journal: EURASIP Journal on Wireless Communications and Networking. Also available from the publisher at: http://dx.doi.org/10.1186/1687-1499-2013-125 Open access In this paper, we present a fundamental study on the stationarity and ergodicity of eight classes of sum-of-cisoids (SOC) processes for the modeling and simulation of frequency-nonselective mobile Rayleigh fading channels. The purpose of this study is to determine which classes of SOC models enable the design of channel simulators that accurately reproduce the channel’s statistical properties without demanding information on the time origin or the time-consuming computation of an ensemble ave…
Bayesian inference in Markovian queues
1994
This paper is concerned with the Bayesian analysis of general queues with Poisson input and exponential service times. Joint posterior distribution of the arrival rate and the individual service rate is obtained from a sample consisting inn observations of the interarrival process andm complete service times. Posterior distribution of traffic intensity inM/M/c is also obtained and the statistical analysis of the ergodic condition from a decision point of view is discussed.
Distributed Particle Metropolis-Hastings Schemes
2018
We introduce a Particle Metropolis-Hastings algorithm driven by several parallel particle filters. The communication with the central node requires the transmission of only a set of weighted samples, one per filter. Furthermore, the marginal version of the previous scheme, called Distributed Particle Marginal Metropolis-Hastings (DPMMH) method, is also presented. DPMMH can be used for making inference on both a dynamical and static variable of interest. The ergodicity is guaranteed, and numerical simulations show the advantages of the novel schemes.
Mean ergodicity of weighted composition operators on spaces of holomorphic functions
2016
[EN] Let phi be a self-map of the unit disc D of the complex plane C and let psi be a holomorphic function on D. We investigate the mean ergodicity and power boundedness of the weighted composition operator C-phi,C-psi(f) = psi(f o phi) with symbol phi and multiplier psi on the space H(D). We obtain necessary and sufficient conditions on the symbol phi and on the multiplier psi which characterize when the weighted composition operator is power bounded and (uniformly) mean ergodic. One necessary condition is that the symbol phi has a fixed point in D. If phi is not a rational rotation, the sufficient conditions are related to the modulus of the multiplier on the fixed point of phi. Some of o…
Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
2000
Our aim is to present sufficient conditions ensuring Hoffman's error bound for lower semicontinuous nonconvex inequality systems and to analyze its impact on the local controllability, implicit function theorem for (non-Lipschitz) multivalued mappings, generalized equations (variational inequalities), and sensitivity analysis and on other problems like Lipschitzian properties of polyhedral multivalued mappings as well as weak sharp minima or linear conditioning. We show how the information about our sufficient conditions can be used to provide a computable constant such that Hoffman's error bound holds. We also show that this error bound is nothing but the classical Farkas lemma for linear …
QUANTITATIVE CONVERGENCE RATES FOR SUBGEOMETRIC MARKOV CHAINS
2015
We provide explicit expressions for the constants involved in the characterisation of ergodicity of subgeometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation conditions. The results are fundamental for the study of some algorithms where uniform bounds for these constants are needed for a family of Markov kernels. Our results accommodate also some classes of inhomogeneous chains.