- An n layer network is a strictly ordered set of digraphs G1,G2,…,Gn such that
- Vn is a subset of Vn-1 is a subset of … V1; where Vi is a set of vertices of Gi
- For m > 1, a path Pm(i,j) on vertices i, j in Vm exists only if Pm-1(i,j) on Vm-1 exists

- An n layer network is stable if and only if
- for all i,j in Vn, all paths Pn(i,j) are stable

- A path Pm(i,j) is stable if and only if for all q<=m, all Pq(i,j) are stable

Advertisements
(function(g,$){if("undefined"!=typeof g.__ATA){
g.__ATA.initAd({collapseEmpty:'after', sectionId:26942, width:300, height:250});
g.__ATA.initAd({collapseEmpty:'after', sectionId:114160, width:300, height:250});
}})(window,jQuery);
var o = document.getElementById('crt-1877556075');
if ("undefined"!=typeof Criteo) {
var p = o.parentNode;
p.style.setProperty('display', 'inline-block', 'important');
o.style.setProperty('display', 'block', 'important');
Criteo.DisplayAcceptableAdIfAdblocked({zoneid:388248,containerid:"crt-1877556075",collapseContainerIfNotAdblocked:true,"callifnotadblocked": function () {var o = document.getElementById('crt-1877556075'); o.style.setProperty('display','none','important');o.style.setProperty('visbility','hidden','important'); }
});
} else {
o.style.setProperty('display', 'none', 'important');
o.style.setProperty('visibility', 'hidden', 'important');
}