Baptiste Lafoux, Paul Bernard, Benjamin Thiria, Ramiro Godoy-Diana
We investigate the impact of confinement density (i.e the number of individuals in a group per unit area of available space) on transitions from polarized to milling state, using groups of rummy-nose tetrafish (Hemigrammus rhodostomus) under controlled experimental conditions. We demonstrate for the first time a continuous state transition controlled by confinement density in a group of live animals. During this transition, the school exhibits a bistable state, wherein both polarization and milling states coexist, with the group randomly alternating between them. A simple two-state Markov process describes the observed transition remarkably well. Importantly, the confinement density influences the statistics of this bistability, shaping the distribution of transition times between states. Our findings suggest that confinement plays a crucial role in state transitions for moving animal groups, and, more generally, they constitute a solid experimental benchmark for active matter models of macroscopic, self-propelled, confined agents.
{"title":"Confinement-driven state transition and bistability in schooling fish","authors":"Baptiste Lafoux, Paul Bernard, Benjamin Thiria, Ramiro Godoy-Diana","doi":"arxiv-2401.01850","DOIUrl":"https://doi.org/arxiv-2401.01850","url":null,"abstract":"We investigate the impact of confinement density (i.e the number of\u0000individuals in a group per unit area of available space) on transitions from\u0000polarized to milling state, using groups of rummy-nose tetrafish (Hemigrammus\u0000rhodostomus) under controlled experimental conditions. We demonstrate for the\u0000first time a continuous state transition controlled by confinement density in a\u0000group of live animals. During this transition, the school exhibits a bistable\u0000state, wherein both polarization and milling states coexist, with the group\u0000randomly alternating between them. A simple two-state Markov process describes\u0000the observed transition remarkably well. Importantly, the confinement density\u0000influences the statistics of this bistability, shaping the distribution of\u0000transition times between states. Our findings suggest that confinement plays a\u0000crucial role in state transitions for moving animal groups, and, more\u0000generally, they constitute a solid experimental benchmark for active matter\u0000models of macroscopic, self-propelled, confined agents.","PeriodicalId":501305,"journal":{"name":"arXiv - PHYS - Adaptation and Self-Organizing Systems","volume":"64 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139096399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mining the hierarchical structure of Internet review topics and realizing a fine classification of review texts can help alleviate users' information overload. However, existing hierarchical topic classification methods primarily rely on external corpora and human intervention. This study proposes a Modified Continuous Renormalization (MCR) procedure that acts on the keyword co-occurrence network with fractal characteristics to achieve the topic hierarchy mining. First, the fractal characteristics in the keyword co-occurrence network of Internet review text are identified using a box-covering algorithm for the first time. Then, the MCR algorithm established on the edge adjacency entropy and the box distance is proposed to obtain the topic hierarchy in the keyword co-occurrence network. Verification data from the Dangdang.com book reviews shows that the MCR constructs topic hierarchies with greater coherence and independence than the HLDA and the Louvain algorithms. Finally, reliable review text classification is achieved using the MCR extended bottom level topic categories. The accuracy rate (P), recall rate (R) and F1 value of Internet review text classification obtained from the MCR-based topic hierarchy are significantly improved compared to four target text classification algorithms.
{"title":"An internet reviews topic hierarchy mining method based on modified continuous renormalization procedure","authors":"Lin Qi, Feiyan Guo, Jian Zhang, Yuwei Wang","doi":"arxiv-2401.01118","DOIUrl":"https://doi.org/arxiv-2401.01118","url":null,"abstract":"Mining the hierarchical structure of Internet review topics and realizing a\u0000fine classification of review texts can help alleviate users' information\u0000overload. However, existing hierarchical topic classification methods primarily\u0000rely on external corpora and human intervention. This study proposes a Modified\u0000Continuous Renormalization (MCR) procedure that acts on the keyword\u0000co-occurrence network with fractal characteristics to achieve the topic\u0000hierarchy mining. First, the fractal characteristics in the keyword\u0000co-occurrence network of Internet review text are identified using a\u0000box-covering algorithm for the first time. Then, the MCR algorithm established\u0000on the edge adjacency entropy and the box distance is proposed to obtain the\u0000topic hierarchy in the keyword co-occurrence network. Verification data from\u0000the Dangdang.com book reviews shows that the MCR constructs topic hierarchies\u0000with greater coherence and independence than the HLDA and the Louvain\u0000algorithms. Finally, reliable review text classification is achieved using the\u0000MCR extended bottom level topic categories. The accuracy rate (P), recall rate\u0000(R) and F1 value of Internet review text classification obtained from the\u0000MCR-based topic hierarchy are significantly improved compared to four target\u0000text classification algorithms.","PeriodicalId":501305,"journal":{"name":"arXiv - PHYS - Adaptation and Self-Organizing Systems","volume":"407 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139083716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Reasonably large perturbations may push a power grid from its stable synchronous state into an undesirable state. Identifying vulnerabilities in power grids by studying power grid stability against such perturbations can aid in preventing future blackouts. We use two stability measures $unicode{x2014}$ stability bound, which deals with a system's asymptotic behaviour, and survivability bound, which deals with a system's transient behaviour, to provide information about the strength of perturbations that destabilize the system. Using these stability measures, we have found that certain nodes in tree-like structures have low asymptotic stability, while nodes with a high number of connections generally have low transient stability.
{"title":"How Network Topology Affects the Strength of Dangerous Power Grid Perturbations","authors":"Calvin Alvares, Soumitro Banerjee","doi":"arxiv-2401.00552","DOIUrl":"https://doi.org/arxiv-2401.00552","url":null,"abstract":"Reasonably large perturbations may push a power grid from its stable\u0000synchronous state into an undesirable state. Identifying vulnerabilities in\u0000power grids by studying power grid stability against such perturbations can aid\u0000in preventing future blackouts. We use two stability measures $unicode{x2014}$\u0000stability bound, which deals with a system's asymptotic behaviour, and\u0000survivability bound, which deals with a system's transient behaviour, to\u0000provide information about the strength of perturbations that destabilize the\u0000system. Using these stability measures, we have found that certain nodes in\u0000tree-like structures have low asymptotic stability, while nodes with a high\u0000number of connections generally have low transient stability.","PeriodicalId":501305,"journal":{"name":"arXiv - PHYS - Adaptation and Self-Organizing Systems","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139079497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We study populations of oscillators, all-to-all coupled by means of quenched disordered phase shifts. While there is no traditional synchronization transition with a nonvanishing Kuramoto order parameter, the system demonstrates a specific order as the coupling strength increases. This order is characterized by partial phase locking, which is put into evidence by the introduced correlation order parameter and via frequency entrainment. Simulations with phase oscillators, Stuart-Landau oscillators, and chaotic Roessler oscillators demonstrate similar scaling of the correlation order parameter with the coupling and the system size and also similar behavior of the frequencies with maximal entrainment at some finite coupling.
{"title":"Dynamics of oscillator populations with disorder in the coupling phase shifts","authors":"Arkady Pikovsky, Franco Bagnoli","doi":"arxiv-2401.00281","DOIUrl":"https://doi.org/arxiv-2401.00281","url":null,"abstract":"We study populations of oscillators, all-to-all coupled by means of quenched\u0000disordered phase shifts. While there is no traditional synchronization\u0000transition with a nonvanishing Kuramoto order parameter, the system\u0000demonstrates a specific order as the coupling strength increases. This order is\u0000characterized by partial phase locking, which is put into evidence by the\u0000introduced correlation order parameter and via frequency entrainment.\u0000Simulations with phase oscillators, Stuart-Landau oscillators, and chaotic\u0000Roessler oscillators demonstrate similar scaling of the correlation order\u0000parameter with the coupling and the system size and also similar behavior of\u0000the frequencies with maximal entrainment at some finite coupling.","PeriodicalId":501305,"journal":{"name":"arXiv - PHYS - Adaptation and Self-Organizing Systems","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139079445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We investigate the role of the spectral dimension $d_s$ in determining the universality of phase transitions on a complex network. Due to its structural heterogeneity, a complex network generally acts as a disordered system. Specifically, we study the synchronization and entrainment transitions in the nonequilibrium dynamics of the Kuramoto model and the phase transition of the equilibrium dynamics of the classical $XY$ model, thereby covering a broad spectrum from nonlinear dynamics to statistical and condensed matter physics. Using linear theory, we obtain a general relationship between the dynamics occurring on the network and the underlying network properties. This yields the lower critical spectral dimension of the phase synchronization and entrainment transitions in the Kuramoto model as $d_s=4$ and $d_s=2$ respectively, whereas for the phase transition in the $XY$ model it is $d_s=2$. To test our theoretical hypotheses, we employ a network where any two nodes on the network are connected with a probability proportional to a power law of the distance between the nodes; this realizes any desired $d_sin [1, infty)$. Our detailed numerical study agrees well with the prediction of linear theory for the phase synchronization transition in the Kuramoto model. However, it shows a clear entrainment transition in the Kuramoto model and phase transition in the $XY$ model at $d_s gtrsim 3$, not $d_s=2$ as predicted by linear theory. Our study indicates that network disorder in the region $2 leq d_s lesssim 3$ seems to be relevant and have a profound effect on the dynamics.
{"title":"Universality of critical dynamics on a complex network","authors":"Mrinal Sarkar, Tilman Enss, Nicolò Defenu","doi":"arxiv-2401.00092","DOIUrl":"https://doi.org/arxiv-2401.00092","url":null,"abstract":"We investigate the role of the spectral dimension $d_s$ in determining the\u0000universality of phase transitions on a complex network. Due to its structural\u0000heterogeneity, a complex network generally acts as a disordered system.\u0000Specifically, we study the synchronization and entrainment transitions in the\u0000nonequilibrium dynamics of the Kuramoto model and the phase transition of the\u0000equilibrium dynamics of the classical $XY$ model, thereby covering a broad\u0000spectrum from nonlinear dynamics to statistical and condensed matter physics.\u0000Using linear theory, we obtain a general relationship between the dynamics\u0000occurring on the network and the underlying network properties. This yields the\u0000lower critical spectral dimension of the phase synchronization and entrainment\u0000transitions in the Kuramoto model as $d_s=4$ and $d_s=2$ respectively, whereas\u0000for the phase transition in the $XY$ model it is $d_s=2$. To test our\u0000theoretical hypotheses, we employ a network where any two nodes on the network\u0000are connected with a probability proportional to a power law of the distance\u0000between the nodes; this realizes any desired $d_sin [1, infty)$. Our detailed\u0000numerical study agrees well with the prediction of linear theory for the phase\u0000synchronization transition in the Kuramoto model. However, it shows a clear\u0000entrainment transition in the Kuramoto model and phase transition in the $XY$\u0000model at $d_s gtrsim 3$, not $d_s=2$ as predicted by linear theory. Our study\u0000indicates that network disorder in the region $2 leq d_s lesssim 3$ seems to\u0000be relevant and have a profound effect on the dynamics.","PeriodicalId":501305,"journal":{"name":"arXiv - PHYS - Adaptation and Self-Organizing Systems","volume":"103 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139079889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Human crowds exhibit a wide range of interesting patterns, and measuring them is of great interest in areas ranging from psychology and social science to civil engineering. While textit{in situ} measurements of human crowd patterns require large amounts of time and labor to obtain, human crowd experiments may result in statistics different from those that would emerge with a naturally emerging crowd. Here we present a simple, broadly applicable, highly accurate human crowd tracking technique to extract high-fidelity kinematic information from widely available surveillance camera videos. With the proposed technique, researchers can access scientific crowd data on a scale that is orders of magnitude larger than before. In addition to being able to measure an individual's time-resolved position and velocity, our technique also offers high validity time-resolved acceleration and step frequency, and step length. We demonstrate the applicability of our technique by applying it to surveillance camera videos in Tokyo Shinjuku streamed on YouTube and exploiting its high fidelity to expose the hidden contribution of walking speed variance at the crossroad. The high fidelity and simplicity of this powerful technique open up the way to utilize the large volume of existing surveillance camera data around the world for scientific studies.
{"title":"High Fidelity Human Trajectory Tracking Based on Surveillance Camera Data","authors":"Zexu Li, Lei Fang","doi":"arxiv-2312.16328","DOIUrl":"https://doi.org/arxiv-2312.16328","url":null,"abstract":"Human crowds exhibit a wide range of interesting patterns, and measuring them\u0000is of great interest in areas ranging from psychology and social science to\u0000civil engineering. While textit{in situ} measurements of human crowd patterns\u0000require large amounts of time and labor to obtain, human crowd experiments may\u0000result in statistics different from those that would emerge with a naturally\u0000emerging crowd. Here we present a simple, broadly applicable, highly accurate\u0000human crowd tracking technique to extract high-fidelity kinematic information\u0000from widely available surveillance camera videos. With the proposed technique,\u0000researchers can access scientific crowd data on a scale that is orders of\u0000magnitude larger than before. In addition to being able to measure an\u0000individual's time-resolved position and velocity, our technique also offers\u0000high validity time-resolved acceleration and step frequency, and step length.\u0000We demonstrate the applicability of our technique by applying it to\u0000surveillance camera videos in Tokyo Shinjuku streamed on YouTube and exploiting\u0000its high fidelity to expose the hidden contribution of walking speed variance\u0000at the crossroad. The high fidelity and simplicity of this powerful technique\u0000open up the way to utilize the large volume of existing surveillance camera\u0000data around the world for scientific studies.","PeriodicalId":501305,"journal":{"name":"arXiv - PHYS - Adaptation and Self-Organizing Systems","volume":"49 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139064847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The main purpose of this paper is to attract the attention of researchers working in the field of physiological processes, towards crucial events. Crucial events are often confused with extreme events thereby generating the misleading impression that their treatment should be based on quantum mechanical formalism. We show that crucial events are invisible and should not be confused with catastrophes. Crucial events are generated by self-organization processes yielding a form of swarm intelligence, and signal their action with fluctuations characterized by anomalous scaling and 1/f spectrum. The existence or the lack of crucial events can be revealed with an entropic method of analysis called the Diffusion Entropy Analysis (DEA). However, anomalous scaling and 1/f spectrum are not a compelling signature of efficient self-organization, and physiological processes with anomalous scaling and 1/f noise spectrum without crucial events are a signature of collapsing physiological organizations. In the case of physiological processes like cancer dynamics, the existence of crucial events is a signal of intelligence that must be destroyed rather than reinforced.
{"title":"Search for crucial events in physiological processes","authors":"Yawer Hussain Shah, Paolo Grigolini","doi":"arxiv-2312.15875","DOIUrl":"https://doi.org/arxiv-2312.15875","url":null,"abstract":"The main purpose of this paper is to attract the attention of researchers\u0000working in the field of physiological processes, towards crucial events.\u0000Crucial events are often confused with extreme events thereby generating the\u0000misleading impression that their treatment should be based on quantum\u0000mechanical formalism. We show that crucial events are invisible and should not\u0000be confused with catastrophes. Crucial events are generated by\u0000self-organization processes yielding a form of swarm intelligence, and signal\u0000their action with fluctuations characterized by anomalous scaling and 1/f\u0000spectrum. The existence or the lack of crucial events can be revealed with an\u0000entropic method of analysis called the Diffusion Entropy Analysis (DEA).\u0000However, anomalous scaling and 1/f spectrum are not a compelling signature of\u0000efficient self-organization, and physiological processes with anomalous scaling\u0000and 1/f noise spectrum without crucial events are a signature of collapsing\u0000physiological organizations. In the case of physiological processes like cancer\u0000dynamics, the existence of crucial events is a signal of intelligence that must\u0000be destroyed rather than reinforced.","PeriodicalId":501305,"journal":{"name":"arXiv - PHYS - Adaptation and Self-Organizing Systems","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139055866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This study proposes a physics-informed convolutional neural network (CNN) for identifying dynamical systems' time series near a fold bifurcation. The peculiarity of this work is that the CNN is trained with a relatively small amount of data and on a single, very simple system. In contrast, the CNN is validated on much more complicated systems. A similar task requires significant extrapolation capabilities, which are obtained by exploiting physics-based information. Physics-based information is provided through a specific pre-processing of the input data, consisting mostly of a transformation into polar coordinates, normalization, transformation into the logarithmic scale, and filtering through a moving mean. The results illustrate that such data pre-processing enables the CNN to grasp the important features related to approaching a fold bifurcation, namely, the trend of the oscillation amplitude, and neglect other characteristics that are not particularly relevant, such as the vibration frequency. The developed CNN was able to correctly classify trajectories near a fold for a mass-on-moving-belt system, a van der Pol-Duffing oscillator with an attached tuned mass damper, and a pitch-and-plunge wing profile. The results obtained pave the way for the development of similar CNNs effective in real-life applications.
{"title":"Forecasting Fold Bifurcations through Physics-Informed Convolutional Neural Networks","authors":"Giuseppe Habib, Ádám Horváth","doi":"arxiv-2312.14210","DOIUrl":"https://doi.org/arxiv-2312.14210","url":null,"abstract":"This study proposes a physics-informed convolutional neural network (CNN) for\u0000identifying dynamical systems' time series near a fold bifurcation. The\u0000peculiarity of this work is that the CNN is trained with a relatively small\u0000amount of data and on a single, very simple system. In contrast, the CNN is\u0000validated on much more complicated systems. A similar task requires significant\u0000extrapolation capabilities, which are obtained by exploiting physics-based\u0000information. Physics-based information is provided through a specific\u0000pre-processing of the input data, consisting mostly of a transformation into\u0000polar coordinates, normalization, transformation into the logarithmic scale,\u0000and filtering through a moving mean. The results illustrate that such data\u0000pre-processing enables the CNN to grasp the important features related to\u0000approaching a fold bifurcation, namely, the trend of the oscillation amplitude,\u0000and neglect other characteristics that are not particularly relevant, such as\u0000the vibration frequency. The developed CNN was able to correctly classify\u0000trajectories near a fold for a mass-on-moving-belt system, a van der\u0000Pol-Duffing oscillator with an attached tuned mass damper, and a\u0000pitch-and-plunge wing profile. The results obtained pave the way for the\u0000development of similar CNNs effective in real-life applications.","PeriodicalId":501305,"journal":{"name":"arXiv - PHYS - Adaptation and Self-Organizing Systems","volume":"33 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139035759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yuan-Hang Zhang, Chesson Sipling, Erbin Qiu, Ivan K. Schuller, Massimiliano Di Ventra
In the pursuit of scalable and energy-efficient neuromorphic devices, recent research has unveiled a novel category of spiking oscillators, termed ``thermal neuristors." These devices function via thermal interactions among neighboring vanadium dioxide resistive memories, closely mimicking the behavior of biological neurons. Here, we show that the collective dynamical behavior of networks of these neurons showcases a rich phase structure, tunable by adjusting the thermal coupling and input voltage. Notably, we have identified phases exhibiting long-range order that, however, does not arise from criticality, but rather from the time non-local response of the system. In addition, we show that these thermal neuristor arrays achieve high accuracy in image recognition tasks through reservoir computing, without taking advantage of this long-range order. Our findings highlight a crucial aspect of neuromorphic computing with possible implications on the functioning of the brain: criticality may not be necessary for the efficient performance of neuromorphic systems in certain computational tasks.
{"title":"Collective dynamics and long-range order in thermal neuristor networks","authors":"Yuan-Hang Zhang, Chesson Sipling, Erbin Qiu, Ivan K. Schuller, Massimiliano Di Ventra","doi":"arxiv-2312.12899","DOIUrl":"https://doi.org/arxiv-2312.12899","url":null,"abstract":"In the pursuit of scalable and energy-efficient neuromorphic devices, recent\u0000research has unveiled a novel category of spiking oscillators, termed ``thermal\u0000neuristors.\" These devices function via thermal interactions among neighboring\u0000vanadium dioxide resistive memories, closely mimicking the behavior of\u0000biological neurons. Here, we show that the collective dynamical behavior of\u0000networks of these neurons showcases a rich phase structure, tunable by\u0000adjusting the thermal coupling and input voltage. Notably, we have identified\u0000phases exhibiting long-range order that, however, does not arise from\u0000criticality, but rather from the time non-local response of the system. In\u0000addition, we show that these thermal neuristor arrays achieve high accuracy in\u0000image recognition tasks through reservoir computing, without taking advantage\u0000of this long-range order. Our findings highlight a crucial aspect of\u0000neuromorphic computing with possible implications on the functioning of the\u0000brain: criticality may not be necessary for the efficient performance of\u0000neuromorphic systems in certain computational tasks.","PeriodicalId":501305,"journal":{"name":"arXiv - PHYS - Adaptation and Self-Organizing Systems","volume":"50 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138823996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Growing interest in modelling complex systems from brains to societies to cities using networks has led to increased efforts to describe generative processes that explain those networks. Recent successes in machine learning have prompted the usage of evolutionary computation, especially genetic programming to evolve computer programs that effectively forage a multidimensional search space to iteratively find better solutions that explain network structure. Symbolic regression contributes to these approaches by replicating network morphologies using both structure and processes, all while not relying on the scientists intuition or expertise. It distinguishes itself by introducing a novel formulation of a network generator and a parameter-free fitness function to evaluate the generated network and is found to consistently retrieve synthetically generated growth processes as well as simple, interpretable rules for a range of empirical networks. We extend this approach by modifying generator semantics to create and retrieve rules for time-varying networks. Lexicon to study networks created dynamically in multiple stages is introduced. The framework was improved using methods from the genetic programming toolkit (recombination) and computational improvements (using heuristic distance measures) and used to test the consistency and robustness of the upgrades to the semantics using synthetically generated networks. Using recombination was found to improve retrieval rate and fitness of the solutions. The framework was then used on three empirical datasets - subway networks of major cities, regions of street networks and semantic co-occurrence networks of literature in Artificial Intelligence to illustrate the possibility of obtaining interpretable, decentralised growth processes from complex networks.
{"title":"Symbolic Regression of Dynamic Network Models","authors":"Govind Gandhi","doi":"arxiv-2401.05369","DOIUrl":"https://doi.org/arxiv-2401.05369","url":null,"abstract":"Growing interest in modelling complex systems from brains to societies to\u0000cities using networks has led to increased efforts to describe generative\u0000processes that explain those networks. Recent successes in machine learning\u0000have prompted the usage of evolutionary computation, especially genetic\u0000programming to evolve computer programs that effectively forage a\u0000multidimensional search space to iteratively find better solutions that explain\u0000network structure. Symbolic regression contributes to these approaches by\u0000replicating network morphologies using both structure and processes, all while\u0000not relying on the scientists intuition or expertise. It distinguishes itself\u0000by introducing a novel formulation of a network generator and a parameter-free\u0000fitness function to evaluate the generated network and is found to consistently\u0000retrieve synthetically generated growth processes as well as simple,\u0000interpretable rules for a range of empirical networks. We extend this approach\u0000by modifying generator semantics to create and retrieve rules for time-varying\u0000networks. Lexicon to study networks created dynamically in multiple stages is\u0000introduced. The framework was improved using methods from the genetic\u0000programming toolkit (recombination) and computational improvements (using\u0000heuristic distance measures) and used to test the consistency and robustness of\u0000the upgrades to the semantics using synthetically generated networks. Using\u0000recombination was found to improve retrieval rate and fitness of the solutions.\u0000The framework was then used on three empirical datasets - subway networks of\u0000major cities, regions of street networks and semantic co-occurrence networks of\u0000literature in Artificial Intelligence to illustrate the possibility of\u0000obtaining interpretable, decentralised growth processes from complex networks.","PeriodicalId":501305,"journal":{"name":"arXiv - PHYS - Adaptation and Self-Organizing Systems","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139462913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：