scholarly journals Exact convex formulations of network-oriented optimal operator placement

2012 ◽  
Author(s):  
Ben W. Carabelli ◽  
Andreas Benzing ◽  
Frank Durr ◽  
Boris Koldehofe ◽  
Kurt Rothermel ◽  
...  
Keyword(s):  
Convex Formulations

scholarly journals Convex Formulations of Learning from Crowds

2012 ◽  
Vol 27 (3) ◽  
pp. 133-142 ◽  
Author(s):  
Hiroshi Kajino ◽  
Hisashi Kashima
Keyword(s):  
Convex Formulations

TNEP of meshed HVDC grids: ‘AC’, ‘DC’ and convex formulations

2019 ◽  
Vol 13 (24) ◽  
pp. 5523-5532 ◽  
Author(s):  
Jay Dave ◽  
Hakan Ergun ◽  
Ting An ◽  
Jingjing Lu ◽  
Dirk Van Hertem
Keyword(s):  
Convex Formulations

scholarly journals From Color-Avoiding to Color-Favored Percolation in Diluted Lattices

2020 ◽  
Vol 12 (8) ◽  
pp. 139
Author(s):  
Michele Giusfredi ◽  
Franco Bagnoli
Keyword(s):  
Phase Diagram ◽  
Phase Space ◽  
Paradoxical Effect ◽  
Critical Problem ◽  
Self Organized ◽  
Convex Formulations ◽  
Asymptotic Phase

We study the problem of color-avoiding and color-favored percolation in a network, i.e., the problem of finding a path that avoids a certain number of colors, associated with vulnerabilities of nodes or links, or is attracted by them. We investigate here regular (mainly directed) lattices with a fractions of links removed (hence the term “diluted”). We show that this problem can be formulated as a self-organized critical problem, in which the asymptotic phase space can be obtained in one simulation. The method is particularly effective for certain “convex” formulations, but can be extended to arbitrary problems using multi-bit coding. We obtain the phase diagram for some problem related to color-avoiding percolation on directed models. We also show that the interference among colors induces a paradoxical effect in which color-favored percolation is permitted where standard percolation for a single color is impossible.

Sign in / Sign up

Export Citation Format

Share Document