IA Scholar Query: Identity orientation of complete bipartite graphs.
https://scholar.archive.org/
Internet Archive Scholar query results feedeninfo@archive.orgThu, 01 Dec 2022 00:00:00 GMTfatcat-scholarhttps://scholar.archive.org/help1440Early cephalopod evolution clarified through Bayesian phylogenetic inference
https://scholar.archive.org/work/tw43rrpbfnht3oezkik4aculc4
Despite the excellent fossil record of cephalopods, their early evolution is poorly understood. Different, partly incompatible phylogenetic hypotheses have been proposed in the past, which reflected individual author's opinions on the importance of certain characters but were not based on thorough cladistic analyses. At the same time, methods of phylogenetic inference have undergone substantial improvements. For fossil datasets, which typically only include morphological data, Bayesian inference and in particular the introduction of the fossilized birth-death model have opened new possibilities. Nevertheless, many tree topologies recovered from these new methods reflect large uncertainties, which have led to discussions on how to best summarize the information contained in the posterior set of trees. Results We present a large, newly compiled morphological character matrix of Cambrian and Ordovician cephalopods to conduct a comprehensive phylogenetic analysis and resolve existing controversies. Our results recover three major monophyletic groups, which correspond to the previously recognized Endoceratoidea, Multiceratoidea, and Orthoceratoidea, though comprising slightly different taxa. In addition, many Cambrian and Early Ordovician representatives of the Ellesmerocerida and Plectronocerida were recovered near the root. The Ellesmerocerida is para-and polyphyletic, with some of its members recovered among the Multiceratoidea and early Endoceratoidea. These relationships are robust against modifications of the dataset. While our trees initially seem to reflect large uncertainties, these are mainly a consequence of the way clade support is measured. We show that clade posterior probabilities and tree similarity metrics often underestimate congruence between trees, especially if wildcard taxa are involved. Conclusions Our results provide important insights into the earliest evolution of cephalopods and clarify evolutionary pathways. We provide a classification scheme that is based on a robust phylogenetic analysis. Moreover, we provide some general insights on the application of Bayesian phylogenetic inference on morphological datasets. We support earlier findings that quartet similarity metrics should be preferred over the Robinson-Foulds distance when higher-level phylogenetic relationships are of interest and propose that using a posteriori pruned maximum clade credibility trees help in assessing support for phylogenetic relationships among a set of relevant taxa, because they provide clade support values that better reflect the phylogenetic signal.Alexander Pohle, Björn Kröger, Rachel C M Warnock, Andy H King, David H Evans, Martina Aubrechtová, Marcela Cichowolski, Xiang Fang, Christian Klugwork_tw43rrpbfnht3oezkik4aculc4Thu, 01 Dec 2022 00:00:00 GMTApproach for Solving Project Assignment with Bicriterion
https://scholar.archive.org/work/blc5gv4on5c55a6isrjedaovp4
Assigning the right member to the most suitable position is key to the success of a project, and this task has been commonly executed by the project manager based on personal judgment in practice. This paper proposes a matching approach coupled with a revised Hungarian algorithm for optimizing the cost-time project assignment problem. The approach iteratively searches for the augmenting path concerning the current matching rather than solving the entire problem repeatedly. This unique feature greatly reduces the computation efforts. Problems of different sizes and sample ranges are simulated using the proposed technique and G&N's method. Results show that the presented algorithm excels the previous approach in not only producing a lower bound for the project time but also in reaching the optimal solution using much less computing time.Ding-Tsair Chang, Hsien-Hong Lin, Su-Hui Chen, Chiu-Chi Weiwork_blc5gv4on5c55a6isrjedaovp4Thu, 01 Sep 2022 00:00:00 GMTNonlocal correlations in noisy multiqubit systems simulated using matrix product operators
https://scholar.archive.org/work/jgp62ly25ja3tj57qz6igw4bau
We introduce an open-source solver for the Lindblad master equation, based on matrix product states and matrix product operators. Using this solver we study the dynamics of tens of interacting qubits with different connectivities, focusing on a problem where an edge qubit is being continuously driven on resonance, which is a fundamental operation in quantum devices. Because of the driving, induced quasiparticles propagate through the qubits until the system reaches a steady state due to the incoherent terms. We find that with alternating-frequency qubits whose interactions with their off-resonant neighbors appear weak, the tunneling quasiparticles lead to large correlations between distant qubits in the system. Some two-qubit correlation functions are found to increase as a function of distance in the system (in contrast to the typical decay with distance), peaking on the two edge qubits farthest apart from each other.H. Landa, G. Misguichwork_jgp62ly25ja3tj57qz6igw4bauThu, 11 Aug 2022 00:00:00 GMTTheoretically and Practically Efficient Parallel Nucleus Decomposition
https://scholar.archive.org/work/ewlqxa6ey5ai5cyw3u4nqtao2i
This paper studies the nucleus decomposition problem, which has been shown to be useful in finding dense substructures in graphs. We present a novel parallel algorithm that is efficient both in theory and in practice. Our algorithm achieves a work complexity matching the best sequential algorithm while also having low depth (parallel running time), which significantly improves upon the only existing parallel nucleus decomposition algorithm (Sariyuce et al., PVLDB 2018). The key to the theoretical efficiency of our algorithm is the use of a theoretically-efficient parallel algorithms for clique listing and bucketing. We introduce several new practical optimizations, including a new multi-level hash table structure to store information on cliques space-efficiently and a technique for traversing this structure cache-efficiently. On a 30-core machine with two-way hyper-threading on real-world graphs, we achieve up to a 55x speedup over the state-of-the-art parallel nucleus decomposition algorithm by Sariyuce et al., and up to a 40x self-relative parallel speedup. We are able to efficiently compute larger nucleus decompositions than prior work on several million-scale graphs for the first time.Jessica Shi, Laxman Dhulipala, Julian Shunwork_ewlqxa6ey5ai5cyw3u4nqtao2iThu, 11 Aug 2022 00:00:00 GMTTrace Moments of the Sample Covariance Matrix with Graph-Coloring
https://scholar.archive.org/work/73cpada6uvbkxj6eff2crgq2te
Let S_p,n denote the sample covariance matrix based on n independent identically distributed p-dimensional random vectors in the null-case. The main result of this paper is an expansion of trace moments and power-trace covariances of S_p,n simultaneously for both high- and low-dimensional data. To this end we develop a graph theory oriented ansatz of describing trace moments as weighted sums over colored graphs. Specifically, explicit formulas for the highest order coefficients in the expansion are deduced by restricting attention to graphs with either no or one cycle. The novelty is a color-preserving decomposition of graphs into a tree-structure and their seed graphs, which allows for the identification of Euler circuits from graphs with the same tree-structure but different seed graphs. This approach may also be used to approximate the mean and covariance to even higher degrees of accuracy.Ben Deitmarwork_73cpada6uvbkxj6eff2crgq2teWed, 10 Aug 2022 00:00:00 GMTCombinatorial problems in programming quantum annealers
https://scholar.archive.org/work/k7n457txgzbqdpkaexxq34nfd4
Bevor auf einer Quanten-Annealing-Maschine, wie der der Firma D-Wave Systems Inc., Berechnungen durchgeführt werden können, sind zwei grundlegende Schritte notwendig, um das Originalproblem in ein Format zu übertragen, das von solchen Maschinen gelöst werden kann: Als Erstes muss ein mit dem Problem assoziierter Graph in den speziellen Hardwaregraphen eingebettet werden und als Zweites müssen die Parameter des eingebetteten Problems entsprechend weiterer Hardwarerestriktionen gewählt werden, sodass die Lösungen des eingebetteten Problems beweisbar äquivalent zu den ursprünglichen Lösungen sind. Diese Doktorarbeit adressiert graphentheoretische Fragestellungen und kombinatorische Optimierungsprobleme, die bei der genaueren Betrachtung beider Schritte auftreten. Im ersten Teil dieser Arbeit analysieren wir die Komplexität des Einbettungsproblems im Quanten- Annealing-Kontext, das heißt für Chimera- und Pegasus-Hardwaregraphen mit zum Teil nicht nutzbaren, "defekten" Qubits. Wir beweisen die Schwere des Hamiltonkreisproblems, einem Spezialfall des Einbettungsproblems, in solchen Graphen durch die Konstruktion defekter Chimera-Graphen aus speziellen Graphen, für welche die Schwere des Problems bereits bekannt ist. Da der Chimera- ein Subgraph des Pegasus-Graphen ist, können wir das Resultat auf letzteren übertragen. Ein weiterer Spezialfall ist die Einbettung eines vollständigen Graphen, welcher ein universelles Template für die Einbettung von beliebigen Graphen mit einer kleineren oder gleich großen Zahl an Knoten darstellt. Durch die Formulierung als Matchingproblem mit zusätzlichen linearen Nebenbedingungen können wir zeigen, dass das Problem eingeschränkt auf die sich natürlich ergebende Einbettungsstruktur "fixed-parameter tractable" ist, wenn wir die Zahl der defekten Qubits im Chimera-Graphen als Parameter betrachten. Wir vergleichen unser Verfahren mit vorherigen, heuristischen Ansätzen auf verschiedenen, zufällig generierten defekten Hardwaregraphen. Dabei können wir einen Vorteil unserer Methode gegenüber d [...]Elisabeth Lobe, Universitäts- Und Landesbibliothek Sachsen-Anhalt, Martin-Luther Universität, Volker Kaibelwork_k7n457txgzbqdpkaexxq34nfd4Wed, 10 Aug 2022 00:00:00 GMTSpinorial Games and Synaptic Economics
https://scholar.archive.org/work/owy6xa2v3bcx3muopa5kiug5hm
A theoretical framework, yielding projections from the study of the human universe onto the study of the self-organizing brain, is herein presented. On the grounds of (hyper-)self-duality under (hyper-)mirror supersymmetry, relativistic principles are introduced, whose consolidation, as pillars of a network- and game-theoretical construction, allows one to address certain concerns raised in Urai et al. Nat. Neurosci. 25 11-19 (2022), namely (1) the extent to which neural codes are low-dimensional; (2) the functional role of "dark matter" in neuronal circuits; (3) the challenge to traditional theoretical frameworks posed by large-scale neural recordings linking brain and behavior. An early crystallization of multidimensional synaptic (co-)architectures underlying spontaneous (co-)behavioral states is ultimately attained, whereby Lorentz (co-)partitions are in principle verifiable.Sofia Karamintziouwork_owy6xa2v3bcx3muopa5kiug5hmTue, 09 Aug 2022 00:00:00 GMTDeep Patch Visual Odometry
https://scholar.archive.org/work/tyrtetqaobajvgmahetmk7rfg4
We propose Deep Patch Visual Odometry (DPVO), a new deep learning system for monocular Visual Odometry (VO). DPVO is accurate and robust while running at 2x-5x real-time speeds on a single RTX-3090 GPU using only 4GB of memory. We perform evaluation on standard benchmarks and outperform all prior work (classical or learned) in both accuracy and speed. Code is available at https://github.com/princeton-vl/DPVO.Zachary Teed, Lahav Lipson, Jia Dengwork_tyrtetqaobajvgmahetmk7rfg4Mon, 08 Aug 2022 00:00:00 GMTCombinatorial Optimization via the Sum of Squares Hierarchy
https://scholar.archive.org/work/ksux7wlwmndldojrnagqqkvcdu
We study the Sum of Squares (SoS) Hierarchy with a view towards combinatorial optimization. We survey the use of the SoS hierarchy to obtain approximation algorithms on graphs using their spectral properties. We present a simplified proof of the result of Feige and Krauthgamer on the performance of the hierarchy for the Maximum Clique problem on random graphs. We also present a result of Guruswami and Sinop that shows how to obtain approximation algorithms for the Minimum Bisection problem on low threshold-rank graphs. We study inapproximability results for the SoS hierarchy for general constraint satisfaction problems and problems involving graph densities such as the Densest k-subgraph problem. We improve the existing inapproximability results for general constraint satisfaction problems in the case of large arity, using stronger probabilistic analyses of expansion of random instances. We examine connections between constraint satisfaction problems and density problems on graphs. Using them, we obtain new inapproximability results for the hierarchy for the Densest k-subhypergraph problem and the Minimum p-Union problem, which are proven via reductions. We also illustrate the relatively new idea of pseudocalibration to construct integrality gaps for the SoS hierarchy for Maximum Clique and Max K-CSP. The application to Max K-CSP that we present is known in the community but has not been presented before in the literature, to the best of our knowledge.Goutham Rajendranwork_ksux7wlwmndldojrnagqqkvcduMon, 08 Aug 2022 00:00:00 GMTA Survey on Non-Geostationary Satellite Systems: The Communication Perspective
https://scholar.archive.org/work/gfzgk7gienfrjgn3pm4hrztboq
The next phase of satellite technology is being characterized by a new evolution in non-geostationary orbit (NGSO) satellites, which conveys exciting new communication capabilities to provide non-terrestrial connectivity solutions and to support a wide range of digital technologies from various industries. NGSO communication systems are known for a number of key features such as lower propagation delay, smaller size, and lower signal losses in comparison to the conventional geostationary orbit (GSO) satellites, which can potentially enable latency-critical applications to be provided through satellites. NGSO promises a substantial boost in communication speed and energy efficiency, and thus, tackling the main inhibiting factors of commercializing GSO satellites for broader utilization. The promised improvements of NGSO systems have motivated this paper to provide a comprehensive survey of the state-of-the-art NGSO research focusing on the communication prospects, including physical layer and radio access technologies along with the networking aspects and the overall system features and architectures. Beyond this, there are still many NGSO deployment challenges to be addressed to ensure seamless integration not only with GSO systems but also with terrestrial networks. These unprecedented challenges are also discussed in this paper, including coexistence with GSO systems in terms of spectrum access and regulatory issues, satellite constellation and architecture designs, resource management problems, and user equipment requirements. Finally, we outline a set of innovative research directions and new opportunities for future NGSO research.Hayder Al-Hraishawi, Houcine Chougrani, Steven Kisseleff, Eva Lagunas, Symeon Chatzinotaswork_gfzgk7gienfrjgn3pm4hrztboqSun, 07 Aug 2022 00:00:00 GMTThe impact of gene sequence alignment and gene tree estimation error on summary-based species network estimation
https://scholar.archive.org/work/z7f34cvcozfprkin35fvji6fva
Thanks in part to rapid advances in next-generation sequencing technologies, recent phylogenomic studies have demonstrated the pivotal role that non-tree-like evolution plays in many parts of the Tree of Life -the evolutionary history of all life on Earth. As such, the Tree of Life is not necessarily a tree at all, but is better described by more general graph structures such as a phylogenetic network. Another key ingredient in these advances consists of the computational methods needed for reconstructing phylogenetic networks from large-scale genomic sequence data. But virtually all of these methods either require multiple sequence alignments (MSAs) as input or utilize gene trees or other inputs that are computed using MSAs. All of the input MSAs and gene trees must be estimated on empirical data. The methods themselves do not directly account for upstream estimation error, and, apart from prior studies of phylogenetic tree reconstruction and anecdotal evidence, little is understood about the impact of estimated MSA and gene tree error on downstream species network reconstruction. We therefore undertake a performance study to quantify the impact of MSA error and gene tree error on state-of-the-art phylogenetic network inference methods. Our study utilizes synthetic benchmarking data as well as genomic sequence data from mosquito and yeast. We find that upstream MSA and gene tree estimation error can have first-order effects on the accuracy of downstream network reconstruction and, to a lesser extent, its computational runtime. The effects become more pronounced on more challenging datasets with greater evolutionary divergence and more sampled taxa. Our findings highlight an important need for computational methods development: namely, scalable methods are needed to account for estimated MSA and gene tree error when reconstructing phylogenetic networks using unaligned biomolecular sequence data.Meijun Gao, Wei Wang, Kevin J. Liuwork_z7f34cvcozfprkin35fvji6fvaSun, 07 Aug 2022 00:00:00 GMTComputing higher graph gonality is hard
https://scholar.archive.org/work/ynlzrl6mdzdgzc42ycinnzknlq
In the theory of divisors on multigraphs, the r^th divisorial gonality of a graph is the minimum degree of a rank r divisor on that graph. It was proved by Gijswijt et al. that the first divisorial gonality of a finite graph is NP-hard to compute. We generalize their argument to prove that it is NP-hard to compute the r^th divisorial gonality of a finite graph for all r. We use this result to prove that it is NP-hard to compute r^th stable divisorial gonality for a finite graph, and to compute r^th divisorial gonality for a metric graph. We also prove these problems are APX-hard, and we study the NP-completeness of these problems.Ralph Morrison, Lucas Tolleywork_ynlzrl6mdzdgzc42ycinnzknlqSat, 06 Aug 2022 00:00:00 GMTLozenge tilings and the Gaussian free field on a cylinder
https://scholar.archive.org/work/trhk4anxwzfd5eqfqo3laylr3a
We use the periodic Schur process, introduced in arXiv:math/0601019v1, to study the random height function of lozenge tilings (equivalently, dimers) on an infinite cylinder distributed under two variants of the q^vol measure. Under the first variant, corresponding to random cylindric partitions, the height function converges to a deterministic limit shape and fluctuations around it are given by the Gaussian free field in the conformal structure predicted by the Kenyon-Okounkov conjecture. Under the second variant, corresponding to an unrestricted dimer model on the cylinder, the fluctuations are given by the same Gaussian free field with an additional discrete Gaussian shift component. Fluctuations of the latter type have been previously conjectured for dimer models on planar domains with holes.Andrew Ahn, Marianna Russkikh, Roger Van Peskiwork_trhk4anxwzfd5eqfqo3laylr3aSat, 06 Aug 2022 00:00:00 GMTCompletion and Embedding Problems for Combinatorial Designs
https://scholar.archive.org/work/cvk2kik2b5artcfkh2dp3g3gei
Combinatorial design theory studies arrangements and combinations of discrete objects according to different rules. Applications of designs are not only limited to analysis of experiments, but also useful in network analysis, cryptography and communication protocols, error correcting codes, mathematical biology, algorithm design, tournament scheduling, lotteries, etc. The topic of when a partial combinatorial design can be completed or embedded has attracted a great deal of interest over the years. In this thesis, we investigate four topics related to the completion or embedding of partial H-designs. We make progress on partial Steiner triple systems, partial block designs and partial star designs.AJANI RUWANDHIKA CHULANGI DE VAS GUNASEKARAwork_cvk2kik2b5artcfkh2dp3g3geiSat, 06 Aug 2022 00:00:00 GMTAlmost Consistent Systems of Linear Equations
https://scholar.archive.org/work/4ktke6denbdqbmcnglhojd3t7e
Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied equations. This problem is NP-hard and UGC-hard to approximate within any constant even for two-variable equations over the two-element field. We study this problem from the point of view of parameterized complexity, with the parameter being the number of unsatisfied equations. We consider equations defined over Euclidean domains - a family of commutative rings that generalize finite and infinite fields including the rationals, the ring of integers, and many other structures. We show that if every equation contains at most two variables, the problem is fixed-parameter tractable. This generalizes many eminent graph separation problems such as Bipartization, Multiway Cut and Multicut parameterized by the size of the cutset. To complement this, we show that the problem is W[1]-hard when three or more variables are allowed in an equation, as well as for many commutative rings that are not Euclidean domains. On the technical side, we introduce the notion of important balanced subgraphs, generalizing important separators of Marx [Theor. Comput. Sci. 2006] to the setting of biased graphs. Furthermore, we use recent results on parameterized MinCSP [Kim et al., SODA 2021] to efficiently solve a generalization of Multicut with disjunctive cut requests.Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlströmwork_4ktke6denbdqbmcnglhojd3t7eThu, 04 Aug 2022 00:00:00 GMTSiamese Object Tracking for Unmanned Aerial Vehicle: A Review and Comprehensive Analysis
https://scholar.archive.org/work/l3ilcg4psbdbfdhxvtx5zrz2iy
Unmanned aerial vehicle (UAV)-based visual object tracking has enabled a wide range of applications and attracted increasing attention in the field of intelligent transportation systems because of its versatility and effectiveness. As an emerging force in the revolutionary trend of deep learning, Siamese networks shine in UAV-based object tracking with their promising balance of accuracy, robustness, and speed. Thanks to the development of embedded processors and the gradual optimization of deep neural networks, Siamese trackers receive extensive research and realize preliminary combinations with UAVs. However, due to the UAV's limited onboard computational resources and the complex real-world circumstances, aerial tracking with Siamese networks still faces severe obstacles in many aspects. To further explore the deployment of Siamese networks in UAV-based tracking, this work presents a comprehensive review of leading-edge Siamese trackers, along with an exhaustive UAV-specific analysis based on the evaluation using a typical UAV onboard processor. Then, the onboard tests are conducted to validate the feasibility and efficacy of representative Siamese trackers in real-world UAV deployment. Furthermore, to better promote the development of the tracking community, this work analyzes the limitations of existing Siamese trackers and conducts additional experiments represented by low-illumination evaluations. In the end, prospects for the development of Siamese tracking for UAV-based intelligent transportation systems are deeply discussed. The unified framework of leading-edge Siamese trackers, i.e., code library, and the results of their experimental evaluations are available at https://github.com/vision4robotics/SiameseTracking4UAV .Changhong Fu, Kunhan Lu, Guangze Zheng, Junjie Ye, Ziang Cao, Bowen Li, Geng Luwork_l3ilcg4psbdbfdhxvtx5zrz2iyWed, 03 Aug 2022 00:00:00 GMTDelocalization of the height function of the six-vertex model
https://scholar.archive.org/work/qpnfoslfpnftfjuz54unenql2i
We show that the height function of the six-vertex model, in the parameter range 𝐚=𝐛=1 and 𝐜≥1, is delocalized with logarithmic variance when 𝐜≤ 2. This complements the earlier proven localization for 𝐜>2. Our proof relies on Russo–Seymour–Welsh type arguments, and on the local behaviour of the free energy of the cylindrical six-vertex model, as a function of the unbalance between the number of up and down arrows.Hugo Duminil-Copin, Alex Karrila, Ioan Manolescu, Mendes Oulamarawork_qpnfoslfpnftfjuz54unenql2iTue, 02 Aug 2022 00:00:00 GMTEntanglement dynamics and phase transitions of the Floquet cluster spin chain
https://scholar.archive.org/work/adwqcp2gang5pl7uykxzhjvhtq
Cluster states were introduced in the context of measurement based quantum computing. In one dimension, the cluster Hamiltonian possesses topologically protected states. We investigate the Floquet dynamics of the cluster spin chain in an external field, interacting with a particle. We explore the entanglement properties of the topological and magnetic phases, first in the integrable spin lattice case, and then in the interacting quantum walk case. We find, in addition to thermalization, dynamical phase transitions separating low and high entangled nonthermal states, reminiscent of the ones present in the integrable case, but differing in their magnetic properties.Alberto D. Vergawork_adwqcp2gang5pl7uykxzhjvhtqTue, 02 Aug 2022 00:00:00 GMTQuantum Computing: Lecture Notes
https://scholar.archive.org/work/2pcfo6u7jzg25alp6mv6fq3w2y
This is a set of lecture notes suitable for a Master's course on quantum computation and information from the perspective of theoretical computer science. The first version was written in 2011, with many extensions and improvements in subsequent years. The first 10 chapters cover the circuit model and the main quantum algorithms (Deutsch-Jozsa, Simon, Shor, Hidden Subgroup Problem, Grover, quantum walks, Hamiltonian simulation and HHL). They are followed by 3 chapters about complexity, 4 chapters about distributed ("Alice and Bob") settings, a chapter about quantum machine learning, and a final chapter about quantum error correction. Appendices A and B give a brief introduction to the required linear algebra and some other mathematical and computer science background. All chapters come with exercises, with some hints provided in Appendix C.Ronald de Wolfwork_2pcfo6u7jzg25alp6mv6fq3w2yTue, 02 Aug 2022 00:00:00 GMTDeepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
https://scholar.archive.org/work/37rsexpykrfnbhu6zwiob5mdcq
When computing stable matchings, it is usually assumed that the preferences of the agents in the matching market are fixed. However, in many realistic scenarios, preferences change over time. Consequently, an initially stable matching may become unstable. Then, a natural goal is to find a matching which is stable with respect to the modified preferences and as close as possible to the initial one. For Stable Marriage/Roommates, this problem was formally defined as Incremental Stable Marriage/Roommates by Bredereck et al. [AAAI '20]. As they showed that Incremental Stable Roommates and Incremental Stable Marriage with Ties are NP-hard, we focus on the parameterized complexity of these problems. We answer two open questions of Bredereck et al. [AAAI '20]: We show that Incremental Stable Roommates is W[1]-hard parameterized by the number of changes in the preferences, yet admits an intricate XP-algorithm, and we show that Incremental Stable Marriage with Ties is W[1]-hard parameterized by the number of ties. Furthermore, we analyze the influence of the degree of "similarity" between the agents' preference lists, identifying several polynomial-time solvable and fixed-parameter tractable cases, but also proving that Incremental Stable Roommates and Incremental Stable Marriage with Ties parameterized by the number of different preference lists are W[1]-hard.Niclas Boehmer, Klaus Heeger, Rolf Niedermeierwork_37rsexpykrfnbhu6zwiob5mdcqTue, 02 Aug 2022 00:00:00 GMT