How to Reduce Unnecessary Noise in Targeted Networks

Giacomo Aletti () and Diane Saada ()
Additional contact information
Giacomo Aletti: Università di Milano
Diane Saada: Università di Milano

A chapter in Networks, Topology and Dynamics, 2009, pp 177-193 from Springer

Abstract: This work is a review of previous works on the stopping laws in networks. Among other results, we show a non combinatorial method to compute the stopping law, the existence of a minimal Markov chain without oversized information, the existence of a polynomial algorithm which projects the Markov chain onto the minimal Markov chain. Several applied examples are presented.

Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-68409-1_9

Ordering information: This item can be ordered from
http://www.springer.com/9783540684091

DOI: 10.1007/978-3-540-68409-1_9

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().