Approximating frustration scores in complex networks via perturbed Laplacian spectra
نویسندگان
چکیده
منابع مشابه
The Laplacian Spectra of Graphs and Complex Networks
The paper is a brief survey of some recent new results and progress of the Laplacian spectra of graphs and complex networks (in particular, random graph and the small world network). The main contents contain the spectral radius of the graph Laplacian for given a degree sequence, the Laplacian coefficients, the algebraic connectivity and the graph doubly stochastic matrix, and the spectra of ra...
متن کاملLeader-follower formation via complex Laplacian
The paper introduces complex-valued Laplacians for graphs whose edges are attributed with complex weights and studies the leader-follower formation problem based on complex Laplacians. The main goal is to control the shape of a planar formation of point agents in the plane using simple and linear interaction rules related to complex Laplacians. We present a characterization of complex Laplacian...
متن کاملApproximating Non-Uniform Sparsest Cut Via Generalized Spectra
We give an approximation algorithm for non-uniform sparsest cut with the following guarantee: For any ε, δ ∈ (0, 1), given cost and demand graphs with edge weights C,D : ( V 2 ) → R+ respectively, we can find a set T ⊆ V with C(T,V \T ) D(T,V \T ) at most 1+ε δ times the optimal non-uniform sparsest cut value, in time 2 poly(n) provided λr ≥ Φ∗/(1 − δ). Here λr is the r’th smallest generalized ...
متن کاملApproximating independent set in perturbed graphs
For the maximum independent set problem, strong inapproximability bounds for worst-case efficient algorithms exist. We give a deterministic algorithm beating these bounds, with polynomial expected running-time for semi-random graphs: An adversary chooses a graph with n vertices, and then edges are flipped with a probability of ε. Our algorithm guarantees an approximation ratio of O( √ nε) for s...
متن کاملFault Detection and Isolation of Multi-Agent Systems via Complex Laplacian
This paper studies the problem of fault detection and isolation (FDI) for multi-agent systems (MAS) via complex Laplacian subject to actuator faults. A planar formation of point agents in the plane using simple and linear interaction rules related to complex Laplacian is achieved. The communication network is a directed, and yet connected graph with a fixed topology. The loss of symmetry in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2015
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.92.062806