2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献

Recovering asymmetric communities in the stochastic block model 随机块模型中非对称群落的恢复

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-28 DOI: 10.1109/ALLERTON.2016.7852204

F. Caltagirone, M. Lelarge, Léo Miolane

{"title":"Recovering asymmetric communities in the stochastic block model","authors":"F. Caltagirone, M. Lelarge, Léo Miolane","doi":"10.1109/ALLERTON.2016.7852204","DOIUrl":"https://doi.org/10.1109/ALLERTON.2016.7852204","url":null,"abstract":"We consider the sparse stochastic block model in the case where the degrees are uninformative. The case where the two communities have approximately the same size has been extensively studied and we concentrate here on the community detection problem in the case of unbalanced communities. In this setting, spectral algorithms based on the non-backtracking matrix are known to solve the community detection problem (i.e. do strictly better than a random guess) when the signal is sufficiently large namely above the so-called Kesten Stigum threshold. In this regime and when the average degree tends to infinity, we show that if the community of a vanishing fraction of the vertices is revealed, then a local algorithm (belief propagation) is optimal down to Kesten Stigum threshold and we quantify explicitly its performance. Below the Kesten Stigum threshold, we show that, in the large degree limit, there is a second threshold called the spinodal curve below which, the community detection problem is not solvable. The spinodal curve is equal to the Kesten Stigum threshold when the fraction of vertices in the smallest community is above equation, so that the Kesten Stigum threshold is the threshold for solvability of the community detection in this case. However when the smallest community is smaller than p*, the spinodal curve only provides a lower bound on the threshold for solvability. In the regime below the Kesten Stigum bound and above the spinodal curve, we also characterize the performance of best local algorithms as a function of the fraction of revealed vertices. Our proof relies on a careful analysis of the associated reconstruction problem on trees which might be of independent interest. In particular, we show that the spinodal curve corresponds to the reconstruction threshold on the tree.","PeriodicalId":102145,"journal":{"name":"2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1866 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131366714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Information design for strategic coordination of autonomous devices with non-aligned utilities 自主设备与非对齐公用设施战略协调的信息设计

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-27 DOI: 10.1109/ALLERTON.2016.7852235

M. L. Treust, Tristan Tomala

引用次数: 23

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852207

Cédric Richier, R. E. Azouzi, T. Jiménez, E. Altman, G. Linarès

引用次数: 3

The role of strong convexity-concavity in the convergence and robustness of the saddle-point dynamics 强凹凸性在鞍点动力学的收敛性和鲁棒性中的作用

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852273

A. Cherukuri, Enrique Mallada, S. Low, J. Cortés

引用次数: 4

Symmetry reduction of information inequalities 信息不平等的对称约简

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852210

Kai Zhang, C. Tian

引用次数: 7

A two-round interactive receiver cooperation scheme for multicast channels 一种多播信道的两轮交互接收机合作方案

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852299

Victor Exposito, Sheng Yang, N. Gresset

引用次数: 3

On a notion of estimation entropy for stochastic hybrid systems 随机混合系统估计熵的概念

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852312

A. Awan, Majid Zamani

引用次数: 1

Online seismic event picking via sequential change-point detection 在线地震事件采集通过顺序变化点检测

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852311

Shuang Li, Yang Cao, Christina Leamon, Yao Xie, Lei Shi, Wenzhan Song

{"title":"Online seismic event picking via sequential change-point detection","authors":"Shuang Li, Yang Cao, Christina Leamon, Yao Xie, Lei Shi, Wenzhan Song","doi":"10.1109/ALLERTON.2016.7852311","DOIUrl":"https://doi.org/10.1109/ALLERTON.2016.7852311","url":null,"abstract":"Seismic event picking plays a key role in seismology studies. The goal of seismic event picking is to detect the onset of a seismic event, which typically causes an increase in the amplitude of the recorded signal. In this paper, we present a sequential change-point detection method for online seismic event detection, based on the generalized maximum likelihood statistic. We assume that the signals prior to the event are i.i.d. Gaussian random variables with zero mean and known variance, and after the event are i.i.d. Gaussian with zero mean and an increased unknown variance. We form a generalized likelihood ratio (GLR) based statistic by replacing the unknown variance with its maximum likelihood estimate, which takes a simple form and has a recursive implementation. An event is detected whenever the statistic exceeds a prescribed threshold. We compare the performance of our GLR procedure relative to the commonly used short-term-average/long-term-average (STA/LTA) algorithm, which is the state-of-the-art for seismic event detection, using large-scale seismic dataset and demonstrate the benefits of our GLR statistic. We also present a joint detection method to utilize the capability of seismic sensors to record signals through three independent channels, to achieve much better detection performance. We also present a method to combine GLR procedure with P-wave and S-wave filtering.","PeriodicalId":102145,"journal":{"name":"2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124227986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Prospect theory for enhanced smart grid resilience using distributed energy storage 分布式储能增强智能电网弹性的前景理论

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852237

Georges El Rahi, Anibal Sanjab, W. Saad, N. Mandayam, H. Poor

{"title":"Prospect theory for enhanced smart grid resilience using distributed energy storage","authors":"Georges El Rahi, Anibal Sanjab, W. Saad, N. Mandayam, H. Poor","doi":"10.1109/ALLERTON.2016.7852237","DOIUrl":"https://doi.org/10.1109/ALLERTON.2016.7852237","url":null,"abstract":"The proliferation of distributed generation and storage units is leading to the development of local, small-scale distribution grids, known as microgrids (MGs). In this paper, the problem of optimizing the energy trading decisions of MG operators (MGOs) is studied using game theory. In the formulated game, each MGO chooses the amount of energy that must be sold immediately or stored for future emergencies, given the prospective market prices which are influenced by other MGOs' decisions. The problem is modeled using a Bayesian game to account for the incomplete information that MGOs have about each others' levels of surplus. The proposed game explicitly accounts for each MGO's subjective decision when faced with the uncertainty of its opponents' energy surplus. In particular, the so-called framing effect, from the framework of prospect theory (PT), is used to account for each MGO's valuation of its gains and losses with respect to an individual utility reference point. The reference point is typically different for each individual and originates from its past experiences and future aspirations. A closed-form expression for the Bayesian Nash equilibrium is derived for the standard game formulation. Under PT, a best response algorithm is proposed to find the equilibrium. Simulation results show that, depending on their individual reference points, MGOs can tend to store more or less energy under PT compared to classical game theory. In addition, the impact of the reference point is found to be more prominent as the emergency price set by the power company increases.","PeriodicalId":102145,"journal":{"name":"2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122266698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 28

A bisimulation-like algorithm for abstracting control systems 一种用于抽象控制系统的双仿真算法

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852282

Andrew J. Wagenmaker, N. Ozay

{"title":"A bisimulation-like algorithm for abstracting control systems","authors":"Andrew J. Wagenmaker, N. Ozay","doi":"10.1109/ALLERTON.2016.7852282","DOIUrl":"https://doi.org/10.1109/ALLERTON.2016.7852282","url":null,"abstract":"Motivated by the recent interest in abstraction-based correct-by-construction control synthesis, in this paper we propose a new algorithm to construct finite abstractions for “large”, possibly infinite, transition systems. As opposed to the standard bisimulation algorithms that create a partition of the state space, the new algorithm uses overlapping subsets of the state space as the states of the abstraction. We show that the output of the new bisimulation-like algorithm preserves realizability of linear-time properties. Several interesting properties of the algorithm are analyzed. In particular, when a finite bisimulation of the original system exists, the new algorithm is shown to always terminate in a finite number of steps. Moreover, we show with an example that even when the original system does not have a finite bisimulation, the new algorithm can result in a finite transition system whose infinite traces are equivalent to those of the original system. In the second part of the paper, we focus on the application of this algorithm to construct finite abstractions for discrete-time linear control systems and discuss several of its advantages over the standard bisimulation algorithm. Finally, the new algorithm is compared to the existing algorithms with some numerical examples.","PeriodicalId":102145,"journal":{"name":"2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121440832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2