109,316 research outputs found
Graph Summarization
The continuous and rapid growth of highly interconnected datasets, which are
both voluminous and complex, calls for the development of adequate processing
and analytical techniques. One method for condensing and simplifying such
datasets is graph summarization. It denotes a series of application-specific
algorithms designed to transform graphs into more compact representations while
preserving structural patterns, query answers, or specific property
distributions. As this problem is common to several areas studying graph
topologies, different approaches, such as clustering, compression, sampling, or
influence detection, have been proposed, primarily based on statistical and
optimization methods. The focus of our chapter is to pinpoint the main graph
summarization methods, but especially to focus on the most recent approaches
and novel research trends on this topic, not yet covered by previous surveys.Comment: To appear in the Encyclopedia of Big Data Technologie
Information transfer in community structured multiplex networks
The study of complex networks that account for different types of
interactions has become a subject of interest in the last few years, specially
because its representational power in the description of users interactions in
diverse online social platforms (Facebook, Twitter, Instagram, etc.). The
mathematical description of these interacting networks has been coined under
the name of multilayer networks, where each layer accounts for a type of
interaction. It has been shown that diffusive processes on top of these
networks present a phenomenology that cannot be explained by the naive
superposition of single layer diffusive phenomena but require the whole
structure of interconnected layers. Nevertheless, the description of diffusive
phenomena on multilayer networks has obviated the fact that social networks
have strong mesoscopic structure represented by different communities of
individuals driven by common interests, or any other social aspect. In this
work, we study the transfer of information in multilayer networks with
community structure. The final goal is to understand and quantify, if the
existence of well-defined community structure at the level of individual
layers, together with the multilayer structure of the whole network, enhances
or deteriorates the diffusion of packets of information.Comment: 13 pages, 6 figure
Modeshapes recognition using Fourier descriptors: a simple SHM example
The main objective of this study is to develop an alternative criterion for modeshape classification, as the currently available one, MAC (Modal Assurance Criteria), is only a vector correlation representing modeshape similarities. This new method is developed to provide a set of features (Fourier Descriptors) for comparing modeshapes with “local” similarities of higher interest than “global” similarities using nodal lines. These lines are able to characterize modeshapes very easily. So when damage occurs, we are able to track the few descriptors changes to localise the damage. We validated our method on a CFCF plate demonstrating the quality of the damage localisation and possible use in a “mode tracking” application (space structure)
Complex Networks from Classical to Quantum
Recent progress in applying complex network theory to problems in quantum
information has resulted in a beneficial crossover. Complex network methods
have successfully been applied to transport and entanglement models while
information physics is setting the stage for a theory of complex systems with
quantum information-inspired methods. Novel quantum induced effects have been
predicted in random graphs---where edges represent entangled links---and
quantum computer algorithms have been proposed to offer enhancement for several
network problems. Here we review the results at the cutting edge, pinpointing
the similarities and the differences found at the intersection of these two
fields.Comment: 12 pages, 4 figures, REVTeX 4-1, accepted versio
- …