The Experts below are selected from a list of 3741 Experts worldwide ranked by ideXlab platform
Chung Chan - One of the best experts on this subject based on the ideXlab platform.
-
Matroidal Undirected Network
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Chung ChanAbstract:The Undirected graphical model is generalized to a linear matroid. The optimal direction for multicasting can be found in polynomial time with respect to the size of the Network. A more general problem is also considered where certain function of a distributed source is to be computed at multiple nodes. The converse results are derived, not from the usual cut-set bound but through the related problem of secret key agreement and secure source coding by public discussion. A unifying model of partly directed Network can also be formulated, covering both the directed and Undirected Networks as special cases.
-
ISIT - Matroidal Undirected Network
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Chung ChanAbstract:The Undirected graphical model is generalized to a linear matroid. The optimal direction for multicasting can be found in polynomial time with respect to the size of the Network. A more general problem is also considered where certain function of a distributed source is to be computed at multiple nodes. The converse results are derived, not from the usual cut-set bound but through the related problem of secret key agreement and secure source coding by public discussion. A unifying model of partly directed Network can also be formulated, covering both the directed and Undirected Networks as special cases.
-
ITA - From secret key agreement to matroidal Undirected Network
2012 Information Theory and Applications Workshop, 2012Co-Authors: Chung ChanAbstract:An Undirected Network link model is formulated, generalizing the usual Undirected graphical model. The optimal direction for multicasting can be found in polynomial time with respect to the size of the Network, despite the exponential number of possible directions. A more general problem is considered where certain function of a distributed source is to be computed at multiple nodes. The converse results are derived, not from the usual cut-set bound but through the related problem of secret key agreement and secure source coding by public discussion. A unifying model of partly directed Network is also formulated, covering both the directed and Undirected Networks as special cases.
-
From secret key agreement to matroidal Undirected Network
2012 Information Theory and Applications Workshop, 2012Co-Authors: Chung ChanAbstract:An Undirected Network link model is formulated, generalizing the usual Undirected graphical model. The optimal direction for multicasting can be found in polynomial time with respect to the size of the Network, despite the exponential number of possible directions. A more general problem is considered where certain function of a distributed source is to be computed at multiple nodes. The converse results are derived, not from the usual cut-set bound but through the related problem of secret key agreement and secure source coding by public discussion. A unifying model of partly directed Network is also formulated, covering both the directed and Undirected Networks as special cases.
-
The hidden flow of information
2011 IEEE International Symposium on Information Theory Proceedings, 2011Co-Authors: Chung ChanAbstract:An information identity is proven, equating the secrecy capacity of the multiterminal secret key agreement problem and the throughput of certain Undirected Network. As a consequence, Network coding can be used for secret key agreement while secrecy capacity characterizes the Network throughput. A meaningful notion of mutual dependence is established with the combinatorial interpretation of partition connectivity.
Wei Teng - One of the best experts on this subject based on the ideXlab platform.
-
SEAL - Research of Undirected Network capacity expansion based on the spanning-tree
Lecture Notes in Computer Science, 2006Co-Authors: Kaihua Xu, Hao Huang, Wei TengAbstract:This paper gives a mathematical description of the Undirected Network capacity definitions and theorems of computing capacities towards the Network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the Undirected Network capacities based on spanning tree and even an advanced optimization algorithm. In addition, it discusses Network capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of Undirected Network with limited costs is outlined, whose feasibility and process are illustrated via examples.
-
research of Undirected Network capacity expansion based on the spanning tree
Lecture Notes in Computer Science, 2006Co-Authors: Kaihua Xu, Hao Huang, Wei TengAbstract:This paper gives a mathematical description of the Undirected Network capacity definitions and theorems of computing capacities towards the Network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the Undirected Network capacities based on spanning tree and even an advanced optimization algorithm. In addition, it. discusses Network capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of Undirected Network with limited costs is outlined, whose feasibility and process are illustrated via examples.
Simone Montemezzani - One of the best experts on this subject based on the ideXlab platform.
-
an h n 2 upper bound on the price of stability of Undirected Network design games
Mathematical Foundations of Computer Science, 2014Co-Authors: Akaki Mamageishvili, Matus Mihalak, Simone MontemezzaniAbstract:In the Network design game with n players, every player chooses a path in an edge-weighted graph to connect her pair of terminals, sharing costs of the edges on her path with all other players fairly. We study the price of stability of the game, i.e., the ratio of the social costs of a best Nash equilibrium (with respect to the social cost) and of an optimal play. It has been shown that the price of stability of any Network design game is at most H n , the n-th harmonic number. This bound is tight for directed graphs. For Undirected graphs, the situation is dramatically different, and tight bounds are not known. It has only recently been shown that the price of stability is at most \(H_n \left(1-\frac{1}{\Theta(n^4)} \right)\), while the worst-case known example has price of stability around 2.25. In this paper we improve the upper bound considerably by showing that the price of stability is at most H n/2 + e for any e starting from some suitable n ≥ n(e).
Kaihua Xu - One of the best experts on this subject based on the ideXlab platform.
-
SEAL - Research of Undirected Network capacity expansion based on the spanning-tree
Lecture Notes in Computer Science, 2006Co-Authors: Kaihua Xu, Hao Huang, Wei TengAbstract:This paper gives a mathematical description of the Undirected Network capacity definitions and theorems of computing capacities towards the Network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the Undirected Network capacities based on spanning tree and even an advanced optimization algorithm. In addition, it discusses Network capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of Undirected Network with limited costs is outlined, whose feasibility and process are illustrated via examples.
-
research of Undirected Network capacity expansion based on the spanning tree
Lecture Notes in Computer Science, 2006Co-Authors: Kaihua Xu, Hao Huang, Wei TengAbstract:This paper gives a mathematical description of the Undirected Network capacity definitions and theorems of computing capacities towards the Network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the Undirected Network capacities based on spanning tree and even an advanced optimization algorithm. In addition, it. discusses Network capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of Undirected Network with limited costs is outlined, whose feasibility and process are illustrated via examples.
Akaki Mamageishvili - One of the best experts on this subject based on the ideXlab platform.
-
an h n 2 upper bound on the price of stability of Undirected Network design games
Mathematical Foundations of Computer Science, 2014Co-Authors: Akaki Mamageishvili, Matus Mihalak, Simone MontemezzaniAbstract:In the Network design game with n players, every player chooses a path in an edge-weighted graph to connect her pair of terminals, sharing costs of the edges on her path with all other players fairly. We study the price of stability of the game, i.e., the ratio of the social costs of a best Nash equilibrium (with respect to the social cost) and of an optimal play. It has been shown that the price of stability of any Network design game is at most H n , the n-th harmonic number. This bound is tight for directed graphs. For Undirected graphs, the situation is dramatically different, and tight bounds are not known. It has only recently been shown that the price of stability is at most \(H_n \left(1-\frac{1}{\Theta(n^4)} \right)\), while the worst-case known example has price of stability around 2.25. In this paper we improve the upper bound considerably by showing that the price of stability is at most H n/2 + e for any e starting from some suitable n ≥ n(e).
