-
Quantum Thermal Machines Improved by Internal Coupling: From Equilibrium to Non-equilibrium Limit Cycles
Authors:
Jingyi Gao,
Naomichi Hatano
Abstract:
We investigate how internal coupling influences the operation and performance of a quantum Otto cycle operating as the Gibbs-state limit cycle (GSLC), equilibrating limit cycle (ELC), and non-equilibrating limit cycle (NELC). We show that the internal coupling significantly broadens the operational regime of the cycle. In particular, in parameter regimes where the uncoupled Otto cycle fails to ope…
▽ More
We investigate how internal coupling influences the operation and performance of a quantum Otto cycle operating as the Gibbs-state limit cycle (GSLC), equilibrating limit cycle (ELC), and non-equilibrating limit cycle (NELC). We show that the internal coupling significantly broadens the operational regime of the cycle. In particular, in parameter regimes where the uncoupled Otto cycle fails to operate as any thermal machine, the coupled system can function as an engine or a refrigerator.
For the GSLC, in which we assume that the system quickly equilibrates during the isochoric processes, the internal coupling not only shifts and enlarges the operational regime but also enhances the efficiency and the coefficient of performance (COP), allowing the performance to exceed the standard Otto bounds while remaining below the Carnot limit.
For ELC and NELC, we validate the global approach of the Gorini--Kossakowski--Sudarshan--Lindblad (GKSL) master equation by comparison with the GSLC, and examine the NELC for finite interaction time and the ELC for infinite interaction time. Although the efficiency and COP of NELC are lower than those of ELC, shorter interaction times yield higher power output, consistent with the power--efficiency trade-off.
△ Less
Submitted 2 March, 2026;
originally announced March 2026.
-
Non-equilibrium Dynamics of Three-Level Absorption Refrigerator at Third-Order Liouvillian Exceptional Points
Authors:
Jingyi Gao,
Naomichi Hatano
Abstract:
We analyze the influence of Liouvillian exceptional points (LEPs) in the three-level quantum absorption refrigerator, putting emphasis on the non-equilibrium process before the convergence to the steady state. We search for the second-order and third-order LEPs in the system with two types of couplings. Focusing on the third-order LEPs, we analyze the damping of the system state in the long term a…
▽ More
We analyze the influence of Liouvillian exceptional points (LEPs) in the three-level quantum absorption refrigerator, putting emphasis on the non-equilibrium process before the convergence to the steady state. We search for the second-order and third-order LEPs in the system with two types of couplings. Focusing on the third-order LEPs, we analyze the damping of the system state in the long term analytically and numerically. In addition, we analyze the damping of heat currents and the influence of the non-equilibrium process in the heat extraction from the cold bath. Critical damping at LEPs of both the system state and the heat currents is achieved, implying the fastest convergence to the equilibrium system. During the non-equilibrium process, we find that much heat transfer from the cold bath to the hot bath with less energy cost of the work bath is achieved at the third-order LEP, leading to better performance of the refrigerator.
△ Less
Submitted 24 July, 2025;
originally announced July 2025.
-
Null-eigenvalue localization of quantum walks on real-world complex networks
Authors:
Ruben Bueno,
Naomichi Hatano
Abstract:
First we report that the adjacency matrices of real-world complex networks systematically have null eigenspaces with much higher dimensions than that of random networks. These null eigenvalues are caused by duplication mechanisms leading to structures with local symmetries which should be more present in complex organizations. The associated eigenvectors of these states are strongly localized. We…
▽ More
First we report that the adjacency matrices of real-world complex networks systematically have null eigenspaces with much higher dimensions than that of random networks. These null eigenvalues are caused by duplication mechanisms leading to structures with local symmetries which should be more present in complex organizations. The associated eigenvectors of these states are strongly localized. We then evaluate these microstructures in the context of quantum mechanics, demonstrating the previously mentioned localization by studying the spread of continuous-time quantum walks. This null-eigenvalue localization is essentially different from the Anderson localization in the following points: first, the eigenvalues do not lie on the edges of the density of states but at its center; second, the eigenstates do not decay exponentially and do not leak out of the symmetric structures. In this sense, it is closer to the bound state in continuum.
△ Less
Submitted 30 June, 2020;
originally announced July 2020.
-
Real Edge Modes in a Floquet-modulated $\mathcal{PT}$-symmetric SSH model
Authors:
Andrew K. Harter,
Naomichi Hatano
Abstract:
Non-Hermitian Hamiltonians provide a simple picture for analyzing systems with natural or induced gain and loss; however, in general, such Hamiltonians feature complex energies and a corresponding non-orthonormal eigenbasis. Provided that the Hamiltonian has $\mathcal{PT}$ symmetry, it is possible to find a regime in which the eigenspectrum is completely real. In the case of static $\mathcal{PT}$-…
▽ More
Non-Hermitian Hamiltonians provide a simple picture for analyzing systems with natural or induced gain and loss; however, in general, such Hamiltonians feature complex energies and a corresponding non-orthonormal eigenbasis. Provided that the Hamiltonian has $\mathcal{PT}$ symmetry, it is possible to find a regime in which the eigenspectrum is completely real. In the case of static $\mathcal{PT}$-symmetric extensions of the simple Su-Schrieffer-Heeger model, it has been shown that the energies associated with any edge states are guaranteed to be complex. Moving to a time-dependent system means that treatment of the Hamiltonian must be done at the effective time-scale of the modulation itself, allowing for more intricate phases to occur than in the static case. It has been demonstrated that with particular classes of periodic driving, achieving a real topological phase at high driving frequency is possible. In the present paper, we show the details of this process by using a simple two-step periodic modulation. We obtain a rigorous expression for the effective Floquet Hamiltonian and compare its symmetries to those of the original Hamiltonians which comprise the modulation steps. The $\mathcal{PT}$ phase of the effective Hamiltonian is dependent on the modulation frequency as well as the gain/loss strength. Furthermore, the topologically nontrivial regime of the $\mathcal{PT}$-unbroken phase admits highly-localized edge states with real eigenvalues in both the high frequency case and below it, albeit within a smaller extent of the parameter space.
△ Less
Submitted 30 June, 2020;
originally announced June 2020.
-
Discrete-time quantum walk on complex networks for community detection
Authors:
Kanae Mukai,
Naomichi Hatano
Abstract:
We define the discrete-time quantum walk on complex networks and utilize it for community detection. We numerically show that the quantum walk with the Fourier coin is localized in a community to which the initial node belongs. Meanwhile, the quantum walk with the Grover coin tends to be localized around the initial node, not over a community. The probability of the classical random walk on the sa…
▽ More
We define the discrete-time quantum walk on complex networks and utilize it for community detection. We numerically show that the quantum walk with the Fourier coin is localized in a community to which the initial node belongs. Meanwhile, the quantum walk with the Grover coin tends to be localized around the initial node, not over a community. The probability of the classical random walk on the same network converges to the uniform distribution with a relaxation time generally a priori. We thus claim that the time average of the probability of the Fourier-coin quantum walk on complex networks reveals the community structure more explicitly than that of the Grover-coin quantum walk and a snapshot of the classical random walk. We first demonstrate our method of community detection for a prototypical three-community network, producing the correct grouping. We then apply our method to two real-world networks, namely Zachary's karate club and the US Airport network. We successfully reveals the community structure, the two communities of the instructor and the administrator in the former and major airline companies in the latter.
△ Less
Submitted 26 May, 2020;
originally announced May 2020.
-
Random Multi-Hopper Model. Super-Fast Random Walks on Graphs
Authors:
Ernesto Estrada,
Jean-Charles Delvenne,
Naomichi Hatano,
José L. Mateos,
Ralf Metzler,
Alejandro P. Riascos,
Michael T. Schaub
Abstract:
We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the two nodes. We consider here two decaying functions in the form of the Laplace and Mellin transforms of the shortest-path distances. Remarkably, when the paramet…
▽ More
We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the two nodes. We consider here two decaying functions in the form of the Laplace and Mellin transforms of the shortest-path distances. Remarkably, when the parameters of these transforms approach zero asymptotically, the multi-hopper's hitting times between any two nodes in the graph converge to their minimum possible value, given by the hitting times of a normal random walker on a complete graph. Stated differently, for small parameter values the multi-hopper explores a general graph as fast as possible when compared to a random walker on a full graph. Using computational experiments we show that compared to the normal random walker, the multi-hopper indeed explores graphs with clusters or skewed degree distributions more efficiently for a large parameter range. We provide further computational evidence of the speed-up attained by the random multi-hopper model with respect to the normal random walker by studying deterministic, random and real-world networks.
△ Less
Submitted 17 October, 2020; v1 submitted 24 December, 2016;
originally announced December 2016.
-
Communicability Angle and the Spatial Efficiency of Networks
Authors:
Ernesto Estrada,
Naomichi Hatano
Abstract:
We introduce the concept of communicability angle between a pair of nodes in a graph. We provide strong analytical and empirical evidence that the average communicability angle for a given network accounts for its spatial efficiency on the basis of the communications among the nodes in a network. We determine characteristics of the spatial efficiency of more than a hundred real-world complex netwo…
▽ More
We introduce the concept of communicability angle between a pair of nodes in a graph. We provide strong analytical and empirical evidence that the average communicability angle for a given network accounts for its spatial efficiency on the basis of the communications among the nodes in a network. We determine characteristics of the spatial efficiency of more than a hundred real-world complex networks that represent complex systems arising in a diverse set of scenarios. In particular, we find that the communicability angle correlates very well with the experimentally measured value of the relative packing efficiency of proteins that are represented as residue networks. We finally show how we can modulate the spatial efficiency of a network by tuning the weights of the edges of the networks. This allows us to predict effects of external stresses on the spatial efficiency of a network as well as to design strategies to improve important parameters in real-world complex systems.
△ Less
Submitted 28 July, 2015; v1 submitted 22 December, 2014;
originally announced December 2014.
-
Viral spreading of daily information in online social networks
Authors:
Tatsuro Kawamoto,
Naomichi Hatano
Abstract:
We explain a possible mechanism of an information spreading on a network which spreads extremely far from a seed node, namely the viral spreading. On the basis of a model of the information spreading in an online social network, in which the dynamics is expressed as a random multiplicative process of the spreading rates, we will show that the correlation between the spreading rates enhances the ch…
▽ More
We explain a possible mechanism of an information spreading on a network which spreads extremely far from a seed node, namely the viral spreading. On the basis of a model of the information spreading in an online social network, in which the dynamics is expressed as a random multiplicative process of the spreading rates, we will show that the correlation between the spreading rates enhances the chance of the viral spreading, shifting the tipping point at which the spreading goes viral.
△ Less
Submitted 16 March, 2014; v1 submitted 12 November, 2012;
originally announced November 2012.
-
The Physics of Communicability in Complex Networks
Authors:
Ernesto Estrada,
Naomichi Hatano,
Michele Benzi
Abstract:
A fundamental problem in the study of complex networks is to provide quantitative measures of correlation and information flow between different parts of a system. To this end, several notions of communicability have been introduced and applied to a wide variety of real-world networks in recent years. Several such communicability functions are reviewed in this paper. It is emphasized that communic…
▽ More
A fundamental problem in the study of complex networks is to provide quantitative measures of correlation and information flow between different parts of a system. To this end, several notions of communicability have been introduced and applied to a wide variety of real-world networks in recent years. Several such communicability functions are reviewed in this paper. It is emphasized that communication and correlation in networks can take place through many more routes than the shortest paths, a fact that may not have been sufficiently appreciated in previously proposed correlation measures. In contrast to these, the communicability measures reviewed in this paper are defined by taking into account all possible routes between two nodes, assigning smaller weights to longer ones. This point of view naturally leads to the definition of communicability in terms of matrix functions, such as the exponential, resolvent, and hyperbolic functions, in which the matrix argument is either the adjacency matrix or the graph Laplacian associated with the network. Considerable insight on communicability can be gained by modeling a network as a system of oscillators and deriving physical interpretations, both classical and quantum-mechanical, of various communicability functions. Applications of communicability measures to the analysis of complex systems are illustrated on a variety of biological, physical and social networks. The last part of the paper is devoted to a review of the notion of locality in complex networks and to computational aspects that by exploiting sparsity can greatly reduce the computational efforts for the calculation of communicability functions for large networks.
△ Less
Submitted 13 September, 2011;
originally announced September 2011.
-
Analysis technique for exceptional points in open quantum systems and QPT analogy for the appearance of irreversibility
Authors:
Savannah Garmon,
Ingrid Rotter,
Naomichi Hatano,
Dvira Segal
Abstract:
We propose an analysis technique for the exceptional points (EPs) occurring in the discrete spectrum of open quantum systems (OQS), using a semi-infinite chain coupled to an endpoint impurity as a prototype. We outline our method to locate the EPs in OQS, further obtaining an eigenvalue expansion in the vicinity of the EPs that gives rise to characteristic exponents. We also report the precise num…
▽ More
We propose an analysis technique for the exceptional points (EPs) occurring in the discrete spectrum of open quantum systems (OQS), using a semi-infinite chain coupled to an endpoint impurity as a prototype. We outline our method to locate the EPs in OQS, further obtaining an eigenvalue expansion in the vicinity of the EPs that gives rise to characteristic exponents. We also report the precise number of EPs occurring in an OQS with a continuum described by a quadratic dispersion curve. In particular, the number of EPs occurring in a bare discrete Hamiltonian of dimension $n_\textrm{D}$ is given by $n_\textrm{D} (n_\textrm{D} - 1)$; if this discrete Hamiltonian is then coupled to continuum (or continua) to form an OQS, the interaction with the continuum generally produces an enlarged discrete solution space that includes a greater number of EPs, specifically $2^{n_\textrm{C}} (n_\textrm{C} + n_\textrm{D}) [2^{n_\textrm{C}} (n_\textrm{C} + n_\textrm{D}) - 1] $, in which $n_\textrm{C}$ is the number of (non-degenerate) continua to which the discrete sector is attached. Finally, we offer a heuristic quantum phase transition analogy for the emergence of the resonance (giving rise to irreversibility via exponential decay) in which the decay width plays the role of the order parameter; the associated critical exponent is then determined by the above eigenvalue expansion.
△ Less
Submitted 14 June, 2012; v1 submitted 9 July, 2011;
originally announced July 2011.
-
A Vibrational Approach to Node Centrality and Vulnerability in Complex Networks
Authors:
Ernesto Estrada,
Naomichi Hatano
Abstract:
We propose a new measure of vulnerability of a node in a complex network. The measure is based on the analogy in which the nodes of the network are represented by balls and the links are identified with springs. We define the measure as the node displacement, or the amplitude of vibration of each node, under fluctuation due to the thermal bath in which the network is supposed to be submerged. We…
▽ More
We propose a new measure of vulnerability of a node in a complex network. The measure is based on the analogy in which the nodes of the network are represented by balls and the links are identified with springs. We define the measure as the node displacement, or the amplitude of vibration of each node, under fluctuation due to the thermal bath in which the network is supposed to be submerged. We prove exact relations among the thus defined node displacement, the information centrality and the Kirchhoff index. The relation between the first two suggests that the node displacement has a better resolution of the vulnerability than the information centrality, because the latter is the sum of the local node displacement and the node displacement averaged over the entire network.
△ Less
Submitted 21 December, 2009;
originally announced December 2009.
-
Topological Atomic Displacements, Kirchhoff and Wiener Indices of Molecules
Authors:
Ernesto Estrada,
Naomichi Hatano
Abstract:
We provide a physical interpretation of the Kirchhoff index of any molecules as well as of the Wiener index of acyclic ones. For the purpose, we use a local vertex invariant that is obtained from first principles and describes the atomic displacements due to small vibrations/oscillations of atoms from their equilibrium positions. In addition, we show that the topological atomic displacements cor…
▽ More
We provide a physical interpretation of the Kirchhoff index of any molecules as well as of the Wiener index of acyclic ones. For the purpose, we use a local vertex invariant that is obtained from first principles and describes the atomic displacements due to small vibrations/oscillations of atoms from their equilibrium positions. In addition, we show that the topological atomic displacements correlate with the temperature factors (B-factors) of atoms obtained by X-ray crystallography for both organic molecules and biological macromolecules.
△ Less
Submitted 30 December, 2009; v1 submitted 14 December, 2009;
originally announced December 2009.
-
Distribution of Resonant Eigenvalues of Quantum Potential Scattering
Authors:
Naomichi Hatano
Abstract:
We formulate the Born approximation for finding resonance poles in the complex plane for potential scattering problems. Using the method, we study the distribution of resonance poles for several scattering potentials. In particular, we find for an exponential potential with a cutoff that the cutoff generates an infinite series of extra resonance poles below and along the real axis, which would n…
▽ More
We formulate the Born approximation for finding resonance poles in the complex plane for potential scattering problems. Using the method, we study the distribution of resonance poles for several scattering potentials. In particular, we find for an exponential potential with a cutoff that the cutoff generates an infinite series of extra resonance poles below and along the real axis, which would not exist without the cutoff. We also find for a Gaussian potential that the series of resonance poles approach the imaginary axis of the complex energy plane from left. In other words, the real parts of the resonant eigenenergis are all negative.
△ Less
Submitted 13 September, 2009;
originally announced September 2009.
-
Communicability and Communities in Complex Socio-Economic Networks
Authors:
Ernesto Estrada,
Naomichi Hatano
Abstract:
The concept of communicability is introduced for complex socio-economic networks. The communicability function expresses how an impact propagates from one place to another in the network. This function is used to define unambiguously the concept of socio-economic community. The concept of temperature in complex socio-economic networks is also introduced as a way of accounting for the external st…
▽ More
The concept of communicability is introduced for complex socio-economic networks. The communicability function expresses how an impact propagates from one place to another in the network. This function is used to define unambiguously the concept of socio-economic community. The concept of temperature in complex socio-economic networks is also introduced as a way of accounting for the external stresses to which such systems are submitted. This external stress can change dramatically the structure of the communities in a network. We analyze here a trade network of countries exporting 'miscellaneous manufactures of metal.' We determine the community structure of this network showing that there are 27 communities with diverse degree of overlapping. When only communities with less than 80% of overlap are considered we found 5 communities which are well characterized in terms of geopolitical relationships. The analysis of external stress on these communities reveals that several countries are very much influenced by these critical situations, i.e., economical crisis. These weakest links are clearly identified and represent countries that are isolated from the main trade as soon as the external "temperature" of the system is increased. The current approach adds an important tool for the analysis of socio-economic networks in the real-world.
△ Less
Submitted 9 July, 2009;
originally announced July 2009.
-
Communicability Graph and Community Structures in Complex Networks
Authors:
Ernesto Estrada,
Naomichi Hatano
Abstract:
We use the concept of the network communicability (Phys. Rev. E 77 (2008) 036111) to define communities in a complex network. The communities are defined as the cliques of a communicability graph, which has the same set of nodes as the complex network and links determined by the communicability function. Then, the problem of finding the network communities is transformed to an all-clique problem…
▽ More
We use the concept of the network communicability (Phys. Rev. E 77 (2008) 036111) to define communities in a complex network. The communities are defined as the cliques of a communicability graph, which has the same set of nodes as the complex network and links determined by the communicability function. Then, the problem of finding the network communities is transformed to an all-clique problem of the communicability graph. We discuss the efficiency of this algorithm of community detection. In addition, we extend here the concept of the communicability to account for the strength of the interactions between the nodes by using the concept of inverse temperature of the network. Finally, we develop an algorithm to manage the different degrees of overlapping between the communities in a complex network. We then analyze the USA airport network, for which we successfully detect two big communities of the eastern airports and of the western/central airports as well as two bridging central communities. In striking contrast, a well-known algorithm groups all but two of the continental airports into one community.
△ Less
Submitted 25 May, 2009;
originally announced May 2009.
-
Communicability Betweenness in Complex Networks
Authors:
Ernesto Estrada,
Desmond J. Higham,
Naomichi Hatano
Abstract:
Betweenness measures provide quantitative tools to pick out fine details from the massive amount of interaction data that is available from large complex networks. They allow us to study the extent to which a node takes part when information is passed around the network. Nodes with high betweenness may be regarded as key players that have a highly active role. At one extreme, betweenness has bee…
▽ More
Betweenness measures provide quantitative tools to pick out fine details from the massive amount of interaction data that is available from large complex networks. They allow us to study the extent to which a node takes part when information is passed around the network. Nodes with high betweenness may be regarded as key players that have a highly active role. At one extreme, betweenness has been defined by considering information passing only through the shortest paths between pairs of nodes. At the other extreme, an alternative type of betweenness has been defined by considering all possible walks of any length. In this work, we propose a betweenness measure that lies between these two opposing viewpoints. We allow information to pass through all possible routes, but introduce a scaling so that longer walks carry less importance. This new definition shares a similar philosophy to that of communicability for pairs of nodes in a network, which was introduced by Estrada and Hatano (Phys. Rev. E 77 (2008) 036111). Having defined this new communicability betweenness measure, we show that it can be characterized neatly in terms of the exponential of the adjacency matrix. We also show that this measure is closely related to a Frechet derivative of the matrix exponential. This allows us to conclude that it also describes network sensitivity when the edges of a given node are subject to infinitesimally small perturbations. Using illustrative synthetic and real life networks, we show that the new betweenness measure behaves differently to existing versions, and in particular we show that it recovers meaningful biological information from a protein-protein interaction network.
△ Less
Submitted 25 May, 2009;
originally announced May 2009.
-
Communicability and multipartite structures in complex networks at negative absolute temperatures
Authors:
Ernesto Estrada,
Desmond J. Higham,
Naomichi Hatano
Abstract:
We here present a method of clearly identifying multi-partite subgraphs in a network. The method is based on a recently introduced concept of the communicability, which very clearly identifies communities in a complex network. We here show that, while the communicability at a positive temperature is useful in identifying communities, the communicability at a negative temperature is useful in ide…
▽ More
We here present a method of clearly identifying multi-partite subgraphs in a network. The method is based on a recently introduced concept of the communicability, which very clearly identifies communities in a complex network. We here show that, while the communicability at a positive temperature is useful in identifying communities, the communicability at a negative temperature is useful in idenfitying multi-partitite subgraphs; the latter quantity between two nodes is positive when the two nodes belong to the same subgraph and is negative when not. The method is able to discover `almost' multi-partite structures, where inter-community connections vastly outweigh intracommunity connections. We illustrate the relevance of this work to real-life food web and protein-protein interaction networks.
△ Less
Submitted 25 May, 2009;
originally announced May 2009.
-
Tight-binding 'dihedral orbitals' approach to electronic communicability in macromolecular chains
Authors:
Ernesto Estrada,
Naomichi Hatano
Abstract:
An electronic orbital of a dihedral angle of a molecular chain is introduced. A tight-binding Hamiltonian on the basis of the dihedral orbitals is defined. This yields the Green's function between two dihedral angles of the chain. It is revealed that the Green's function, which we refer to as the electronic communicability, is useful in differentiating protein molecules of different types of con…
▽ More
An electronic orbital of a dihedral angle of a molecular chain is introduced. A tight-binding Hamiltonian on the basis of the dihedral orbitals is defined. This yields the Green's function between two dihedral angles of the chain. It is revealed that the Green's function, which we refer to as the electronic communicability, is useful in differentiating protein molecules of different types of conformation and secondary structure.
△ Less
Submitted 25 May, 2009;
originally announced May 2009.
-
Statistical-mechanical approach to subgraph centrality in complex networks
Authors:
Ernesto Estrada,
Naomichi Hatano
Abstract:
We interpret the subgraph centrality as the partition function of a network. The entropy, the internal energy and the Helmholtz free energy are defined for networks and molecular graphs on the basis of graph spectral theory. Various relations of these quantities to the structure and the dynamics of the complex networks are discussed. They include the cohesiveness of the network and the critical…
▽ More
We interpret the subgraph centrality as the partition function of a network. The entropy, the internal energy and the Helmholtz free energy are defined for networks and molecular graphs on the basis of graph spectral theory. Various relations of these quantities to the structure and the dynamics of the complex networks are discussed. They include the cohesiveness of the network and the critical coupling of coupled phase oscillators. We explore several models of network growing/evolution as well as real-world networks, such as those representing metabolic and protein-protein interaction networks as well as the interaction between secondary structure elements in proteins.
△ Less
Submitted 25 May, 2009;
originally announced May 2009.
-
"Clumpiness" Mixing in Complex Networks
Authors:
Ernesto Estrada,
Naomichi Hatano,
Amauri Gutierrez
Abstract:
Three measures of clumpiness of complex networks are introduced. The measures quantify how most central nodes of a network are clumped together. The assortativity coefficient defined in a previous study measures a similar characteristic, but accounts only for the clumpiness of the central nodes that are directly connected to each other. The clumpiness coefficient defined in the present paper als…
▽ More
Three measures of clumpiness of complex networks are introduced. The measures quantify how most central nodes of a network are clumped together. The assortativity coefficient defined in a previous study measures a similar characteristic, but accounts only for the clumpiness of the central nodes that are directly connected to each other. The clumpiness coefficient defined in the present paper also takes into account the cases where central nodes are separated by a few links. The definition is based on the node degrees and the distances between pairs of nodes. The clumpiness coefficient together with the assortativity coefficient can define four classes of network. Numerical calculations demonstrate that the classification scheme successfully categorizes 30 real-world networks into the four classes: clumped assortative, clumped disassortative, loose assortative and loose disassortative networks. The clumpiness coefficient also differentiates the Erdos-Renyi model from the Barabasi-Albert model, which the assortativity coefficient could not differentiate. In addition, the bounds of the clumpiness coefficient as well as the relationships between the three measures of clumpiness are discussed.
△ Less
Submitted 25 May, 2009;
originally announced May 2009.
-
Communicability in complex networks
Authors:
Ernesto Estrada,
Naomichi Hatano
Abstract:
Many topological and dynamical properties of complex networks are defined by assuming that most of the transport on the network flows along the shortest paths. However, there are different scenarios in which non-shortest paths are used to reach the network destination. Thus the consideration of the shortest paths only does not account for the global communicability of a complex network. Here we…
▽ More
Many topological and dynamical properties of complex networks are defined by assuming that most of the transport on the network flows along the shortest paths. However, there are different scenarios in which non-shortest paths are used to reach the network destination. Thus the consideration of the shortest paths only does not account for the global communicability of a complex network. Here we propose a new measure of the communicability of a complex network, which is a broad generalization of the concept of the shortest path. According to the new measure, most of real-world networks display the largest communicability between the most connected (popular) nodes of the network (assortative communicability). There are also several networks with the disassortative communicability, where the most "popular" nodes communicate very poorly to each other. Using this information we classify a diverse set of real-world complex systems into a small number of universality classes based on their structure-dynamic correlation. In addition, the new communicability measure is able to distinguish finer structures of networks, such as communities into which a network is divided. A community is unambiguously defined here as a set of nodes displaying larger communicability among them than to the rest of nodes in the network.
△ Less
Submitted 5 July, 2007;
originally announced July 2007.
-
Some properties of the resonant state in quantum mechanics and its computation
Authors:
Naomichi Hatano,
Keita Sasada,
Hiroaki Nakamura,
Tomio Petrosky
Abstract:
The resonant state of the open quantum system is studied from the viewpoint of the outgoing momentum flux. We show that the number of particles is conserved for a resonant state, if we use an expanding volume of integration in order to take account of the outgoing momentum flux; the number of particles would decay exponentially in a fixed volume of integration. Moreover, we introduce new numeric…
▽ More
The resonant state of the open quantum system is studied from the viewpoint of the outgoing momentum flux. We show that the number of particles is conserved for a resonant state, if we use an expanding volume of integration in order to take account of the outgoing momentum flux; the number of particles would decay exponentially in a fixed volume of integration. Moreover, we introduce new numerical methods of treating the resonant state with the use of the effective potential. We first give a numerical method of finding a resonance pole in the complex energy plane. The method seeks an energy eigenvalue iteratively. We found that our method leads to a super-convergence, the convergence exponential with respect to the iteration step. The present method is completely independent of commonly used complex scaling. We also give a numerical trick for computing the time evolution of the resonant state in a limited spatial area. Since the wave function of the resonant state is diverging away from the scattering potential, it has been previously difficult to follow its time evolution numerically in a finite area.
△ Less
Submitted 6 August, 2007; v1 submitted 10 May, 2007;
originally announced May 2007.
-
A microscopic model of triangular arbitrage
Authors:
Y. Aiba,
N. Hatano
Abstract:
We introduce a microscopic model which describes the dynamics of each dealer in multiple foreign exchange markets, taking account of the triangular arbitrage transaction. The model reproduces the interaction among the markets well. We explore the relation between the parameters of the present microscopic model and the spring constant of a macroscopic model that we proposed previously.
We introduce a microscopic model which describes the dynamics of each dealer in multiple foreign exchange markets, taking account of the triangular arbitrage transaction. The model reproduces the interaction among the markets well. We explore the relation between the parameters of the present microscopic model and the spring constant of a macroscopic model that we proposed previously.
△ Less
Submitted 24 February, 2006;
originally announced February 2006.
-
Finding Exponential Product Formulas of Higher Orders
Authors:
Naomichi Hatano,
Masuo Suzuki
Abstract:
In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves important symmetries of the system dynamics. We focuse on two algorithms of constructing higher-order exponential product formulas. The first is the fractal d…
▽ More
In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves important symmetries of the system dynamics. We focuse on two algorithms of constructing higher-order exponential product formulas. The first is the fractal decomposition, where we construct higher-order formulas recursively. The second is to make use of the quantum analysis, where we compute higher-order correction terms directly. As interludes, we also have described the decomposition of symplectic integrators, the approximation of time-ordered exponentials, and the perturbational composition.
△ Less
Submitted 2 June, 2005;
originally announced June 2005.