Search results

...rlying [[Markov chain]], hidden Markov random fields have an underlying [[Markov random field]]. ...abilistic nature of <math> Y_i </math> is determined by the unobservable [[Markov random field]] <math> X_i </math>, <math> i \in S </math>. ...

...first = S. R. | last = Asmussen| doi = 10.1007/0-387-21525-5_2 | chapter = Markov Jump Processes | title = Applied Probability and Queues | series = Stochast For a continuous time Markov chain with state space ''S'' and [[transition-rate matrix]] ''Q'' (with ele ...

{{about|Kolmogorov's criterion in the study of Markov chains|Kolmogorov's criterion in the study of norms on topological vector s ...ssary and sufficient condition for a [[Markov chain]] or [[continuous-time Markov chain]] to be stochastically identical to its time-reversed version. ...

'''Dependency networks (DNs)''' are [[graphical model]]s, similar to [[Markov network]]s, wherein each vertex (node) corresponds to a random variable and ...st4=ROUNTHWAITE |first4=Robert |last5=KADIE |first5=Carl |title=Dependency Networks for Inference, Collaborative Filtering, and Data Visualization |journal=Jou ...

...method for reducing the size of the state space of some [[continuous-time Markov chain]]s, first published by [[John George Kemeny|Kemeny]] and Snell.<ref> | title = Finite Markov Chains ...

...atel | first2 = Naresh M. | title = Performance Modelling of Communication Networks and Computer Architectures | publisher = Addison-Wesley | year = 1992 | isb ...ize the [[equilibrium distribution]] (or any stationary distribution) of a Markov chain, when such a distribution exists. ...

...l how network ties affect personal characteristics across various types of networks. ...es: a social selection model. ''Exponential Random Graph Models for Social Networks: Theory, Methods and Applications. Cambridge University Press, New York, NY ...

...us word. This fact can be exploited in a sequence model such as a [[hidden Markov model]] or [[conditional random field]]<ref name="Laf:McC:Per01">{{cite con ...tive logic programming]], [[case-based reasoning]], [[structured SVM]]s, [[Markov logic network]]s, [[Probabilistic Soft Logic]], and [[constrained condition ...

...me="Lambiotte">Lambiotte, R. (2013.) "Burstiness and Spreading on Temporal Networks", University of Namur.</ref><ref>Neuts, M. F. (1993.) "The Burstiness of Po ...ogies, Services, and Protocols, Performance ofo Computer and Communication Networks, Mobile and Wireless Communication Systems'', 3462:918–29.</ref> or [[Traff ...

...atel | first2 = Naresh M. | title = Performance Modelling of Communication Networks and Computer Architectures | publisher = Addison-Wesley | date = 1992 | isb ...42| doi-access = free }}</ref> where he demonstrated the behaviour of loss networks can exhibit [[hysteresis]]. ...

...uted using the [[maximum entropy principle]], in analogy to the way that [[Markov chain]]s describe the uncertainty of [[finite-state machine]]s. ...

A '''dependability state diagram''' is a method for modelling a system as a [[Markov chain]]. It is used in [[reliability engineering]] for availability and rel | title = Dependable Computing Systems and Communication Networks ...

...mirni | first2 = E. | author2-link = Evgenia Smirni | chapter = M/G/1-Type Markov Processes: A Tutorial | doi = 10.1007/3-540-45798-4_3 | title = Performance ...hor|date=2024-06-13|bot=User:Cewbot/log/20201008/configuration|target_link=Markov chain#Reducibility|reason= The anchor (Reducibility) [[Special:Diff/9706941 ...

...ication networks | doi = 10.1016/0169-7552(93)90073-D | journal = Computer Networks and ISDN Systems | volume = 25 | issue = 10 | pages = 1135–2013 | year = 19 ...ed Probability Trust | jstor = 3212273| doi = 10.2307/3212273 }}</ref> and networks with a delay protocol.<ref name="dijk" /> ...

...2= Rabindranath |last3= Bandyopadhyay |first3= Suraj |year= 1996 |title= A Markov chain Monte Carlo method for generating random (0, 1)-matrices with given m ...deep |last3= Seshadri |first3= S. |title= Are we there yet? When to stop a Markov chain while generating random graphs |url= http://www.graphanalysis.org/SI ...

...|first2=Naresh M.|last2=Patel|title=Performance Modelling of Communication Networks and Computer Architectures|publisher=Addison-Wesley|year=1992|pages=[https: ...4= Trivedi | year=2006| edition=2 | page=259| title=Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applicati ...

...y function|density]] satisfies one of the [[Markov random field#Definition|Markov properties]] with respect to an undirected graph ''G'' if and only if it is The relationship between Markov and Gibbs random fields was initiated by [[Roland Dobrushin]]<ref>{{Citatio ...

...vision, 2002.</ref><ref name="SKF-Haykin-book">Kalman Filtering and Neural Networks. Edited by [[Simon Haykin]]. {{ISBN|0-471-22154-6}}</ref> but related switc ...<ref name="Kim-Econometrics">Kim, C.-J. (1994). Dynamic linear models with Markov-switching. J. Econometrics, 60:1–22.</ref> ...

...|first2=Naresh M.|last2=Patel|title=Performance Modelling of Communication Networks and Computer Architectures|publisher=Addison-Wesley|year=1992|page=[https:/ ...sue = 4 | pages = 377 | doi = 10.1023/A:1019115626557 | year = 1998 |title=Markov network processes with product form stationary distributions| s2cid = 14471 ...

The concept was first proposed by White and Smyth (2003) under the name ''Markov centrality''.<ref> | title = Algorithms for Estimating Relative Importance in Networks ...