arXiv subjects

Cesar H. Comin

Publications and source records attributed to Cesar H. Comin.

33 records · Page 2Linked to original sources

arXiv2017

Topological characterization of world cities

The topological organization of several world cities are studied according to respective representations by complex networks. As a first step, the city maps are processed by a recently developed methodology that allows the most significant urban region of each city to be identified. Then, we estimate many topological measures on the obtained networks, and apply multivariate statistics and data analysis methods to study and compare the topologies. Remarkably, the obtained results show that cities from specific continents, especially Anglo-Saxon America, tend to have particular topological properties. Such developments should contribute to better understanding how cities are organized and related to different geographical locations worldwide.

physics.soc-ph↗

arXiv2017

A Pattern Recognition Approach to Transistor Array Parameter Variance

The properties of bipolar junction transistors (BJTs) are known to vary in terms of their parameters. In this work, an experimental approach, including pattern recognition concepts and methods such as principal component analysis (PCA) and linear discriminant analysis (LDA), was used to experimentally investigate the variation among BJTs belonging to integrated circuits known as transistor arrays. It was shown that a good deal of the devices variance can be captured using only two PCA axes. It was also verified that, though substantially small variation of parameters is observed for BJT from the same array, larger variation arises between BJTs from distinct arrays, suggesting the consideration of device characteristics in more critical analog designs. As a consequence of its supervised nature, LDA was able to provide a substantial separation of the BJT into clusters, corresponding to each transistor array. In addition, the LDA mapping into two dimensions revealed a clear relationship between the considered measurements. Interestingly, a specific mapping suggested by the PCA, involving the total harmonic distortion variation expressed in terms of the average voltage gain, yielded an even better separation between the transistor array clusters.

physics.ins-det↗

arXiv2017

Connecting Network Science and Information Theory

A framework integrating information theory and network science is proposed, giving rise to a potentially new area. By incorporating and integrating concepts such as complexity, coding, topological projections and network dynamics, the proposed network-based framework paves the way not only to extending traditional information science, but also to modeling, characterizing and analyzing a broad class of real-world problems, from language communication to DNA coding. Basically, an original network is supposed to be transmitted, with or without compaction, through a sequence of symbols or time-series obtained by sampling its topology by some network dynamics, such as random walks. We show that the degree of compression is ultimately related to the ability to predict the frequency of symbols based on the topology of the original network and the adopted dynamics. The potential of the proposed approach is illustrated with respect to the efficiency of transmitting several types of topologies by using a variety of random walks. Several interesting results are obtained, including the behavior of the Barabási-Albert model oscillating between high and low performance depending on the considered dynamics, and the distinct performances obtained for two geographical models.

cs.IT↗

arXiv2017

An Early Model of Transistors and Circuits

Bipolar junction transistors (BJTs) have been at the core of linear electronics from its beginnings. Although their properties can be well represented transport model equations, design and analysis approaches have, to a good extent, been limited to using current-equispaced horizontal and parallel isolines of the characteristic surface. Here, we resort to the geometrical structure imposed on BJTs behavior by the Early effect and voltage as a means to derive a simple, intuitive and more complete respective model that, though excluding cut-off and saturation regimes, can simplify the design and characterization of BJTs and respective circuits, including integrated devices. The approach involves using a beam of isolines converging at the Early voltage as the model of a BJT. The angles of the isolines, another important aspect of BJTs, are experimentally verified often to vary almost in linear fashion with the base current, endowing the proposed Early model with an intrinsic geometric nature. An experimental-numerical methodology is suggested for the Early model estimation, and applied to 12 real-world small signal NPN BJTs. Interesting results are obtained, including the identification of diverse Early voltage values for different BJT types and the observation, for the considered BJTs, of the almost linear variation of the isoline angles with the input current. A case example of transfer function estimation, as well as total harmonic distortion analysis, are also provided in order to illustrate the potential of the proposed methodology for approximating, under certain circumstances, the operation of the common emitter configuration. The proposed model also has good potential as a didactic aid in physics and electronics programs, complementing the currently adopted modeling approaches.

physics.ins-det↗

arXiv2016

Clustering Algorithms: A Comparative Approach

Many real-world systems can be studied in terms of pattern recognition tasks, so that proper use (and understanding) of machine learning methods in practical applications becomes essential. While a myriad of classification methods have been proposed, there is no consensus on which methods are more suitable for a given dataset. As a consequence, it is important to comprehensively compare methods in many possible scenarios. In this context, we performed a systematic comparison of 7 well-known clustering methods available in the R language. In order to account for the many possible variations of data, we considered artificial datasets with several tunable properties (number of classes, separation between classes, etc). In addition, we also evaluated the sensitivity of the clustering methods with regard to their parameters configuration. The results revealed that, when considering the default configurations of the adopted methods, the spectral approach usually outperformed the other clustering algorithms. We also found that the default configuration of the adopted implementations was not accurate. In these cases, a simple approach based on random selection of parameters values proved to be a good alternative to improve the performance. All in all, the reported approach provides subsidies guiding the choice of clustering algorithms.

cs.LG↗

arXiv2016

Negative Feedback, Linearity and Parameter Invariance in Linear Electronics

Negative feedback is a powerful approach capable of improving several aspects of a system. In linear electronics, it has been critical for allowing invariance to device properties. Negative feedback is also known to enhance linearity in amplification, which is one of the most important foundations of linear electronics. At the same time, thousands of transistors types have been made available, suggesting that these devices, in addition to their known variability of parameters, have distinguishing properties. The current work reports a systematic approach to quantifying the potential of negative feedback, with respect to bipolar transistors, as a means to providing device invariance and linearity. Several methods, including concepts from multivariate statistics and complex systems, are applied at the theoretical as well as experimental levels, and a number of interesting results are obtained and discussed. For instance, it has been verified that the transistors types indeed have well-defined characteristics which clearly segregate them into groups. The addition of feedback at moderate and intense levels promoted uniformization of the properties of these transistors when used in a class A common emitter configuration. However, such effect occurred with different efficiency regarding the considered device features, and even intense feedback was unable to completely eliminate device dependence. This indicates that it would be interesting to consider the device properties in linear design even when negative feedback is applied. We also verified that the linearization induced in the considered experiments is relatively modest, with effects that depend on type of transfer function of the original devices.

physics.ins-det↗

arXiv2016

Seeking Maximum Linearity of Transfer Functions

Linearity is an important and frequently sought property in electronics and instrumentation. Here, we report a method capable of, given a transfer function, identifying the respective most linear region of operation with a fixed width. This methodology, which is based on least squares regression and systematic consideration of all possible regions, has been illustrated with respect to both an analytical (sigmoid transfer function) and real-world (low-power, one-stage class A transistor amplifier) situations. In the former case, the method was found to identity the theoretically optimal region of operation even in presence of noise. In the latter case, it was possible to identify an amplifier circuit configuration providing a good compromise between linearity, amplification and output resistance. The transistor amplifier application, which was addressed in terms of transfer functions derived from its experimentally obtained characteristic surface, also yielded contributions such as the estimation of local constants of the device, as opposed to typically considered average values. Moreover, the obtained characteristic surfaces of the considered transistor (a generic, low signal device) revealed a surprisingly complex structure. The reported method and results paves the way to several other applications in other types of devices and systems, intelligent control operation, and other areas such as identifying regions of power law behavior.

physics.data-an↗

arXiv2016

A framework for evaluating complex networks measurements

A good deal of current research in complex networks involves the characterization and/or classification of the topological properties of given structures, which has motivated several respective measurements. This letter proposes a framework for evaluating the quality of complex network measurements in terms of their effective resolution, degree of degeneracy and discriminability. The potential of the suggested approach is illustrated with respect to comparing the characterization of several model and real-world networks by using concentric and symmetry measurements. The results indicate a markedly superior performance for the latter type of mapping.

physics.soc-ph↗

arXiv2016

The relationship between structure and function in locally observed complex networks

Recently, some studies started to unveil the wealthy of interactions that occur between groups of nodes when looking at the small scale of interactions taking place in complex networks. Such findings claim for a new systematic methodology to quantify, at node level, how a dynamics is being influenced (or differentiated) by the structure of the underlying system. Here we define a new measure that, based on dynamical characteristics obtained for a large set of initial conditions, compares the dynamical behavior of the nodes present in the system. Through this measure we find that the geographic and Barabási-Albert models have high capacity for generating networks that exhibit groups of nodes with distinct dynamics compared to the rest of the network. The application of our methodology is illustrated with respect of two real systems. In the first we use the neuronal network of the nematode Caenorhabditis elegans to show that the interneurons of the ventral cord of the nematode presents a very large dynamical differentiation when compared to the rest of the network. The second application concerns the SIS epidemic model on an airport network, where we quantify how different the distribution of infection times of high and low degree nodes can be, when compared to the expected value for the network.

physics.soc-ph↗

arXiv2016

Random walks in directed modular networks

Because diffusion typically involves symmetric interactions, scant attention has been focused on studying asymmetric cases. However, important networked systems underlain by diffusion (e.g. cortical networks and WWW) are inherently directed. In the case of undirected diffusion, it can be shown that the steady-state probability of the random walk dynamics is fully correlated with the degree, which no longer holds for directed networks. We investigate the relationship between such probability and the inward node degree, which we call efficiency, in modular networks. Our findings show that the efficiency of a given community depends mostly on the balance between its ingoing and outgoing connections. In addition, we derive analytical expressions to show that the internal degree of the nodes do not play a crucial role in their efficiency, when considering the Erdős-Rényi and Barabási-Albert models. The results are illustrated with respect to the macaque cortical network, providing subsidies for improving transportation and communication systems.

cond-mat.stat-mech↗

arXiv2016

Complex systems: features, similarity and connectivity

The increasing interest in complex networks research has been a consequence of several intrinsic features of this area, such as the generality of the approach to represent and model virtually any discrete system, and the incorporation of concepts and methods deriving from many areas, from statistical physics to sociology, which are often used in an independent way. Yet, for this same reason, it would be desirable to integrate these various aspects into a more coherent and organic framework, which would imply in several benefits normally allowed by the systematization in science, including the identification of new types of problems and the cross-fertilization between fields. More specifically, the identification of the main areas to which the concepts frequently used in complex networks can be applied paves the way to adopting and applying a larger set of concepts and methods deriving from those respective areas. Among the several areas that have been used in complex networks research, pattern recognition, optimization, linear algebra, and time series analysis seem to play a more basic and recurrent role. In the present manuscript, we propose a systematic way to integrate the concepts from these diverse areas regarding complex networks research. In order to do so, we start by grouping the multidisciplinary concepts into three main groups, namely features, similarity, and network connectivity. Then we show that several of the analysis and modeling approaches to complex networks can be thought as a composition of maps between these three groups, with emphasis on nine main types of mappings, which are presented and illustrated. Such a systematization of principles and approaches also provides an opportunity to review some of the most closely related works in the literature, which is also developed in this article.

physics.soc-ph↗

arXiv2015

Thermodynamic characterization of networks using graph polynomials

In this paper, we present a method for characterizing the evolution of time-varying complex networks by adopting a thermodynamic representation of network structure computed from a polynomial (or algebraic) characterization of graph structure. Commencing from a representation of graph structure based on a characteristic polynomial computed from the normalized Laplacian matrix, we show how the polynomial is linked to the Boltzmann partition function of a network. This allows us to compute a number of thermodynamic quantities for the network, including the average energy and entropy. Assuming that the system does not change volume, we can also compute the temperature, defined as the rate of change of entropy with energy. All three thermodynamic variables can be approximated using low-order Taylor series that can be computed using the traces of powers of the Laplacian matrix, avoiding explicit computation of the normalized Laplacian spectrum. These polynomial approximations allow a smoothed representation of the evolution of networks to be constructed in the thermodynamic space spanned by entropy, energy, and temperature. We show how these thermodynamic variables can be computed in terms of simple network characteristics, e.g., the total number of nodes and node degree statistics for nodes connected by edges. We apply the resulting thermodynamic characterization to real-world time-varying networks representing complex systems in the financial and biological domains. The study demonstrates that the method provides an efficient tool for detecting abrupt changes and characterizing different stages in network evolution.

physics.soc-ph↗

arXiv2015

Modular Dynamics of Financial Market Networks

The financial market is a complex dynamical system composed of a large variety of intricate relationships between several entities, such as banks, corporations and institutions. At the heart of the system lies the stock exchange mechanism, which establishes a time-evolving network of trades among companies and individuals. Such network can be inferred through correlations between time series of companies stock prices, allowing the overall system to be characterized by techniques borrowed from network science. Here we study the presence of communities in the inferred stock market network, and show that the knowledge about the communities alone can provide a nearly complete representation of the system topology. This is done by defining a simple null model, a randomized version of the studied network sharing only the sizes and interconnectivity between communities observed. We show that many topological characteristics of the inferred networks are carried over the networks generated by the null model. In particular, we find that in periods of instability, such as during a financial crisis, the network strays away from a state of well-defined community structure to a much more uniform topological organization. We show that the framework presented here provides a good null model representation of topological variations taking place in the market during crises. Also, the general approach used in this work can be extended to other systems.

physics.soc-ph↗

arXiv2014

Concentric Network Symmetry

Quantification of symmetries in complex networks is typically done globally in terms of automorphisms. Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify the symmetries around nodes, which we call connectivity patterns. We develop two topological transformations that allow a concise characterization of the different types of symmetry appearing on networks and apply these concepts to six network models, namely the Erdős-Rényi, Barabási-Albert, random geometric graph, Waxman, Voronoi and rewired Voronoi. Real-world networks, namely the scientific areas of Wikipedia, the world-wide airport network and the street networks of Oldenburg and San Joaquin, are also analyzed in terms of the proposed symmetry measurements. Several interesting results emerge from this analysis, including the high symmetry exhibited by the Erdős-Rényi model. Additionally, we found that the proposed measurements present low correlation with other traditional metrics, such as node degree and betweenness centrality. Principal component analysis is used to combine all the results, revealing that the concepts presented here have substantial potential to also characterize networks at a global scale.

physics.soc-ph↗

arXiv2011

Unveiling the Relationship Between Structure and Dynamics in Complex Networks

Over the last years, a great deal of attention has been focused on complex networked systems, characterized by intricate structure and dynamics. The latter has been often represented in terms of overall statistics (e.g. average and standard deviations) of the time signals. While such approaches have led to many insights, they have failed to take into account that signals at different parts of the system can undergo distinct evolutions, which cannot be properly represented in terms of average values. A novel framework for identifying the principal aspects of the dynamics and how it is influenced by the network structure is proposed in this work. The potential of this approach is illustrated with respect to three important models (Integrate-and-Fire, SIS and Kuramoto), allowing the identification of highly structured dynamics, in the sense that different groups of nodes not only presented specific dynamics but also felt the structure of the network in different ways.

physics.data-an↗