Filters








437,027 Hits in 4.0 sec

New bounds on the classical and quantum communication complexity of some graph properties [article]

Gabor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf
2012 arXiv   pre-print
We study the communication complexity of a number of graph properties where the edges of the graph G are distributed between Alice and Bob (i.e., each receives some of the edges as input).  ...  Our main results are: * An Omega(n) lower bound on the quantum communication complexity of deciding whether an n-vertex graph G is connected, nearly matching the trivial classical upper bound of O(n log  ...  Much research has gone into the query complexity of graph properties, most of it focusing on the so-called Aandera-Karp-Rosenberg conjecture.  ... 
arXiv:1204.4596v1 fatcat:3cui5wdo7bekzokvakb3xwvihe

New bounds on the classical and quantum communication complexity of some graph properties

Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald De Wolf, Marc Herbstritt
2012 Foundations of Software Technology and Theoretical Computer Science  
We study the communication complexity of a number of graph properties where the edges of the graph G are distributed between Alice and Bob (i.e., each receives some of the edges as input).  ...  Our main results are: An Ω(n) lower bound on the quantum communication complexity of deciding whether an nvertex graph G is connected, nearly matching the trivial classical upper bound of O(n log n) bits  ...  Here we obtain new bounds for the communication complexity of a number of graph properties, both in the classical and the quantum world: An Ω(n) lower bound on the quantum communication complexity of deciding  ... 
doi:10.4230/lipics.fsttcs.2012.148 dblp:conf/fsttcs/IvanyosKLSW12 fatcat:ennhzrejhjbjbhhlotzqkrktwu

New bounds on the classical and quantum communication complexity of some graph properties *

Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald De Wolf
32nd Int'l Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012   unpublished
We study the communication complexity of a number of graph properties where the edges of the graph G are distributed between Alice and Bob (i.e., each receives some of the edges as input).  ...  Our main results are: An Ω(n) lower bound on the quantum communication complexity of deciding whether an n-vertex graph G is connected, nearly matching the trivial classical upper bound of O(n log n) bits  ...  Here we obtain new bounds for the communication complexity of a number of graph properties, both in the classical and the quantum world: An Ω(n) lower bound on the quantum communication complexity of deciding  ... 
fatcat:eo5mvq72lrcbfhagi6imkpze4u

Problem Domains in Complex Networks

Mini Singh Ahuja
2016 IOSR Journal of Computer Engineering  
Many real world Networks can be represented with the help of complex networks.  ...  Complex networks are special graphs with non trivial topological properties-features that do not occur in simple networks such as lattices or random graphs.  ...  The research is going on this side of complex network too [2] . One can study how complex network properties evolve when the sample grows during the measurement.  ... 
doi:10.9790/0661-1805026568 fatcat:nxcrszgskjbkfmgzel4ml5a4sq

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory

Emirhan Gürpınar, Andrei Romashchenko, Daniel Kráľ, Javier Esparza
2020 International Symposium on Mathematical Foundations of Computer Science  
On the other hand, we provide examples of x, y such that the communication complexity of the protocol declines gradually with the size of the derived secret key.  ...  The proof of the main result uses spectral properties of appropriate graphs and the expander mixing lemma as well as various information theoretic techniques.  ...  Acknowledgements We thank the anonymous reviewers for instructive suggestions and corrections concerning this conference publication as well as the full version of the paper.  ... 
doi:10.4230/lipics.mfcs.2020.44 dblp:conf/mfcs/GurpinarR20 fatcat:ts5s6gjsdrhu5dysvoodzojira

Complex Networks Dynamics

Cyrille Bertelle, M.A. Aziz-Alaoui
2012 MATEC Web of Conferences  
Studies cases are presented and are developed, using a java library on dynamical graphs called GraphStream.  ...  This paper proposes a conceptual approach to study conceptual links in complex systems between dynamics, structure and control.  ...  Goals, Scientific Position and Approaches One of the main characteristics of complexity is the emergence of properties, as synchronization, due to dynamical processes.  ... 
doi:10.1051/matecconf/20120107002 fatcat:uurouwgrdfcvjcomc5p34wwgui

Towards Graph Representation Learning in Emergent Communication [article]

Agnieszka Słowik, Abhinav Gupta, William L. Hamilton, Mateja Jamnik, Sean B. Holden
2020 arXiv   pre-print
Motivated by an image-based referential game, we propose a graph referential game with varying degrees of complexity, and we provide strong baseline models that exhibit desirable properties in terms of  ...  In order to communicate, we flatten the complex representation of entities and their attributes into a single word or a sentence.  ...  Compositionality is one of the most desired properties in a communication protocol because it allows the agents to understand an (in principle) infinite number of complex structures through a finite vocabulary  ... 
arXiv:2001.09063v2 fatcat:nxalwl5eefblrflps5uv47lmoi

Spectral Detection of Simplicial Communities via Hodge Laplacians [article]

Sanjukta Krishnagopal, Ginestra Bianconi
2021 arXiv   pre-print
While the study of graphs has been very popular, simplicial complexes are relatively new in the network science community.  ...  Now, the spectrum of the graph Laplacian is known to be indicative of community structure, with nonzero eigenvectors encoding the identity of communities.  ...  The eigenvalue spectrum of the graph Laplacian is known to encode several properties of the graph itself.  ... 
arXiv:2108.06547v1 fatcat:iahprby3qjc37nc6lygucur2sm

Lower Bounds for Approximating Graph Parameters via Communication Complexity

Talya Eden, Will Rosenbaum, Michael Wagner
2018 International Workshop on Approximation Algorithms for Combinatorial Optimization  
In a celebrated work, Blais, Brody, and Matulef [7] developed a technique for proving property testing lower bounds via reductions from communication complexity.  ...  Their work focused on testing properties of functions, and yielded new lower bounds as well as simplified analyses of known lower bounds.  ...  Acknowledgements We thank Dana Ron and Oded Goldreich for their discussion and commentary on previous versions of this work. We also thank the anonymous reviewers for their valuable comments.  ... 
doi:10.4230/lipics.approx-random.2018.11 dblp:conf/approx/EdenR18 fatcat:6tn533dy6fedrmhctb4536cfqu

Extending Full Transitive Closure to Rank Removable Edges in GN Algorithm

R.G. Gayathri, Jyothisha J. Nair, M.R. Kaimal
2016 Procedia Computer Science  
Most of the real-world networks exhibit community structure, a property that reveals the existence of natural vertex clusters whose inter-edge density is lower than intra-edge density between various groups  ...  Detecting communities is a fundamental need in the area of networks, yet challenging.  ...  Geetha M for the insightful comments and support during the research.  ... 
doi:10.1016/j.procs.2016.07.297 fatcat:ogwv32v6b5ee3lddlu6bnhue34

Evolutionary Simulation of Complex Networks Structures with Specific Topological Properties

Victor V. Kashirin
2014 Procedia Computer Science  
defines the construction process of a network structure: single complex network model is able to provide a bounded space of solutions, and do not favour a tweaking of obtainable properties.  ...  Examples like this demonstrate presence of mentioned problem, which is emphasised by the fact that some properties of realworld networks might not be captured by generalised models of complex networks.  ...  The author would like hope that continuing research along the lines set out in this paper will assist in better understanding of relations between multiple topological and functional properties of complex  ... 
doi:10.1016/j.procs.2014.05.224 fatcat:dbuplm4zubbfjnl4jchlgvpph4

Examination of Chaotic Structures in Semiconductor or Alloy Voltage Time-Series: A Complex Network Approach for the Case of TlInTe2

Dimitrios Tsiotas, Lykourgos Magafas, Michael P. Hanias
2020 Physics  
The analysis uses a complex network analysis of the time-series and applies the visibility graph algorithm to transform the available time-series into a graph so that the topological properties of the  ...  A novel conceptualization of community detection based on modularity optimization is applied to the available time-series and reveals two major communities that are able to be related to the pair-wise  ...  the topology of the visibility graph is more complex than a lattice-like one since it is equipped with hierarchical structures related to the scale-free property, as is captured in the previous degree  ... 
doi:10.3390/physics2040036 fatcat:qyo2fbvvxzabpkbcyel4kddeze

High-level Visualization Over Big Linked Data

Laura Po
2018 International Semantic Web Conference  
The Linked Open Data (LOD) Cloud is continuously expanding and the number of complex and large sources is raising.  ...  Users can start from a high-level visualization and then focus on an element of interest to incrementally explore the source, as well as perform a visual query on certain classes of interest.  ...  Starting from the visualization of the complete Schema Summary, composed of 90 classes linked by 250 properties, users will see a complex graph represented in Figure 3 ) (a).  ... 
dblp:conf/semweb/Po18 fatcat:kte4lvr7k5cbrititwxpvugrju

Secure network coding for distributed secret sharing with low communication cost

Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran
2013 2013 IEEE International Symposium on Information Theory  
In the second part of the paper, we derive information-theoretic lower bounds on the communication complexity of secret sharing over any network, which may also be of independent interest.  ...  We show that for networks satisfying the k-propagating-dealer condition, the communication complexity of our algorithm is Θ(n), and furthermore, is always within a constant factor of the lower bound.  ...  On the other hand, the communication complexity of the previous solution grows super-linearly for a large class of graphs, and is Θ(n 2 ) in the worst case.  ... 
doi:10.1109/isit.2013.6620657 dblp:conf/isit/ShahRR13 fatcat:75wm7xb2yrdc7o6wvepdsiyuwq

Analysis of function-call graphs of open-source software systems using complex network analysis

Volkan Tunalı, Mehmet Ali Aksoy Tüysüz
2020 Pamukkale University Journal of Engineering Sciences  
We found the call graphs to reveal scale-free and small-world network properties similar to the findings of the previous studies.  ...  Then, we analyzed the call graphs both visually and topologically using the techniques of complex network analysis.  ...  Community analysis In this final phase of the complex network analysis, we used Gephi to identify the dense groups of nodes called communities (or clusters) in the call graphs.  ... 
doi:10.5505/pajes.2019.63239 fatcat:wu4g7lafb5dixgn4bxoe7ki7za
« Previous Showing results 1 — 15 out of 437,027 results