ترغب بنشر مسار تعليمي؟ اضغط هنا

Hilbert evolution algebras and its connection with discrete-time Markov chains

57   0   0.0 ( 0 )
 نشر من قبل Sebastian J. Vidal
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Evolution algebras are non-associative algebras. In this work we provide an extension of this class of algebras, in the context of Hilbert spaces, capable to deal with infinite-dimensional spaces. We illustrate the applicability of our approach by discussing a connection with discrete-time Markov chains with countable state space.



قيم البحث

اقرأ أيضاً

336 - Stephen Whitelam 2017
We describe a simple method that can be used to sample the rare fluctuations of discrete-time Markov chains. We focus on the case of Markov chains with well-defined steady-state measures, and derive expressions for the large-deviation rate functions (and upper bounds on such functions) for dynamical quantities extensive in the length of the Markov chain. We illustrate the method using a series of simple examples, and use it to study the fluctuations of a lattice-based model of active matter that can undergo motility-induced phase separation.
80 - Samuel N. Cohen 2016
We consider the problem of filtering an unseen Markov chain from noisy observations, in the presence of uncertainty regarding the parameters of the processes involved. Using the theory of nonlinear expectations, we describe the uncertainty in terms o f a penalty function, which can be propagated forward in time in the place of the filter.
This report presents the tool COMICS, which performs model checking and generates counterexamples for DTMCs. For an input DTMC, COMICS computes an abstract system that carries the model checking information and uses this result to compute a critical subsystem, which induces a counterexample. This abstract subsystem can be refined and concretized hierarchically. The tool comes with a command-line version as well as a graphical user interface that allows the user to interactively influence the refinement process of the counterexample.
The spectral gap $gamma$ of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to a fixed ti me $n$ may be observed. We consider here the problem of estimating $gamma$ from this data. Let $pi$ be the stationary distribution of $P$, and $pi_star = min_x pi(x)$. We show that if $n = tilde{O}bigl(frac{1}{gamma pi_star}bigr)$, then $gamma$ can be estimated to within multiplicative constants with high probability. When $pi$ is uniform on $d$ states, this matches (up to logarithmic correction) a lower bound of $tilde{Omega}bigl(frac{d}{gamma}bigr)$ steps required for precise estimation of $gamma$. Moreover, we provide the first procedure for computing a fully data-dependent interval, from a single finite-length trajectory of the chain, that traps the mixing time $t_{text{mix}}$ of the chain at a prescribed confidence level. The interval does not require the knowledge of any parameters of the chain. This stands in contrast to previous approaches, which either only provide point estimates, or require a reset mechanism, or additional prior knowledge. The interval is constructed around the relaxation time $t_{text{relax}} = 1/gamma$, which is strongly related to the mixing time, and the width of the interval converges to zero roughly at a $1/sqrt{n}$ rate, where $n$ is the length of the sample path.
We prove that an isomorphism of graded Grothendieck groups $K^{gr}_0$ of two Leavitt path algebras induces an isomorphism of a certain quotient of algebraic filtered $K$-theory and consequently an isomorphism of filtered $K$-theory of their associate d graph $C^*$-algebras. As an application, we show that, since for a finite graph $E$ with no sinks, $K^{gr}_0big(L(E)big)$ of the Leavitt path algebra $L(E)$ coincides with Kriegers dimension group of its adjacency matrix $A_E$, our result relates the shift equivalence of graphs to the filtered $K$-theory and consequently gives that two arbitrary shift equivalent matrices give stably isomorphic graph $C^*$-algebras. This result was only known for irreducible graphs.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا