{"title":"The maximal coordination principle in regulatory Boolean networks","authors":"Alexis Poindron","doi":"10.1016/j.jcss.2024.103518","DOIUrl":"10.1016/j.jcss.2024.103518","url":null,"abstract":"<div><p>We introduce a coordination index in regulatory Boolean networks and we expose the maximal coordination principle (MCP), according to which a cohesive society reaches the dynamics characterized by the highest coordination index. Based on simple theoretical examples, we show that the MCP can be used to infer the influence graph from opinion dynamics/gene expressions. We provide some algorithms to apply the MCP and we compare the coordination index with existing statistical indexes (likelihood, entropy). The advantage of the coordination approach is its simplicity; in particular, we do not need to impose restrictions on the aggregation functions.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"142 ","pages":"Article 103518"},"PeriodicalIF":1.1,"publicationDate":"2024-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139501327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sayan Bandyapadhyay , Fedor V. Fomin , Kirill Simonov
{"title":"On coresets for fair clustering in metric and Euclidean spaces and their applications","authors":"Sayan Bandyapadhyay , Fedor V. Fomin , Kirill Simonov","doi":"10.1016/j.jcss.2024.103506","DOIUrl":"10.1016/j.jcss.2024.103506","url":null,"abstract":"<div><p>Fair clustering is a constrained clustering problem where we need to partition a set of colored points. The fraction of points of each color in every cluster should be more or less equal to the fraction of points of this color in the dataset. The problem was recently introduced by Chierichetti et al. (2017) <span>[1]</span>. We propose a new construction of coresets for fair clustering for Euclidean and general metrics based on random sampling. For the Euclidean space <span><math><msup><mrow><mi>R</mi></mrow><mrow><mi>d</mi></mrow></msup></math></span>, we provide the first coreset whose size does not depend exponentially on the dimension <em>d</em>. The question of whether such constructions exist was asked by Schmidt et al. (2019) <span>[2]</span> and Huang et al. (2019) <span>[5]</span>. For general metrics, our construction provides the first coreset for fair clustering. New coresets appear to be a handy tool for designing better approximation and streaming algorithms for fair and other constrained clustering variants.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"142 ","pages":"Article 103506"},"PeriodicalIF":1.1,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000024000011/pdfft?md5=8effb294ac14fcc95086200a05194229&pid=1-s2.0-S0022000024000011-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139423640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
James Aspnes (Guest Editor and SAND 2022 Program Chair), Othon Michail
{"title":"Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)","authors":"James Aspnes (Guest Editor and SAND 2022 Program Chair), Othon Michail","doi":"10.1016/j.jcss.2023.103503","DOIUrl":"10.1016/j.jcss.2023.103503","url":null,"abstract":"","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"141 ","pages":"Article 103503"},"PeriodicalIF":1.1,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138493944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data","authors":"Jinyan Su , Jinhui Xu , Di Wang","doi":"10.1016/j.jcss.2023.103496","DOIUrl":"10.1016/j.jcss.2023.103496","url":null,"abstract":"<div><p>In this paper, we study the problem of PAC learning halfspaces in the non-interactive local differential privacy<span> model (NLDP). To breach the barrier of exponential sample complexity, previous results studied a relaxed setting where the server has access to some additional public but unlabeled data. We continue in this direction. Specifically, we consider the problem under the standard setting instead of the large margin setting studied before. Under different mild assumptions on the underlying data distribution, we propose two approaches that are based on the Massart noise model and self-supervised learning and show that it is possible to achieve sample complexities that are only linear in the dimension and polynomial in other terms for both private and public data, which significantly improve the previous results. Our methods could also be used for other private PAC learning problems.</span></p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"141 ","pages":"Article 103496"},"PeriodicalIF":1.1,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138493945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Blackout-tolerant temporal spanners","authors":"Davide Bilò , Gianlorenzo D'Angelo , Luciano Gualà , Stefano Leucci , Mirko Rossi","doi":"10.1016/j.jcss.2023.103495","DOIUrl":"10.1016/j.jcss.2023.103495","url":null,"abstract":"<div><p>We introduce the notions of <em>blackout-tolerant</em> temporal <em>α</em>-spanner of a temporal graph <em>G</em> which is a subgraph of <em>G</em> that preserves the distances between pairs of vertices of interest in <em>G</em> up to a multiplicative factor of <em>α</em>, even when the graph edges at a single time-instant become unavailable. In particular, we consider the <em>single-source</em>, <em>single-pair</em>, and <em>all-pairs</em> cases and, for each case we look at three quality requirements: <em>exact</em> distances (i.e., <span><math><mi>α</mi><mo>=</mo><mn>1</mn></math></span>), <em>almost-exact</em> distances (i.e., <span><math><mi>α</mi><mo>=</mo><mn>1</mn><mo>+</mo><mi>ε</mi></math></span> for an arbitrarily small constant <span><math><mi>ε</mi><mo>></mo><mn>0</mn></math></span>), and <em>connectivity</em> (i.e., unbounded <em>α</em>). We provide almost tight bounds on the <em>size</em> of such spanners for <em>general</em> temporal graphs and for <em>temporal cliques</em>, showing that they are either very sparse (i.e., they have <span><math><mover><mrow><mi>O</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><mi>n</mi><mo>)</mo></math></span> edges) or they must have size <span><math><mi>Ω</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> in the worst case, where <em>n</em> is the number of vertices of <em>G</em>. We also investigate multiple blackouts and <em>k-edge fault-tolerant temporal spanners</em>.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"141 ","pages":"Article 103495"},"PeriodicalIF":1.1,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000023001009/pdfft?md5=35a28914507288d7957b1fcfa27d6087&pid=1-s2.0-S0022000023001009-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138493942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Shenggen Zheng , Yaqiao Li , Minghua Pan , Jozef Gruska , Lvzhou Li
{"title":"Lifting query complexity to time-space complexity for two-way finite automata","authors":"Shenggen Zheng , Yaqiao Li , Minghua Pan , Jozef Gruska , Lvzhou Li","doi":"10.1016/j.jcss.2023.103494","DOIUrl":"10.1016/j.jcss.2023.103494","url":null,"abstract":"<div><p><span><span>Time-space tradeoff has been studied in a variety of models, such as Turing machines, branching programs, and </span>finite automata, etc. While communication complexity as a technique has been applied to study finite automata, it seems it has not been used to study time-space tradeoffs of finite automata. We design a new technique showing that separations of query complexity can be lifted, via communication complexity, to separations of time-space complexity of two-way finite automata. As an application, one of our main results exhibits the first example of a language </span><em>L</em> such that the time-space complexity of two-way probabilistic finite automata with a bounded error (2PFA) is <span><math><mover><mrow><mi>Ω</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span>, while of exact two-way quantum finite automata with classical states (2QCFA) is <span><math><mover><mrow><mi>O</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>5</mn><mo>/</mo><mn>3</mn></mrow></msup><mo>)</mo></math></span><span>, that is, we demonstrate for the first time that exact quantum computing has an advantage in time-space complexity comparing to classical computing.</span></p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"141 ","pages":"Article 103494"},"PeriodicalIF":1.1,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138493943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Corrigendum to “Prediction, learning, uniform convergence, and scale-sensitive dimensions” [J. Comput. Syst. Sci. 56 (2) (1998) 174–190]","authors":"Peter L. Bartlett , Philip M. Long","doi":"10.1016/j.jcss.2023.103465","DOIUrl":"https://doi.org/10.1016/j.jcss.2023.103465","url":null,"abstract":"","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"140 ","pages":"Article 103465"},"PeriodicalIF":1.1,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000023000703/pdfft?md5=5fea357eab14a31f7d2bb2a0d38598ad&pid=1-s2.0-S0022000023000703-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92122518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Flavia Bonomo-Braberman , Nick Brettell , Andrea Munaro , Daniël Paulusma
{"title":"Solving problems on generalized convex graphs via mim-width","authors":"Flavia Bonomo-Braberman , Nick Brettell , Andrea Munaro , Daniël Paulusma","doi":"10.1016/j.jcss.2023.103493","DOIUrl":"https://doi.org/10.1016/j.jcss.2023.103493","url":null,"abstract":"<div><p>A bipartite graph <span><math><mi>G</mi><mo>=</mo><mo>(</mo><mi>A</mi><mo>,</mo><mi>B</mi><mo>,</mo><mi>E</mi><mo>)</mo></math></span> is <span><math><mi>H</mi></math></span>-convex for some family of graphs <span><math><mi>H</mi></math></span> if there exists a graph <span><math><mi>H</mi><mo>∈</mo><mi>H</mi></math></span> with <span><math><mi>V</mi><mo>(</mo><mi>H</mi><mo>)</mo><mo>=</mo><mi>A</mi></math></span> such that the neighbours in <em>A</em> of each <span><math><mi>b</mi><mo>∈</mo><mi>B</mi></math></span> induce a connected subgraph of <em>H</em>. Many <span><math><mi>NP</mi></math></span>-complete problems are polynomial-time solvable for <span><math><mi>H</mi></math></span>-convex graphs when <span><math><mi>H</mi></math></span> is the set of paths. The underlying reason is that the class has bounded mim-width. We extend this result to families of <span><math><mi>H</mi></math></span>-convex graphs where <span><math><mi>H</mi></math></span> is the set of cycles, or <span><math><mi>H</mi></math></span> is the set of trees with bounded maximum degree and a bounded number of vertices of degree at least 3. As a consequence, we strengthen many known results via one general and short proof. We also show that the mim-width of <span><math><mi>H</mi></math></span>-convex graphs is unbounded if <span><math><mi>H</mi></math></span> is the set of trees with arbitrarily large maximum degree or an arbitrarily large number of vertices of degree at least 3.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"140 ","pages":"Article 103493"},"PeriodicalIF":1.1,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000023000983/pdfft?md5=fde8f2dacccba7a95013faa87b835770&pid=1-s2.0-S0022000023000983-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134656790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Haoqiang Huang , Zihe Wang , Zhide Wei , Jie Zhang
{"title":"Bounded incentives in manipulating the probabilistic serial rule","authors":"Haoqiang Huang , Zihe Wang , Zhide Wei , Jie Zhang","doi":"10.1016/j.jcss.2023.103491","DOIUrl":"https://doi.org/10.1016/j.jcss.2023.103491","url":null,"abstract":"<div><p>The Probabilistic Serial mechanism is valued for its fairness and efficiency in addressing the random assignment problem. However, it lacks truthfulness, meaning it works well only when agents' stated preferences match their true ones. Significant utility gains from strategic actions may lead self-interested agents to manipulate the mechanism, undermining its practical adoption. To gauge the potential for manipulation, we explore an extreme scenario where a manipulator has complete knowledge of other agents' reports and unlimited computational resources to find their best strategy. We establish tight incentive ratio bounds of the mechanism. Furthermore, we complement these worst-case guarantees by conducting experiments to assess an agent's average utility gain through manipulation. The findings reveal that the incentive for manipulation is very small. These results offer insights into the mechanism's resilience against strategic manipulation, moving beyond the recognition of its lack of incentive compatibility.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"140 ","pages":"Article 103491"},"PeriodicalIF":1.1,"publicationDate":"2023-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134656791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance modeling and analysis for randomly walking mobile users with Markov chains","authors":"Keqin Li","doi":"10.1016/j.jcss.2023.103492","DOIUrl":"https://doi.org/10.1016/j.jcss.2023.103492","url":null,"abstract":"<div><p>We treat user equipments (UEs) and mobile edge clouds (MECs) as M/G/1 queueing systems, which are the most suitable, powerful, and manageable models. We propose a computation offloading strategy which can satisfy all UEs served by an MEC and develop an efficient method to find such a strategy. We use discrete-time Markov chains, continuous-time Markov chains, and semi-Markov processes to characterize the mobility of UEs, and calculate the joint probability distribution of the locations of UEs at any time. We extend our Markov chains to incorporate mobility cost into consideration, and are able to obtain the average response time of a UE with location change penalty. We can algorithmically predict the overall average response time of tasks generated on a UE and also demonstrate numerical data and examples. We consider the power constrained MEC speed setting problem and develop an algorithm to solve the problem for two power consumption models.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"140 ","pages":"Article 103492"},"PeriodicalIF":1.1,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91987534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}