Relevant bibliographies by topics / Markov algebras

Academic literature on the topic 'Markov algebras'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Markov algebras.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Markov algebras"

1

Accardi, Luigi, Abdessatar Souissi, and El Gheteb Soueidy. "Quantum Markov chains: A unification approach." Infinite Dimensional Analysis, Quantum Probability and Related Topics 23, no. 02 (June 2020): 2050016. http://dx.doi.org/10.1142/s0219025720500162.

Full text
Abstract:
In this paper, we study a unified approach for quantum Markov chains (QMCs). A new quantum Markov property that generalizes the old one, is discussed. We introduce Markov states and chains on general local algebras, possessing a generic algebraic property. We stress that this kind of algebras includes both Boson and Fermi algebras. Our main results concern two reconstruction theorems for quantum Markov chains and for quantum Markov states. Namely, we illustrate the results through examples.
APA, Harvard, Vancouver, ISO, and other styles
2

Cadavid, Paula, Mary Luz Rodiño Montoya, and Pablo M. Rodriguez. "The connection between evolution algebras, random walks and graphs." Journal of Algebra and Its Applications 19, no. 02 (January 29, 2019): 2050023. http://dx.doi.org/10.1142/s0219498820500231.

Full text
Abstract:
Evolution algebras are a new type of non-associative algebras which are inspired from biological phenomena. A special class of such algebras, called Markov evolution algebras, is strongly related to the theory of discrete time Markov chains. The winning of this relation is that many results coming from Probability Theory may be stated in the context of Abstract Algebra. In this paper, we explore the connection between evolution algebras, random walks and graphs. More precisely, we study the relationships between the evolution algebra induced by a random walk on a graph and the evolution algebra determined by the same graph. Given that any Markov chain may be seen as a random walk on a graph, we believe that our results may add a new landscape in the study of Markov evolution algebras.
APA, Harvard, Vancouver, ISO, and other styles
3

Mukhamedov, Farrukh, and Izzat Qaralleh. "Entropy Treatment of Evolution Algebras." Entropy 24, no. 5 (April 24, 2022): 595. http://dx.doi.org/10.3390/e24050595.

Full text
Abstract:
In this paper, by introducing an entropy of Markov evolution algebras, we treat the isomorphism of S-evolution algebras. A family of Markov evolution algebras is defined through the Hadamard product of structural matrices of non-negative real S-evolution algebras, and their isomorphism is studied by means of their entropy. Furthermore, the isomorphism of S-evolution algebras is treated using the concept of relative entropy.
APA, Harvard, Vancouver, ISO, and other styles
4

Mukhamedov, Farrukh, and Izzat Qaralleh. "Entropy Treatment of Evolution Algebras." Entropy 24, no. 5 (April 24, 2022): 595. http://dx.doi.org/10.3390/e24050595.

Full text
Abstract:
In this paper, by introducing an entropy of Markov evolution algebras, we treat the isomorphism of S-evolution algebras. A family of Markov evolution algebras is defined through the Hadamard product of structural matrices of non-negative real S-evolution algebras, and their isomorphism is studied by means of their entropy. Furthermore, the isomorphism of S-evolution algebras is treated using the concept of relative entropy.
APA, Harvard, Vancouver, ISO, and other styles
5

OHNO, HIROMICHI. "EXTENDABILITY OF GENERALIZED QUANTUM MARKOV CHAINS ON GAUGE INVARIANT C*-ALGEBRAS." Infinite Dimensional Analysis, Quantum Probability and Related Topics 08, no. 01 (March 2005): 141–52. http://dx.doi.org/10.1142/s0219025705001901.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jenčová, Anna, Dénes Petz, and József Pitrik. "Markov triplets on CCR-algebras." Acta Scientiarum Mathematicarum 76, no. 1-2 (June 2010): 111–34. http://dx.doi.org/10.1007/bf03549824.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kümmerer, Burkhard. "Markov dilations on W∗-algebras." Journal of Functional Analysis 63, no. 2 (September 1985): 139–77. http://dx.doi.org/10.1016/0022-1236(85)90084-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

MATSUI, TAKU. "MARKOV SEMIGROUPS ON UHF ALGEBRAS." Reviews in Mathematical Physics 05, no. 03 (September 1993): 587–600. http://dx.doi.org/10.1142/s0129055x93000176.

Full text
Abstract:
We consider a class of Markov semigroups on UHF algebras. We establish the existence of dynamics for long range interactions. Our idea is a non-commutative extension of the argument for classical interacting particle systems. As a by-product we obtain sufficient conditions for unique ergodicity.
APA, Harvard, Vancouver, ISO, and other styles
9

Matsumoto, Kengo. "On C*-Algebras Associated with Subshifts." International Journal of Mathematics 08, no. 03 (May 1997): 357–74. http://dx.doi.org/10.1142/s0129167x97000172.

Full text
Abstract:
We construct and study C*-algebras associated with subshifts in symbolic dynamics as a generalization of Cuntz–Krieger algebras for topological Markov shifts. We prove some universal properties for the C*-algebras and give a criterion for them to be simple and purely infinite. We also present an example of a C*-algebra coming from a subshift which is not conjugate to a Markov shift.
APA, Harvard, Vancouver, ISO, and other styles
10

Al Harbat, Sadek. "Markov trace on a tower of affine Temperley–Lieb algebras of type Ã." Journal of Knot Theory and Its Ramifications 24, no. 09 (August 2015): 1550049. http://dx.doi.org/10.1142/s0218216515500492.

Full text
Abstract:
We define a tower of affine Temperley–Lieb algebras of type Ã. We prove that there exists a unique Markov trace on this tower, this trace comes from the Markov–Ocneanu–Jones trace on the tower of Temperley–Lieb algebras of type A. We define an invariant of special kind of links as an application of this trace.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Markov algebras"

1

Black, Samson 1979. "Representations of Hecke algebras and the Alexander polynomial." Thesis, University of Oregon, 2010. http://hdl.handle.net/1794/10847.

Full text
Abstract:
viii, 50 p. : ill. A print copy of this thesis is available through the UO Libraries. Search the library catalog for the location and call number.
We study a certain quotient of the Iwahori-Hecke algebra of the symmetric group Sd , called the super Temperley-Lieb algebra STLd. The Alexander polynomial of a braid can be computed via a certain specialization of the Markov trace which descends to STLd. Combining this point of view with Ocneanu's formula for the Markov trace and Young's seminormal form, we deduce a new state-sum formula for the Alexander polynomial. We also give a direct combinatorial proof of this result.
Committee in charge: Arkady Vaintrob, Co-Chairperson, Mathematics Jonathan Brundan, Co-Chairperson, Mathematics; Victor Ostrik, Member, Mathematics; Dev Sinha, Member, Mathematics; Paul van Donkelaar, Outside Member, Human Physiology
APA, Harvard, Vancouver, ISO, and other styles
2

Milios, Dimitrios. "On approximating the stochastic behaviour of Markovian process algebra models." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/8930.

Full text
Abstract:
Markov chains offer a rigorous mathematical framework to describe systems that exhibit stochastic behaviour, as they are supported by a plethora of methodologies to analyse their properties. Stochastic process algebras are high-level formalisms, where systems are represented as collections of interacting components. This compositional approach to modelling allows us to describe complex Markov chains using a compact high-level specification. There is an increasing need to investigate the properties of complex systems, not only in the field of computer science, but also in computational biology. To explore the stochastic properties of large Markov chains is a demanding task in terms of computational resources. Approximating the stochastic properties can be an effective way to deal with the complexity of large models. In this thesis, we investigate methodologies to approximate the stochastic behaviour of Markovian process algebra models. The discussion revolves around two main topics: approximate state-space aggregation and stochastic simulation. Although these topics are different in nature, they are both motivated by the need to efficiently handle complex systems. Approximate Markov chain aggregation constitutes the formulation of a smaller Markov chain that approximates the behaviour of the original model. The principal hypothesis is that states that can be characterised as equivalent can be adequately represented as a single state. We discuss different notions of approximate state equivalence, and how each of these can be used as a criterion to partition the state-space accordingly. Nevertheless, approximate aggregation methods typically require an explicit representation of the transition matrix, a fact that renders them impractical for large models. We propose a compositional approach to aggregation, as a means to efficiently approximate complex Markov models that are defined in a process algebra specification, PEPA in particular. Regarding our contributions to Markov chain simulation, we propose an accelerated method that can be characterised as almost exact, in the sense that it can be arbitrarily precise. We discuss how it is possible to sample from the trajectory space rather than the transition space. This approach requires fewer random samples than a typical simulation algorithm. Most importantly, our approach does not rely on particular assumptions with respect to the model properties, in contrast to otherwise more efficient approaches.
APA, Harvard, Vancouver, ISO, and other styles
3

Johnston, Ann. "Markov Bases for Noncommutative Harmonic Analysis of Partially Ranked Data." Scholarship @ Claremont, 2011. http://scholarship.claremont.edu/hmc_theses/4.

Full text
Abstract:
Given the result $v_0$ of a survey and a nested collection of summary statistics that could be used to describe that result, it is natural to ask which of these summary statistics best describe $v_0$. In 1998 Diaconis and Sturmfels presented an approach for determining the conditional significance of a higher order statistic, after sampling a space conditioned on the value of a lower order statistic. Their approach involves the computation of a Markov basis, followed by the use of a Markov process with stationary hypergeometric distribution to generate a sample.This technique for data analysis has become an accepted tool of algebraic statistics, particularly for the study of fully ranked data. In this thesis, we explore the extension of this technique for data analysis to the study of partially ranked data, focusing on data from surveys in which participants are asked to identify their top $k$ choices of $n$ items. Before we move on to our own data analysis, though, we present a thorough discussion of the Diaconis–Sturmfels algorithm and its use in data analysis. In this discussion, we attempt to collect together all of the background on Markov bases, Markov proceses, Gröbner bases, implicitization theory, and elimination theory, that is necessary for a full understanding of this approach to data analysis.
APA, Harvard, Vancouver, ISO, and other styles
4

Cothren, Jackson D. "Reliability in constrained Gauss-Markov models an analytical and differential approach with applications in photogrammetry /." Connect to this title online, 2004. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1085689960.

Full text
Abstract:
Thesis (Ph. D.)--Ohio State University, 2004.
Title from first page of PDF file. Document formatted into pages; contains xii, 119 p.; also includes graphics (some col.). Includes bibliographical references (p. 106-109). Available online via OhioLINK's ETD Center
APA, Harvard, Vancouver, ISO, and other styles
5

Farlow, Kasie Geralyn. "Max-Plus Algebra." Thesis, Virginia Tech, 2009. http://hdl.handle.net/10919/32191.

Full text
Abstract:
In max-plus algebra we work with the max-plus semi-ring which is the set ℝmax=[-∞)∪ℝ together with operations 𝑎⊕𝑏 = max(𝑎,𝑏) and 𝑎⊗𝑏= 𝑎+𝑏.  The additive and multiplicative identities are taken to be ε=-∞ and ε=0 respectively. Max-plus algebra is one of many idempotent semi-rings which have been considered in various fields of mathematics. Max-plus algebra is becoming more popular not only because its operations are associative, commutative and distributive as in conventional algebra but because it takes systems that are non-linear in conventional algebra and makes them linear. Max-plus algebra also arises as the algebra of asymptotic growth rates of functions in conventional algebra which will play a significant role in several aspects of this thesis. This thesis is a survey of max-plus algebra that will concentrate on max-plus linear algebra results. We will then consider from a max-plus perspective several results by Wentzell and Freidlin for finite state Markov chains with an asymptotic dependence.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
6

Castro, Gilles Gonçalves de. "C*-álgebras associadas a certas dinâmicas e seus estados KMS." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2009. http://hdl.handle.net/10183/18824.

Full text
Abstract:
D'abord, on étudie trois façons d'associer une C*-algèbre à une transformation continue. Ensuite, nous donnons une nouvelle définition de l'entropie. Nous trouvons des relations entre les états KMS des algèbres préalablement définies et les états d'équilibre, donné par un principe variationnel. Dans la seconde partie, nous étudions les algèbres de Kajiwara-Watatani associees a un système des fonctions itérées. Nous comparons ces algèbres avec l'algèbre de Cuntz et le produit croisé. Enfin, nous étudions les états KMS des algèbres de Kajiwara-Watatani pour les actions provenant d'un potentiel et nous trouvouns des relations entre ces états et les mesures trouvee dans une version de le théorème de Ruelle-Perron-Frobenius pour les systèmes de fonctions itérées.
Primeiramente, estudamos três formas de associar uma C*-álgebra a uma transformação contínua. Em seguida, damos uma nova definição de entropia. Relacionamos, então, os estados KMS das álgebras anteriormente definidas com os estados de equilibro, vindos de um princípio variacional. Na segunda parte, estudamos as álgebras de Kajiwara-Watatani associadas a um sistema de funções iteradas. Comparamos tais álgebras com a álgebra de Cuntz e a álgebra do produto cruzado. Finalmente, estudamos os estados KMS das álgebras de Kajiwara-Watatani para ações vindas de um potencial e relacionamos tais estados KMS com medidas encontradas numa versão do teorema de Ruelle-Perron-Frobenius para sistemas de funções iteradas.
First, we study three ways of associating a C*-algebra to a continuous map. Then, we give a new de nition of entropy. We relate the KMS states of the previously de ned algebras with the equilibrium states, given by a variational principle. In the second part, we study the Kajiwara-Watatani algebras associated to iterated function system. We compare these algebras with the Cuntz algebra and the crossed product. Finally, we study the KMS states of the Kajiwara-Watatani algebras for actions coming from a potential and we relate such states with measures found in a version of the Ruelle-Perron- Frobenius theorem for iterated function systems.
APA, Harvard, Vancouver, ISO, and other styles
7

Orellana, Rosa C. "The Hecke algebra of type B at roots of unity, Markov traces and subfactors /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1999. http://wwwlib.umi.com/cr/ucsd/fullcit?p9938595.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tribastone, Mirco. "Scalable analysis of stochastic process algebra models." Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4629.

Full text
Abstract:
The performance modelling of large-scale systems using discrete-state approaches is fundamentally hampered by the well-known problem of state-space explosion, which causes exponential growth of the reachable state space as a function of the number of the components which constitute the model. Because they are mapped onto continuous-time Markov chains (CTMCs), models described in the stochastic process algebra PEPA are no exception. This thesis presents a deterministic continuous-state semantics of PEPA which employs ordinary differential equations (ODEs) as the underlying mathematics for the performance evaluation. This is suitable for models consisting of large numbers of replicated components, as the ODE problem size is insensitive to the actual population levels of the system under study. Furthermore, the ODE is given an interpretation as the fluid limit of a properly defined CTMC model when the initial population levels go to infinity. This framework allows the use of existing results which give error bounds to assess the quality of the differential approximation. The computation of performance indices such as throughput, utilisation, and average response time are interpreted deterministically as functions of the ODE solution and are related to corresponding reward structures in the Markovian setting. The differential interpretation of PEPA provides a framework that is conceptually analogous to established approximation methods in queueing networks based on meanvalue analysis, as both approaches aim at reducing the computational cost of the analysis by providing estimates for the expected values of the performance metrics of interest. The relationship between these two techniques is examined in more detail in a comparison between PEPA and the Layered Queueing Network (LQN) model. General patterns of translation of LQN elements into corresponding PEPA components are applied to a substantial case study of a distributed computer system. This model is analysed using stochastic simulation to gauge the soundness of the translation. Furthermore, it is subjected to a series of numerical tests to compare execution runtimes and accuracy of the PEPA differential analysis against the LQN mean-value approximation method. Finally, this thesis discusses the major elements concerning the development of a software toolkit, the PEPA Eclipse Plug-in, which offers a comprehensive modelling environment for PEPA, including modules for static analysis, explicit state-space exploration, numerical solution of the steady-state equilibrium of the Markov chain, stochastic simulation, the differential analysis approach herein presented, and a graphical framework for model editing and visualisation of performance evaluation results.
APA, Harvard, Vancouver, ISO, and other styles
9

Silva, Carlos Eduardo Vitória da. "Aplicações da álgebra linear nas cadeias de Markov." Universidade Federal de Goiás, 2013. http://repositorio.bc.ufg.br/tede/handle/tede/3480.

Full text
Abstract:
Submitted by Erika Demachki (erikademachki@gmail.com) on 2014-10-30T18:45:23Z No. of bitstreams: 2 Dissertação - Carlos Eduardo Vitória da Silva - 2013.pdf: 1162244 bytes, checksum: d2966939f025f381680dcb9ce82d76ac (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2014-10-31T09:36:29Z (GMT) No. of bitstreams: 2 Dissertação - Carlos Eduardo Vitória da Silva - 2013.pdf: 1162244 bytes, checksum: d2966939f025f381680dcb9ce82d76ac (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2014-10-31T09:36:29Z (GMT). No. of bitstreams: 2 Dissertação - Carlos Eduardo Vitória da Silva - 2013.pdf: 1162244 bytes, checksum: d2966939f025f381680dcb9ce82d76ac (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2013-04-11
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
The theory of linear algebra and matrices and systems particularly are linear math topics that can be applied not only within mathematics itself, but also in various other areas of human knowledge, such as physics, chemistry, biology, all engineering, psychology, economy, transportation, administration, statistics and probability, etc... The Markov chains are used to solve certain problems in the theory of probability. Applications of Markov chains in these problems, depend directly on the theory of matrices and linear systems. In this work we use the techniques of Markov Chains to solve three problems of probability, in three distinct areas. One in genetics, other in psychology and the other in the area of mass transit in a transit system. All work is developed with the intention that a high school student can read and understand the solutions of three problems presented.
A teoria da álgebra linear e particularmente matrizes e sistemas lineares são tópicos de matemática que podem ser aplicados não só dentro da própria matemática, mas também em várias outras áreas do conhecimento humano, como física, química, biologia, todas as engenharias, psicologia, economia, transporte, administração, estat ística e probabilidade, etc. As Cadeias de Markov são usadas para resolver certos problemas dentro da teoria das probabilidades. As aplicações das Cadeias de Markov nesses problemas, dependem diretamente da teoria das matrizes e sistemas lineares. Neste trabalho usamos as técnicas das Cadeias de Markov para resolver três problemas de probabilidades, em três áreas distintas. Um na área da genética, outro na área da psicologia e o outro na área de transporte de massa em um sistema de trânsito. Todo o trabalho é desenvolvido com a intenção de que um estudante do ensino médio possa ler e entender as soluções dos três problemas apresentados.
APA, Harvard, Vancouver, ISO, and other styles
10

Louise, Stéphane. "Calcul de majorants sûrs de temps d'exécution au pire pour des tâches d'applications temps-réels critiques, pour des systèmes disposants de caches mémoire." Phd thesis, Université Paris Sud - Paris XI, 2002. http://tel.archives-ouvertes.fr/tel-00695930.

Full text
Abstract:
Ce mémoire présente une nouvelle approche pour le calcul de temps d'exécution au pire (WCET) de tâche temps-réel critique, en particulier en ce qui concerne les aléas dus aux caches mémoire. Le point général est fait sur la problématique et l'état de l'art en la matière, mais l'accent est mis sur la théorie elle-même et son formalisme, d'abord dans le cadre monotâche puis dans le cadre multitâche. La méthode utilisée repose sur une technique d'interprétation abstraite, comme la plupart des autres méthodes de calcul de WCET, mais le formalisme est dans une approche probabiliste (bien que déterministe dans le cadre monotâche) de par l'utilisation de chaînes de Markov. La généralisation au cadre multitâche utilise les propriétés proba- bilistes pour faire une évaluation pessimiste d'un WCET et d'un écart type au pire, grâce à une modification astucieuse du propagateur dans ce cadre. Des premières évaluations du modèle, codées à la main à partir des résultats de compilation d'applications assez simples montrent des résultats promet- teurs quant à l'application du modèle sur des programmes réels en vraie grandeur.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Markov algebras"

1

1946-, Demuth Michael, ed. Schrödinger operators, Markov semigroups, wavelet analysis, operator algebras. Berlin: Akademie Verlag, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Evolution algebras and their applications. Berlin: Springer, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Conference Board of the Mathematical Sciences., ed. Algebraic ideas in ergodic theory. Providence, R.I: Published for the Conference Board of the Mathematical Sciences by the American Mathematical Society, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hisayuki, Hara, Takemura Akimichi, and SpringerLink (Online service), eds. Markov Bases in Algebraic Statistics. New York, NY: Springer New York, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Aoki, Satoshi, Hisayuki Hara, and Akimichi Takemura. Markov Bases in Algebraic Statistics. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-3719-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Shapiro, Helene. Linear Algebra And Matrices: Topics For A Second Course. Rhode Island, USA: American Mathematical Society, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Noncommutative stationary processes. Berlin: Springer, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Meyer, Carl D., and Robert J. Plemmons, eds. Linear Algebra, Markov Chains, and Queueing Models. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4613-8351-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cycle representations of Markov processes. New York: Springer-Verlag, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kalpazidou, Sophia L. Cycle representations of Markov processes. 2nd ed. New York: Springer, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Markov algebras"

1

Ganikhodzhaev, N. N., and F. M. Mukhamedov. "On Markov Random Fields on UHF Algebras." In Algebra and Operator Theory, 187–92. Dordrecht: Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-011-5072-9_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rhodes, John, and Anne Schilling. "Markov Chains Through Semigroup Graph Expansions (A Survey)." In Semigroups, Categories, and Partial Algebras, 141–59. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-33-4842-4_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kümmerer, Burkhard. "On the structure of markov dilations on W⋆-algebras." In Quantum Probability and Applications II, 318–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/bfb0074482.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Brinksma, Ed, and Holger Hermanns. "Process Algebra and Markov Chains." In Lecture Notes in Computer Science, 183–231. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44667-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hermanns, Holger. "Algebra of Interactive Markov Chains." In Interactive Markov Chains, 89–128. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45804-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ayyer, Arvind, Steven Klee, and Anne Schilling. "Markov Chains for Promotion Operators." In Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics, 285–304. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-0938-4_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Goldschmidt, David. "The Markov trace." In Group Characters, Symmetric Functions, and the Hecke Algebra, 67–71. Providence, Rhode Island: American Mathematical Society, 2002. http://dx.doi.org/10.1090/ulect/004/14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chaput, Philippe, Vincent Danos, Prakash Panangaden, and Gordon Plotkin. "Approximating Labelled Markov Processes Again!" In Algebra and Coalgebra in Computer Science, 145–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03741-2_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Behrends, Ehrhard. "How linear algebra comes into play." In Introduction to Markov Chains, 19–22. Wiesbaden: Vieweg+Teubner Verlag, 2000. http://dx.doi.org/10.1007/978-3-322-90157-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bonhoure, François, Yves Dallery, and William J. Stewart. "Algorithms for Periodic Markov Chains." In Linear Algebra, Markov Chains, and Queueing Models, 71–88. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4613-8351-2_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Markov algebras"

1

PITRIK, JÓZSEF. "MARKOV TRIPLETS ON CAR ALGEBRAS." In Proceedings of the 29th Conference. WORLD SCIENTIFIC, 2010. http://dx.doi.org/10.1142/9789814295437_0006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

FIDALEO, FRANCESCO. "MARKOV STATES ON QUASI–LOCAL ALGEBRAS." In Proceedings of the 26th Conference. WORLD SCIENTIFIC, 2007. http://dx.doi.org/10.1142/9789812770271_0018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

BAHN, C., C. K. KO, and Y. M. PARK. "CONSTRUCTION OF DIRICHLET FORMS AND SYMMETRIC MARKOV SEMIGROUPS ON ℤ2-GRADED VON NEUMANN ALGEBRAS." In Proceedings of the Meijo Winter School 2003. WORLD SCIENTIFIC, 2004. http://dx.doi.org/10.1142/9789812702449_0007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bacci, Giorgio, Radu Mardare, Prakash Panangaden, and Gordon Plotkin. "An Algebraic Theory of Markov Processes." In LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3209108.3209177.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bijker, Roelof, Kurt B. Wolf, Luis Benet, Juan Mauricio Torres, and Peter O. Hess. "Algebraic cluster model with tetrahedral symmetry." In SYMMETRIES IN NATURE: SYMPOSIUM IN MEMORIAM MARCOS MOSHINSKY. AIP, 2010. http://dx.doi.org/10.1063/1.3537858.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Xinru, and Eunhye Song. "Smart Linear Algebraic Operations for Efficient Gaussian Markov Improvement Algorithm." In 2020 Winter Simulation Conference (WSC). IEEE, 2020. http://dx.doi.org/10.1109/wsc48552.2020.9384017.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Akhalwaya, I., J. Wouters, M. Fannes, F. Petruccione, and Alexander Lvovsky. "The Algebraic Measure of a Hidden Markov Quantum Memory Channel." In QUANTUM COMMUNICATION, MEASUREMENT AND COMPUTING (QCMC): Ninth International Conference on QCMC. AIP, 2009. http://dx.doi.org/10.1063/1.3131288.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Iachello, F. "Spectrum generating algebras and dynamic symmetries in hadronic structure." In Group Theory in Physics: Proceedings of the international symposium held in honor of Professor Marcos Moshinsky. AIP, 1992. http://dx.doi.org/10.1063/1.42842.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Patera, J. "Graded contractions of Lie algebras, representations and tensor products." In Group Theory in Physics: Proceedings of the international symposium held in honor of Professor Marcos Moshinsky. AIP, 1992. http://dx.doi.org/10.1063/1.42858.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Behrends, Erik, Oliver Fritzen, Wolfgang May, and Franz Schenk. "Combining ECA Rules with Process Algebras for the Semantic Web." In 2006 Second International Conference on Rules and Rule Markup Languages for the Semantic Web (RuleML'06). IEEE, 2006. http://dx.doi.org/10.1109/ruleml.2006.8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Markov algebras' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography