1,414 research outputs found
Complex networks analysis in socioeconomic models
This chapter aims at reviewing complex networks models and methods that were
either developed for or applied to socioeconomic issues, and pertinent to the
theme of New Economic Geography. After an introduction to the foundations of
the field of complex networks, the present summary adds insights on the
statistical mechanical approach, and on the most relevant computational aspects
for the treatment of these systems. As the most frequently used model for
interacting agent-based systems, a brief description of the statistical
mechanics of the classical Ising model on regular lattices, together with
recent extensions of the same model on small-world Watts-Strogatz and
scale-free Albert-Barabasi complex networks is included. Other sections of the
chapter are devoted to applications of complex networks to economics, finance,
spreading of innovations, and regional trade and developments. The chapter also
reviews results involving applications of complex networks to other relevant
socioeconomic issues, including results for opinion and citation networks.
Finally, some avenues for future research are introduced before summarizing the
main conclusions of the chapter.Comment: 39 pages, 185 references, (not final version of) a chapter prepared
for Complexity and Geographical Economics - Topics and Tools, P.
Commendatore, S.S. Kayam and I. Kubin Eds. (Springer, to be published
Graph Signal Processing: Overview, Challenges and Applications
Research in Graph Signal Processing (GSP) aims to develop tools for
processing data defined on irregular graph domains. In this paper we first
provide an overview of core ideas in GSP and their connection to conventional
digital signal processing. We then summarize recent developments in developing
basic GSP tools, including methods for sampling, filtering or graph learning.
Next, we review progress in several application areas using GSP, including
processing and analysis of sensor network data, biological data, and
applications to image processing and machine learning. We finish by providing a
brief historical perspective to highlight how concepts recently developed in
GSP build on top of prior research in other areas.Comment: To appear, Proceedings of the IEE
Equilibrium statistical mechanics on correlated random graphs
Biological and social networks have recently attracted enormous attention
between physicists. Among several, two main aspects may be stressed: A non
trivial topology of the graph describing the mutual interactions between agents
exists and/or, typically, such interactions are essentially (weighted)
imitative. Despite such aspects are widely accepted and empirically confirmed,
the schemes currently exploited in order to generate the expected topology are
based on a-priori assumptions and in most cases still implement constant
intensities for links. Here we propose a simple shift in the definition of
patterns in an Hopfield model to convert frustration into dilution: By varying
the bias of the pattern distribution, the network topology -which is generated
by the reciprocal affinities among agents - crosses various well known regimes
(fully connected, linearly diverging connectivity, extreme dilution scenario,
no network), coupled with small world properties, which, in this context, are
emergent and no longer imposed a-priori. The model is investigated at first
focusing on these topological properties of the emergent network, then its
thermodynamics is analytically solved (at a replica symmetric level) by
extending the double stochastic stability technique, and presented together
with its fluctuation theory for a picture of criticality. At least at
equilibrium, dilution simply decreases the strength of the coupling felt by the
spins, but leaves the paramagnetic/ferromagnetic flavors unchanged. The main
difference with respect to previous investigations and a naive picture is that
within our approach replicas do not appear: instead of (multi)-overlaps as
order parameters, we introduce a class of magnetizations on all the possible
sub-graphs belonging to the main one investigated: As a consequence, for these
objects a closure for a self-consistent relation is achieved.Comment: 30 pages, 4 figure
- …