Searcharxiv⌕ Search

arXiv subjects

Pedro Montealegre

Publications and source records attributed to Pedro Montealegre.

At least 19 recordsLinked to original sources

Lower Bounds for the Distributed Computation of Degeneracy and k-Core

The degeneracy of a graph $G$ is the maximum integer $k$ such that $G$ has a non-empty $k$-core, where the $k$-core is the largest induced subgraph with minimum degree $k$. Computing the $k$-core of a graph $G$ is P-complete. In the decentralized setting, the sequential peeling algorithm can be distributed so that the core value of every node, i.e., the largest integer $k$ for which the node belongs to the $k$-core, is computed in $O(n)$ rounds in $n$-node networks, where adjacent nodes exchange only $O(\log n)$ bits at each round, i.e., in the standard CONGEST model. However, while $Ω(D)$ rounds is a trivial lower bound for these problems in networks of diameter $D$, this does not rule out the existence of an algorithm running in $O(D)+o(n)$ rounds in CONGEST, as it is the case for many very important graph problems, including MST. We show that it is unlikely that such an algorithm exists, or, if it does exist, then it requires $\tildeΩ(\sqrt{n})$ rounds. Specifically, our first main result states that, for any $ε>0$, approximating the degeneracy up to a multiplicative factor $2-ε$ requires $\tildeΩ(\sqrt{n})$ rounds in CONGEST even in networks of diameter $O(\log n)$, and still $\tildeΩ(n^{1/3})$ rounds in networks of constant diameter. We also show that improving this lower bound seems challenging, as we demonstrate that the newer frameworks cannot be used as black boxes to obtain a better lower bound for degeneracy. Our second main result provides a better bound, albeit conditional. It states that, unless the well-known circuit value problem (CVP) admits a parallel polynomial speedup -- an outcome considered unlikely -- it holds that, for every $ε>δ>0$, deciding whether a graph is 2-degenerate cannot be solved in $O(D+ n^{1-ε})$ rounds with $O(n^δ)$-time parallel local computation per round at each node.

cs.DC↗

Tight Bounds for Anonymous Parity Certification

Local certification is the task of verifying graph properties using certificates assigned to vertices and checked using only local information. A central question is which properties admit constant-size certificates, independently of network size. A fundamental test case is the parity of the network order. Bousquet, Feuilloley, Valenzuela, and Zeitoun (DISC 2026) showed that the complexity of certifying even order depends dramatically on the verification model. On arbitrary graphs, three bits per vertex suffice with unique identifiers and verification radius two. In the anonymous radius-one model, they established an $Ω(\log\log^* n)$ lower bound and an $O(\log n)$ upper bound. They also showed that constant-size certificates suffice in this model on bounded-expansion classes. In this paper, we settle the complexity of anonymous parity certification on general graphs and further investigate the role of graph sparsity. Our main contributions are: * We close the gap left by Bousquet et al., proving that the local complexity of certifying even order in the anonymous radius-one model is $Θ(\log\log n)$ bits. * We show that on graphs of degeneracy at most $d$, parity can be certified with $O(\log d)$ bits, while $Ω(\log\log d)$ bits are necessary. In particular, every class of bounded degeneracy admits constant-size certificates, strictly generalizing the result for bounded-expansion classes. * We show that constant-size certification cannot be guaranteed on nowhere-dense classes, a broader notion of sparsity that includes bounded expansion. We construct a fixed, subgraph-closed nowhere-dense class on which parity certification requires $Θ(\log\log n)$ bits. Together, our results provide a more complete picture of anonymous parity certification on sparse graph classes, showing that its complexity depends on the particular structural notion of sparsity.

cs.DC↗

On the Power of Alternating Local Certification with Constant-Size Certificates

We study alternation hierarchies for distributed decision in anonymous networks with constant-size certificates. A prover and a disprover alternately assign certificates to nodes over a constant number of rounds, after which each node decides whether to accept based on its own input and the certificates observed in its neighborhood. An instance is accepted if all nodes accept. Unlike previous work on distributed alternation hierarchies, which considered restricted local computation (Reiter, PODC 2024) or logarithmic-size certificates (Feuilloley et al., ICALP 2016), we focus on constant-size certificates and the role of neighborhood information in determining expressive power. We consider three models: SET, where nodes observe only the set of certificate sequences of their neighbors; MULTISET, where multiplicities are also visible; and PORTS, where neighbors can additionally be distinguished by local port numbers. We establish that SET is strictly weaker than MULTISET, which is in turn strictly weaker than PORTS, and that all three alternation hierarchies are strict at every level. Despite their severe restrictions, these models are remarkably expressive: LEADER belongs to the third level of SET. Our main characterization shows that, over finite input alphabets, SET coincides exactly with monadic second-order logic (MSO$_1$). Moreover, every language definable in counting monadic second-order logic (CMSO$_1$) belongs to PORTS, while MULTISET already contains languages that are not CMSO$_1$-definable. Nevertheless, this expressive power has fundamental limitations. PORTS does not capture MSO$_2$: neither Hamiltonicity nor the existence of a perfect matching belongs to PORTS. Furthermore, over unbounded input alphabets, PORTS cannot verify that every node has been given the correct network size.

cs.DC↗

On the Limits of Quantum Multiparty Simultaneous Communication

We study the relative power of public randomness and quantum communication in the multiparty Simultaneous Message Passing (SMP) model. By analyzing a total Boolean function and a relational problem, we establish polynomial and exponential separations between classical public-coin protocols and quantum protocols without shared randomness or prior entanglement. We first introduce XOR Equality, a total Boolean function in which each of $k$ players receives an unrestricted string $x_j\in\{0,1\}^n$, and the referee must decide whether $x_1\oplus\cdots\oplus x_k=0^n$. For $k\ge8$ and worst-case error at most $1/3$, we prove quantum lower bounds of $Ω(\min\{n,k^2\})$ on total communication and $Ω(\min\{n/k,k\})$ on maximum message length. A classical public-coin protocol uses two bits per player with error at most $1/4$. For $n=k^2$ and worst-case error at most $1/3$, we prove that quantum protocols require maximum message length $Ω(\sqrt n)$ qubits, whereas two public-coin bits per player suffice. We then turn to relations, for which we obtain exponential separations. Specifically, we study Multiparty Index Coordination, a $k$-player generalization of the two-player relation studied by Gavinsky, Kempe, Regev, and de Wolf (STOC 2006). We prove an unambiguous quantum lower bound of $Ω(n^{1-1/k})$ on maximum message length, matched by a classical private-coin protocol. For any fixed error $\varepsilon\in(0,1/8)$, we also prove a bounded-error quantum lower bound of $Ω(n^{(k-1)/(k+1)})$ while we show that public-coin protocols solve the relation unambiguously with maximum message length $O(\log n)$, giving exponential separations in both regimes. The implicit constants are independent of $k$, and both quantum lower bounds become linear when $k\ge c\log n$ for any fixed $c>0$.

cs.CC↗

The Two-Dimensional Majority Rule is P-Complete

We prove that prediction for the synchronous two-dimensional majority rule is $\mathrm{P}$-complete under logspace many-one reductions, resolving a problem open for almost three decades. In 1997, Moore established $\mathrm{P}$-completeness in dimension three and higher and conjectured that the two-dimensional case admits an efficient parallel algorithm. We consider an $n\times n$ torus on which each cell follows the majority of its four nearest neighbors and retains its current state in a tie. Given an explicitly specified initial configuration and a time $T$, prediction asks whether a designated cell is in state $+1$ at time $T$. The central challenge is to make independent information streams cross in the plane under a homogeneous, monotone, diffusive local rule. We overcome this obstacle through a temporal encoding of Boolean values: both values generate activity, but are distinguished by signal arrival times. This encoding yields a crossover that preserves both values and composes with wires, duplication, and AND and OR gates to simulate arbitrary monotone Boolean circuits. Thus a local rule that favors agreement can nevertheless transport, combine, and cross independent information in two dimensions. We also prove $\mathrm{P}$-completeness for deciding whether a designated cell ever reaches $+1$, without a prescribed time horizon. The prediction result extends to every uniform symmetric signed majority rule on the same neighborhood, including the minority rule.

cs.DM↗

Deterministic Distributed DFS and Other Problems via Cycle Separators in Planar Graphs

One of the most basic techniques in algorithm design consists of breaking a problem into subproblems and then proceeding recursively. In the case of graph algorithms, one way to implement this approach is through separator sets. Given a graph $G=(V,E)$, a subset of nodes $S \subseteq V$ is called a separator set of $G$ if the size of each connected component of $G-S$ is at most $2/3 \cdot |V|$. The most useful separator sets are those that satisfy certain restrictions of cardinality or structure. For over 40 years, various efficient algorithms have been developed for computing separators of different kinds, particularly in planar graphs. Separator sets, combined with a divide and conquer approach, have been fundamental in the design of efficient algorithms in various settings. In this work, we present the first deterministic algorithm in the distributed CONGEST model that recursively computes a cycle separator in planar graphs in $\tilde{\mathcal{O}}(D)$ rounds. This result, as in the centralized setting, has significant implications for distributed planar algorithms. In fact, from this result, we can construct a deterministic algorithm that computes a DFS tree in $\tilde{\mathcal{O}}(D)$ rounds. This matches both the best-known randomized algorithm of Ghaffari and Parter (DISC'17) and, up to polylogarithmic factors, the trivial lower bound of $Ω(D)$ rounds. Besides DFS, our deterministic cycle separator algorithm can be used to derandomize several planar-graph algorithms whose only randomized ingredient is the computation of a cycle separator, such as maximum flow (Abd-Elhaleem, Dory, Parter and Weimann, PODC'25), single-source shortest path (Li and Parter, STOC'19), and reachability (Parter, DISC'20).

cs.DC↗

Strong and Hiding Distributed Certification of Bipartiteness

In this paper, we study the problem of certifying whether a graph is bipartite (i.e. $2$-colorable) with a locally checkable proof (LCP) that is able to hide a $2$-coloring from the verifier. More precisely, we say an LCP for $2$-coloring is hiding if, in a yes-instance, it is possible to assign certificates to nodes without revealing an explicit $2$-coloring. Motivated by the search for promise-free separations of extensions of the LOCAL model in the context of locally checkable labeling (LCL) problems, we also require the LCPs to satisfy what we refer to as the strong soundness property. This is a strengthening of soundness that requires that, in a no-instance (i.e., a non-$2$-colorable graph) and for every certificate assignment, the subset of accepting nodes must induce a $2$-colorable subgraph. We show that strong and hiding LCPs for $2$-coloring exist in specific graph classes and requiring only $O(\log n)$-sized certificates. Furthermore, when the input is promised to be a cycle or contains a node of degree $1$, we show the existence of strong and hiding LCPs even in an anonymous network and with constant-size certificates. Despite these upper bounds, we prove that there are no strong and hiding LCPs for $2$-coloring in general, unless the algorithm has access to node identifiers and uses certificates of size~$ω(1)$. Furthermore, in anonymous networks, the lower bound holds regardless of the certificate size. The proof relies on a Ramsey-type result as well as an argument about the realizability of subgraphs of the neighborhood graph consisting of the accepting views of an LCP. Along the way, we also give a characterization of the hiding property for the general $k$-coloring problem that appears to be a key component for future investigations in this context.

cs.DC↗

What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing

The question of 'what can be computed locally?' lies at the heart of distributed computing in networks. As established in Naor and Stockmeyer's seminal paper (STOC 1993), this question is undecidable, even for graph problems whose solutions can be checked locally. In this paper, we adopt a novel perspective on the question, by asking for which classes $Π$ of problems, and for which classes $\mathcal{G}$ of graphs, all problems in $Π$ can be solved efficiently in a distributed manner in all graphs of $\mathcal{G}$. This paper focuses on two natural candidates for such an approach, namely the class of problems expressible in first-order logic (FO), because of their intrinsic form of locality thanks to Gaifman's theorem, and the class of graphs with bounded expansion, because they form a large class of graphs encompassing, e.g., planar, bounded-treewidth, and bounded-degree graphs. The starting point of our work is the decade-old open question of Nešetřil and Ossona de Mendez (Distributed Computing 2016) on the distributed complexity of local FO formula on graphs of bounded expansion, in the standard CONGEST model of distributed computing. A formula $φ(x)$ is local if the satisfaction of $φ(x)$ depends only on the $r$-neighborhood of its free variable $x$, for some fixed $r$. For instance, the formula '$x$ belongs to a triangle' is local. We resolve the open problem positively by showing that, for every local FO formula $φ(x)$, and for every graph class $\mathcal{G}$ of bounded expansion, there exists a deterministic algorithm that identifies, for every $n$-vertex graph $G\in \mathcal{G}$, all vertices $v$ of $G$ such that $G\models φ(v)$, in $O(\log n)$ rounds. When dropping the locality condition, we show that $O(D+\log n)$ rounds are sufficient for deciding any FO formula $φ$ on graphs of bounded expansion.

cs.DS↗

On the complexity of freezing automata networks of bounded pathwidth

An automata network is a graph of entities, each holding a state from a finite set and evolving according to a local update rule which depends only on its neighbors in the network's graph. It is freezing if there is an order on the states such that the state evolution of any node is non-decreasing in any orbit. They are commonly used to model epidemic propagation, diffusion phenomena like bootstrap percolation or cristal growth. Previous works have established that, under the hypothesis that the network graph is of bounded treewidth, many problems that can be captured by trace specifications at individual nodes admit efficient algorithms. In this paper we study the even more restricted case of a network of bounded pathwidth and show two hardness results that somehow illustrate the complexity of freezing dynamics under such a strong graph constraint. First, we show that the trace specification checking problem is NL-complete. Second, we show that deciding first order properties of the orbits augmented with a reachability predicate is NP-hard.

cs.CC↗

Recognizing Hereditary Properties in the Presence of Byzantine Nodes

Augustine et al. [DISC 2022] initiated the study of distributed graph algorithms in the presence of Byzantine nodes in the congested clique model. In this model, there is a set $B$ of Byzantine nodes, where $|B|$ is less than a third of the total number of nodes. These nodes have complete knowledge of the network and the state of other nodes, and they conspire to alter the output of the system. The authors addressed the connectivity problem, showing that it is solvable under the promise that either the subgraph induced by the honest nodes is connected, or the graph has $2|B|+1$ connected components. In the current work, we continue the study of the Byzantine congested clique model by considering the recognition of other graph properties, specifically hereditary properties. A graph property is hereditary if it is closed under taking induced subgraphs. Examples of hereditary properties include acyclicity, bipartiteness, planarity, and bounded (chromatic, independence) number, etc. For each class of graphs ${\bf G}$ satisfying a hereditary property (a hereditary graph-class), we propose a randomized algorithm which, with high probability, (1) accepts if the input graph $G$ belongs to ${\bf G}$, and (2) rejects if $G$ contains at least $|B| + 1$ disjoint subgraphs not belonging to ${\bf G}$. The round complexity of our algorithm is $$O\left(\left(\dfrac{\log \left(\left|{\bf G}_n\right|\right)}{n} +|B|\right)\cdot\textrm{polylog}(n)\right),$$ where ${\bf G}_n$ is the set of $n$-node graphs in ${\bf G}$. Finally, we obtain an impossibility result that proves that our result is tight. Indeed, we consider the hereditary class of acyclic graphs, and we prove that there is no algorithm that can distinguish between a graph being acyclic and a graph having $|B|$ disjoint cycles.

cs.DC↗

Complexity of the Freezing Majority Rule with L-shaped Neighborhoods

In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states $\{-1,+1\}$, where the local interactions are based on an L-shaped neighborhood structure. In these automata, once a cell reaches state $+1$, it remains fixed in that state forever, while cells in state $-1$ update to the most represented state among their neighborhoods. We consider L-shaped neighborhoods, which mean that the vicinity of a given cell $c$ consists in a subset of cells in the north and east of $c$. We focus on the prediction problem, a decision problem that involves determining the state of a given cell after a given number of time-steps. We prove that when restricted to the simplest L-shaped neighborhood, consisting of the central cell and its nearest north and east neighbors, the prediction problem belongs to $\mathsf{NC}$, meaning it can be solved efficiently in parallel. We generalize this result for any L-shaped neighborhood of size two. On the other hand, for other L-shaped neighborhoods, the problem becomes $\mathsf{P}$-complete, indicating that the problem might be inherently sequential.

cs.CC↗

Distributed Treewidth Computation and Courcelle's Theorem in the CONGEST Model

Algorithmic meta-theorems, stating that graph properties expressible in some particular logic can be decided efficiently in graph classes having some specific structural properties, are now standard in sequential graph algorithms. One of the most classic examples is Courcelle's theorem: all properties expressible in Monadic Second-Order logic (MSO) are decidable in linear time in graphs of bounded treewidth. We provide here a distributed version of Courcelle's theorem, in the standard CONGEST model for distributed computing: For any MSO formula $φ$ and any constant $k$, there is a CONGEST algorithm that, given an input communication network $G$ of treewidth at most $k$ and of diameter $D$, decides if $G$ satisfies property $φ$ in $\tilde O(D)$ rounds. Simple examples show that the dependency on $D$ is unavoidable. Also, if we drop the assumption of bounded treewidth, deciding MSO properties such as 3-colorability are known to require $\tildeΩ(n^2)$ rounds in the CONGEST model. Our results extend to optimization problems (e.g., computing a maximum size independent set, or a minimum dominating set) and counting (e.g. triangle counting). As usual, the $\tilde{O}$ notation hides polylogarithmic factors in $n$; here it also hides a constant factor depending on $k$ and on the MSO formula $φ$. We also give a distributed algorithm producing a linear approximation for treewidth: For any $k$, it decides that the treewidth of the input network $G$ is larger than $k$ or computes a tree decomposition of width $O(k)$ and depth $O(\log n)$, in $\tilde O(k^{O(k)} D)$ rounds in CONGEST. Our algorithms make use of the low-congestion shortcuts framework introduced by Ghaffari and Haeupler [SODA 2016], and our main technical tool is an $\tilde O(k^4 D)$ algorithm for computing $(s,t)$-vertex separators of size at most $k+1$ in graphs of treewidth at most $k$.

cs.DS↗

Dynamical Stability of Threshold Networks over Undirected Signed Graphs

This paper, we explore the dynamics of threshold networks on undirected signed graphs. Much attention has been dedicated to understanding the convergence and long-term behavior of this model. Yet, an open question persists: How does the underlying graph structure impact network dynamics? Similar studies have been carried out for threshold networks and other types of Boolean networks, but the latter primarily focus on unsigned networks. Here, we address this question in the context of signed threshold networks. We introduce the stability index of a signed graph, related to the concepts of antibalance in signed graphs. Our index establishes a connection between the structure and the dynamics of signed threshold networks. We show that signed graphs having a negative stability index on every induced subgraph exhibit stable dynamics, i.e., the dynamics converge to fixed points regardless of their threshold parameters. Conversely, if at least one induced subgraph has a non-negative stability index, oscillations in long-term behavior may appear. Furthermore, we generalize the analysis to network dynamics under periodic update schemes.

cs.DM↗

Distributed Model Checking on Graphs of Bounded Treedepth

We establish that every monadic second-order logic (MSO) formula on graphs with bounded treedepth is decidable in a constant number of rounds within the CONGEST model. To our knowledge, this marks the first meta-theorem regarding distributed model-checking. Various optimization problems on graphs are expressible in MSO. Examples include determining whether a graph $G$ has a clique of size $k$, whether it admits a coloring with $k$ colors, whether it contains a graph $H$ as a subgraph or minor, or whether terminal vertices in $G$ could be connected via vertex-disjoint paths. Our meta-theorem significantly enhances the work of Bousquet et al. [PODC 2022], which was focused on distributed certification of MSO on graphs with bounded treedepth. Moreover, our results can be extended to solving optimization and counting problems expressible in MSO, in graphs of bounded treedepth.

cs.DS↗

The Hardness of Local Certification of Finite-State Dynamics

Finite-State Dynamics (FSD) is one of the simplest and constrained distributed systems. An FSD is defined by an $n$-node network, with each node maintaining an internal state selected from a finite set. At each time-step, these nodes synchronously update their internal states based solely on the states of their neighboring nodes. Rather than focusing on specific types of local functions, in this article, our primary focus is on the problem of determining the maximum time required for an FSD to reach a stable global state. This global state can be seen as the acceptance state or as the output of a distributed computation. For fixed $k$ and $q$, we define the problem $\text{convergence}(k,q)$, which consists of deciding if a $q$-state FSD converges in at most $k$ time-steps. Our main focus is to study the problem $\text{convergence}$ from the perspective of distributed certification, with a focus on the model of proof-labeling schemes (PLS). First, we study the problem $\text{convergence}$ on arbitrary graphs and show that every PLS has certificates of size $Θ(n^2)$ (up to logarithmic factors). Then, we turn to the restriction of the problem on graphs of maximum degree $Δ$. Roughly, we show that the problem admits a PLS with certificates of size $Δ^{k+1}$, while every PLS requires certificates of size at least $2^{k/6} \cdot 6/k$ on graphs of maximum degree 3.

cs.DC↗

Local Certification of Some Geometric Intersection Graph Classes

In the context of distributed certification, the recognition of graph classes has started to be intensively studied. For instance, different results related to the recognition of planar, bounded tree-width and $H$-minor free graphs have been recently obtained. The goal of the present work is to design compact certificates for the local recognition of relevant geometric intersection graph classes, namely interval, chordal, circular arc, trapezoid and permutation. More precisely, we give proof labeling schemes recognizing each of these classes with logarithmic-sized certificates. We also provide tight logarithmic lower bounds on the size of the certificates on the proof labeling schemes for the recognition of any of the aforementioned geometric intersection graph classes.

cs.DC↗

Local Certification of Majority Dynamics

In majority voting dynamics, a group of $n$ agents in a social network are asked for their preferred candidate in a future election between two possible choices. At each time step, a new poll is taken, and each agent adjusts their vote according to the majority opinion of their network neighbors. After $T$ time steps, the candidate with the majority of votes is the leading contender in the election. In general, it is very hard to predict who will be the leading candidate after a large number of time-steps. We study, from the perspective of local certification, the problem of predicting the leading candidate after a certain number of time-steps, which we call Election-Prediction. We show that in graphs with sub-exponential growth Election-Prediction admits a proof labeling scheme of size $\mathcal{O}(\log n)$. We also find non-trivial upper bounds for graphs with a bounded degree, in which the size of the certificates are sub-linear in $n$. Furthermore, we explore lower bounds for the unrestricted case, showing that locally checkable proofs for Election-Prediction on arbitrary $n$-node graphs have certificates on $Ω(n)$ bits. Finally, we show that our upper bounds are tight even for graphs of constant growth.

cs.DC↗

Distributed Certification for Classes of Dense Graphs

A proof-labeling scheme (PLS) for a boolean predicate $Π$ on labeled graphs is a mechanism used for certifying the legality with respect to $Π$ of global network states in a distributed manner. In a PLS, a certificate is assigned to each processing node of the network, and the nodes are in charge of checking that the collection of certificates forms a global proof that the system is in a correct state, by exchanging the certificates once, between neighbors only. The main measure of complexity is the size of the certificates. Many PLSs have been designed for certifying specific predicates, including cycle-freeness, minimum-weight spanning tree, planarity, etc. In 2021, a breakthrough has been obtained, as a meta-theorem stating that a large set of properties have compact PLSs in a large class of networks. Namely, for every $\mathrm{MSO}_2$ property $Π$ on labeled graphs, there exists a PLS for $Π$ with $O(\log n)$-bit certificates for all graphs of bounded tree-depth. This result has been extended to the larger class of graphs with bounded {tree-width}, using certificates on $O(\log^2 n)$ bits. We extend this result even further, to the larger class of graphs with bounded clique-width, which, as opposed to the other two aforementioned classes, includes dense graphs. We show that, for every $\mathrm{MSO}_1$ property $Π$ on labeled graphs, there exists a PLS for $Π$ with $O(\log^2 n)$ bit certificates for all graphs of bounded clique-width.

cs.DC↗