<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:dcterms="http://purl.org/dc/terms/"
 xmlns:cc="http://web.resource.org/cc/"
 xmlns:prism="http://prismstandard.org/namespaces/basic/2.0/"
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns:admin="http://webns.net/mvcb/"
 xmlns:content="http://purl.org/rss/1.0/modules/content/">
    <channel rdf:about="https://www.mdpi.com/rss/journal/complexities">
		<title>Complexities</title>
		<description>Latest open access articles published in Complexities at https://www.mdpi.com/journal/complexities</description>
		<link>https://www.mdpi.com/journal/complexities</link>
		<admin:generatorAgent rdf:resource="https://www.mdpi.com/journal/complexities"/>
		<admin:errorReportsTo rdf:resource="mailto:support@mdpi.com"/>
		<dc:publisher>MDPI</dc:publisher>
		<dc:language>en</dc:language>
		<dc:rights>Creative Commons Attribution (CC-BY)</dc:rights>
						<prism:copyright>MDPI</prism:copyright>
		<prism:rightsAgent>support@mdpi.com</prism:rightsAgent>
		<image rdf:resource="https://pub.mdpi-res.com/img/design/mdpi-pub-logo.png?13cf3b5bd783e021?1786617101"/>
				<items>
			<rdf:Seq>
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/3/17" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/3/16" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/2/15" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/2/14" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/2/13" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/2/12" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/2/11" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/2/10" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/2/9" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/2/8" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/1/7" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/1/6" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/1/5" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/1/4" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/1/3" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/1/2" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/2/1/1" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/1/1/7" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/1/1/6" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/1/1/5" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/1/1/4" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/1/1/3" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/1/1/2" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-6448/1/1/1" />
                    	</rdf:Seq>
		</items>
				<cc:license rdf:resource="https://creativecommons.org/licenses/by/4.0/" />
	</channel>

        <item rdf:about="https://www.mdpi.com/3042-6448/2/3/17">

	<title>Complexities, Vol. 2, Pages 17: Survival Probability of Random Networks</title>
	<link>https://www.mdpi.com/3042-6448/2/3/17</link>
	<description>In this work, we study in detail all phases of the time evolution of a delta-like excitation in Erd&amp;amp;ouml;s&amp;amp;ndash;Renyi (ER) random networks by means of the survival probability (SP): The initial decay of the SP (both, the fast decay followed by the power-law decay), the correlation hole regime (the regime between the minimum value of the SP and its saturation value), and the saturation of the SP. Specifically, we find that just before reaching the correlation hole, (i) the power-law decay of the SP is proportional to t&amp;amp;minus;D2 and t&amp;amp;minus;D&amp;amp;tilde;2 (in a short time window) and the power-law decay of the time-averaged SP is proportional to t&amp;amp;minus;D&amp;amp;tilde;2 (where D2 and D&amp;amp;tilde;2 are the correlation dimension of the eigenstates of the randomly weighted adjacency matrices of the ER random networks and the correlation dimension associated with the initial state, respectively); however, this agreement is only approximate, depends on the average degree &amp;amp;#10216;k&amp;amp;#10217;, and is limited to short time windows, and (ii) the relative depth of the correlation hole of the SP scales with the average degree &amp;amp;#10216;k&amp;amp;#10217;&amp;amp;asymp;np (here, n and p are the size and the connection probability of the ER random networks). In addition, we show that the eigenstates of the randomly weighted adjacency matrices of ER networks display clear multifractal properties.</description>
	<pubDate>2026-08-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 17: Survival Probability of Random Networks</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/3/17">doi: 10.3390/complexities2030017</a></p>
	<p>Authors:
		Kevin Peralta-Martínez
		José A. Méndez-Bermúdez
		</p>
	<p>In this work, we study in detail all phases of the time evolution of a delta-like excitation in Erd&amp;amp;ouml;s&amp;amp;ndash;Renyi (ER) random networks by means of the survival probability (SP): The initial decay of the SP (both, the fast decay followed by the power-law decay), the correlation hole regime (the regime between the minimum value of the SP and its saturation value), and the saturation of the SP. Specifically, we find that just before reaching the correlation hole, (i) the power-law decay of the SP is proportional to t&amp;amp;minus;D2 and t&amp;amp;minus;D&amp;amp;tilde;2 (in a short time window) and the power-law decay of the time-averaged SP is proportional to t&amp;amp;minus;D&amp;amp;tilde;2 (where D2 and D&amp;amp;tilde;2 are the correlation dimension of the eigenstates of the randomly weighted adjacency matrices of the ER random networks and the correlation dimension associated with the initial state, respectively); however, this agreement is only approximate, depends on the average degree &amp;amp;#10216;k&amp;amp;#10217;, and is limited to short time windows, and (ii) the relative depth of the correlation hole of the SP scales with the average degree &amp;amp;#10216;k&amp;amp;#10217;&amp;amp;asymp;np (here, n and p are the size and the connection probability of the ER random networks). In addition, we show that the eigenstates of the randomly weighted adjacency matrices of ER networks display clear multifractal properties.</p>
	]]></content:encoded>

	<dc:title>Survival Probability of Random Networks</dc:title>
			<dc:creator>Kevin Peralta-Martínez</dc:creator>
			<dc:creator>José A. Méndez-Bermúdez</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2030017</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-08-07</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-08-07</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>17</prism:startingPage>
		<prism:doi>10.3390/complexities2030017</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/3/17</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/3/16">

	<title>Complexities, Vol. 2, Pages 16: A Simple Model for Self-Propelled Liquid Surfers</title>
	<link>https://www.mdpi.com/3042-6448/2/3/16</link>
	<description>Self-propelled liquid droplets floating on water&amp;amp;ndash;air interfaces can exhibit dynamics far richer than steady translation. We develop a simple nonlinear framework for such liquid surfers by connecting Marangoni-driven hydrodynamics with low-dimensional dynamical modeling. Using the Lorentz reciprocal theorem, we show that the droplet velocity is determined primarily by the surface-tension difference across the droplet at the water&amp;amp;ndash;air interface, depending on the relaxation length scales in the concentration and velocity fields along the interface. Coupling this result with interfacial transport yields a reduced velocity equation with a pitchfork bifurcation from rest to steady propulsion. Extending the model to include two relaxing force components further yields a minimal three-variable model that reproduces stable propulsion, back-and-forth motion, and more complex dynamics. This framework provides a compact basis for understanding and classifying the dynamics of self-propelled liquid droplets.</description>
	<pubDate>2026-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 16: A Simple Model for Self-Propelled Liquid Surfers</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/3/16">doi: 10.3390/complexities2030016</a></p>
	<p>Authors:
		Ayase Kawamura
		Yuki Araya
		Hiroyuki Kitahata
		Shinpei Tanaka
		</p>
	<p>Self-propelled liquid droplets floating on water&amp;amp;ndash;air interfaces can exhibit dynamics far richer than steady translation. We develop a simple nonlinear framework for such liquid surfers by connecting Marangoni-driven hydrodynamics with low-dimensional dynamical modeling. Using the Lorentz reciprocal theorem, we show that the droplet velocity is determined primarily by the surface-tension difference across the droplet at the water&amp;amp;ndash;air interface, depending on the relaxation length scales in the concentration and velocity fields along the interface. Coupling this result with interfacial transport yields a reduced velocity equation with a pitchfork bifurcation from rest to steady propulsion. Extending the model to include two relaxing force components further yields a minimal three-variable model that reproduces stable propulsion, back-and-forth motion, and more complex dynamics. This framework provides a compact basis for understanding and classifying the dynamics of self-propelled liquid droplets.</p>
	]]></content:encoded>

	<dc:title>A Simple Model for Self-Propelled Liquid Surfers</dc:title>
			<dc:creator>Ayase Kawamura</dc:creator>
			<dc:creator>Yuki Araya</dc:creator>
			<dc:creator>Hiroyuki Kitahata</dc:creator>
			<dc:creator>Shinpei Tanaka</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2030016</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-07-30</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-07-30</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>16</prism:startingPage>
		<prism:doi>10.3390/complexities2030016</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/3/16</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/2/15">

	<title>Complexities, Vol. 2, Pages 15: Identifying Energy Communities of Practice on Twitter: A Multiplex Network Analysis Using Graph Traversal Techniques</title>
	<link>https://www.mdpi.com/3042-6448/2/2/15</link>
	<description>In this work, we inspected the friendship network on Twitter (recently rebranded as X), concentrating on individuals and organizations intertwined with the energy field. We particularly focus on seasoned professionals, corporate entities, and domain specialists, all connected through &amp;amp;lsquo;following&amp;amp;rsquo; relationships. By meticulously examining these ties, we uncover several distinct groupings within the network, each defined by the unique roles its members occupy. Our analysis demonstrates that the natural emergence of such clusters on social platforms exerts a profound influence on public discourse regarding energy and other critical matters, including climate change. Furthermore, we observe that the resulting communities exhibit distinct structural properties and communication patterns, with some clusters showing lower internal engagement, which may be indicative of fragmentation dynamics in online conversations. These emergent clusters, characterized by their shared communication styles, form relatively compact communities where the exchange of information is infrequent compared to larger networks and is usually confined to accounts created for specific commercial objectives. We emphasize that our analysis focuses on a structurally coherent connected component emerging from a curated set of energy-related seed accounts, rather than attempting to reconstruct the entirety of the energy discourse on Twitter. Consequently, peripheral or weakly connected communities may be underrepresented. Additionally, by combining machine-learning-based node classification with graph-based centrality measures, we are able to characterize the roles of structurally central actors within these niche segments and analyze the connectivity patterns that define their positions. This method provides novel insights into how corporate communication unfolds on social media, offering a refreshed perspective on professional networking. Ultimately, our findings highlight the ways in which companies within the energy sector take advantage of Twitter to coordinate their initiatives, with key institutions serving as central nodes in maintaining the organization of these networks.</description>
	<pubDate>2026-06-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 15: Identifying Energy Communities of Practice on Twitter: A Multiplex Network Analysis Using Graph Traversal Techniques</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/2/15">doi: 10.3390/complexities2020015</a></p>
	<p>Authors:
		Vincenzo De Leo
		Michelangelo Puliga
		Martina Erba
		Cesare Scalia
		Andrea Filetti
		Alessandro Chessa
		</p>
	<p>In this work, we inspected the friendship network on Twitter (recently rebranded as X), concentrating on individuals and organizations intertwined with the energy field. We particularly focus on seasoned professionals, corporate entities, and domain specialists, all connected through &amp;amp;lsquo;following&amp;amp;rsquo; relationships. By meticulously examining these ties, we uncover several distinct groupings within the network, each defined by the unique roles its members occupy. Our analysis demonstrates that the natural emergence of such clusters on social platforms exerts a profound influence on public discourse regarding energy and other critical matters, including climate change. Furthermore, we observe that the resulting communities exhibit distinct structural properties and communication patterns, with some clusters showing lower internal engagement, which may be indicative of fragmentation dynamics in online conversations. These emergent clusters, characterized by their shared communication styles, form relatively compact communities where the exchange of information is infrequent compared to larger networks and is usually confined to accounts created for specific commercial objectives. We emphasize that our analysis focuses on a structurally coherent connected component emerging from a curated set of energy-related seed accounts, rather than attempting to reconstruct the entirety of the energy discourse on Twitter. Consequently, peripheral or weakly connected communities may be underrepresented. Additionally, by combining machine-learning-based node classification with graph-based centrality measures, we are able to characterize the roles of structurally central actors within these niche segments and analyze the connectivity patterns that define their positions. This method provides novel insights into how corporate communication unfolds on social media, offering a refreshed perspective on professional networking. Ultimately, our findings highlight the ways in which companies within the energy sector take advantage of Twitter to coordinate their initiatives, with key institutions serving as central nodes in maintaining the organization of these networks.</p>
	]]></content:encoded>

	<dc:title>Identifying Energy Communities of Practice on Twitter: A Multiplex Network Analysis Using Graph Traversal Techniques</dc:title>
			<dc:creator>Vincenzo De Leo</dc:creator>
			<dc:creator>Michelangelo Puliga</dc:creator>
			<dc:creator>Martina Erba</dc:creator>
			<dc:creator>Cesare Scalia</dc:creator>
			<dc:creator>Andrea Filetti</dc:creator>
			<dc:creator>Alessandro Chessa</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2020015</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-06-15</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-06-15</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>15</prism:startingPage>
		<prism:doi>10.3390/complexities2020015</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/2/15</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/2/14">

	<title>Complexities, Vol. 2, Pages 14: Emergence of Memory and Program via Functional Differentiation in Evolutionary Echo State Networks with Complexity Indices</title>
	<link>https://www.mdpi.com/3042-6448/2/2/14</link>
	<description>In the context of Kolmogorov complexity, the complexity of an object can be characterized by the length of the shortest algorithm required to describe or compute it. In condensed matter systems under equilibrium and nonequilibrium conditions, macroscopic properties distinct from elementary ones can emerge from large numbers of particles. Such a large system size allows system properties to change as control parameters change, producing phase transitions. Inspired by this analogy, it is natural to consider that an optimized computing system may undergo a transition from an initially random organization to a functionally organized state. In this paper, by adopting a specific multi-task setting based on a typical dynamical system, we propose an evolutionary echo state network that realizes the functional differentiation of a random neural network into two subnetworks&amp;amp;mdash;one specialized for memory and the other for program execution. The model suggests a minimal neural mechanism for dynamic processes that extract rules embedded in input sequences and store information over short or long time scales. Because the proposed evolutionary model is driven by constraints that jointly reduce task errors and structural redundancy, the resulting network can be regarded as an optimized descriptor of memory and program functions. To clarify the relationship between the proposed model and algorithmic complexity, we introduce Lempel&amp;amp;ndash;Ziv-based complexity indices for both network structure and node-wise reservoir dynamics. Although neither density, effective spectral radius, nor the Lempel&amp;amp;ndash;Ziv-based complexity indices were prescribed or optimized in the eESN, the evolved network exhibited structural complexity comparable to conventional ESNs in the corresponding region and slightly higher dynamical complexity. These results suggest that the advantage of eESN is not attributable to a direct maximization of complexity itself, but rather to the evolutionary organization of complexity into a functionally differentiated reservoir that supports both memory-like retention and program-like rule extraction.</description>
	<pubDate>2026-05-28</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 14: Emergence of Memory and Program via Functional Differentiation in Evolutionary Echo State Networks with Complexity Indices</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/2/14">doi: 10.3390/complexities2020014</a></p>
	<p>Authors:
		Hiroshi Watanabe
		Ichiro Tsuda
		</p>
	<p>In the context of Kolmogorov complexity, the complexity of an object can be characterized by the length of the shortest algorithm required to describe or compute it. In condensed matter systems under equilibrium and nonequilibrium conditions, macroscopic properties distinct from elementary ones can emerge from large numbers of particles. Such a large system size allows system properties to change as control parameters change, producing phase transitions. Inspired by this analogy, it is natural to consider that an optimized computing system may undergo a transition from an initially random organization to a functionally organized state. In this paper, by adopting a specific multi-task setting based on a typical dynamical system, we propose an evolutionary echo state network that realizes the functional differentiation of a random neural network into two subnetworks&amp;amp;mdash;one specialized for memory and the other for program execution. The model suggests a minimal neural mechanism for dynamic processes that extract rules embedded in input sequences and store information over short or long time scales. Because the proposed evolutionary model is driven by constraints that jointly reduce task errors and structural redundancy, the resulting network can be regarded as an optimized descriptor of memory and program functions. To clarify the relationship between the proposed model and algorithmic complexity, we introduce Lempel&amp;amp;ndash;Ziv-based complexity indices for both network structure and node-wise reservoir dynamics. Although neither density, effective spectral radius, nor the Lempel&amp;amp;ndash;Ziv-based complexity indices were prescribed or optimized in the eESN, the evolved network exhibited structural complexity comparable to conventional ESNs in the corresponding region and slightly higher dynamical complexity. These results suggest that the advantage of eESN is not attributable to a direct maximization of complexity itself, but rather to the evolutionary organization of complexity into a functionally differentiated reservoir that supports both memory-like retention and program-like rule extraction.</p>
	]]></content:encoded>

	<dc:title>Emergence of Memory and Program via Functional Differentiation in Evolutionary Echo State Networks with Complexity Indices</dc:title>
			<dc:creator>Hiroshi Watanabe</dc:creator>
			<dc:creator>Ichiro Tsuda</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2020014</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-05-28</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-05-28</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>14</prism:startingPage>
		<prism:doi>10.3390/complexities2020014</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/2/14</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/2/13">

	<title>Complexities, Vol. 2, Pages 13: Strongly Clustered Random Graphs via Triadic Closure: Degree Correlations and Clustering Spectrum</title>
	<link>https://www.mdpi.com/3042-6448/2/2/13</link>
	<description>Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding of such complex network structures. Here, we address this problem using a model for strongly clustered random graphs in which each triad of a random network backbone is closed with a certain probability. Despite the intricate loopy local structure of the graphs obtained, we provide exact expressions for the local clustering spectrum and the degree correlations, filling the gap in the theoretical description of this model for random graphs. In particular, we find positive degree assortativity accompanying high transitivity, and nontrivial structure in the clustering spectrum. Exact asymptotic analytical results, obtained for uncorrelated locally tree-like backbones, are complemented with extensive numerical characterization of finite-size effects.</description>
	<pubDate>2026-05-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 13: Strongly Clustered Random Graphs via Triadic Closure: Degree Correlations and Clustering Spectrum</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/2/13">doi: 10.3390/complexities2020013</a></p>
	<p>Authors:
		Lorenzo Cirigliano
		Gareth J. Baxter
		Gábor Timár
		</p>
	<p>Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding of such complex network structures. Here, we address this problem using a model for strongly clustered random graphs in which each triad of a random network backbone is closed with a certain probability. Despite the intricate loopy local structure of the graphs obtained, we provide exact expressions for the local clustering spectrum and the degree correlations, filling the gap in the theoretical description of this model for random graphs. In particular, we find positive degree assortativity accompanying high transitivity, and nontrivial structure in the clustering spectrum. Exact asymptotic analytical results, obtained for uncorrelated locally tree-like backbones, are complemented with extensive numerical characterization of finite-size effects.</p>
	]]></content:encoded>

	<dc:title>Strongly Clustered Random Graphs via Triadic Closure: Degree Correlations and Clustering Spectrum</dc:title>
			<dc:creator>Lorenzo Cirigliano</dc:creator>
			<dc:creator>Gareth J. Baxter</dc:creator>
			<dc:creator>Gábor Timár</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2020013</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-05-22</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-05-22</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>13</prism:startingPage>
		<prism:doi>10.3390/complexities2020013</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/2/13</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/2/12">

	<title>Complexities, Vol. 2, Pages 12: Analyzing Late Antiquity Shifts of Trade Regime in the Iberian Peninsula and Their Causes via Change Point Detection Methods</title>
	<link>https://www.mdpi.com/3042-6448/2/2/12</link>
	<description>History attempts to make sense of disparate information by trying to create discourse that lays a series of events with crisp cause&amp;amp;ndash;effect relationships in a sequence. Epochal shifts, such as the change from Antiquity to the Middle Ages, are especially complex since they involve a large number of economic, political and even religious factors which occur over long periods and that might overlap and interact through reciprocal feedback mechanisms, making this cause&amp;amp;ndash;effects sequence difficult to establish. In this research we adopt a data-driven and well-established methodology to identify, with quantifiable statistical precision, the moment when this shift happened, and from there arrive at its possible causes. We will use historical coin hoard data to find out whether such a shift is detected in a peripheral part of the Roman Empire, the Iberian Peninsula. To do so, we will apply different changepoint analysis methods to a time series of trade links created from that data, and conduct a retrospective analysis based on that result, analyzing the structure of the trade networks before and after the link. Thus, we progress from identifying when the shift happened to identifying where it took place, which in turn allows us to get to investigate why it happened, namely, historical events that could have caused it. This methodology can be used to analyze epochal changes in several steps using time-stamped network data, possibly finding disregarded causes or cause&amp;amp;ndash;effect links that could have been overlooked by qualitative methods; in this case, we have applied it to a dataset of coin hoards either found in the Iberian Peninsula or including coins minted there, finding a changepoint in the early 5th century, which, through network analysis, has been linked to a loss of trade with the area of Britannia.</description>
	<pubDate>2026-04-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 12: Analyzing Late Antiquity Shifts of Trade Regime in the Iberian Peninsula and Their Causes via Change Point Detection Methods</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/2/12">doi: 10.3390/complexities2020012</a></p>
	<p>Authors:
		Juan Julián Merelo-Guervós
		</p>
	<p>History attempts to make sense of disparate information by trying to create discourse that lays a series of events with crisp cause&amp;amp;ndash;effect relationships in a sequence. Epochal shifts, such as the change from Antiquity to the Middle Ages, are especially complex since they involve a large number of economic, political and even religious factors which occur over long periods and that might overlap and interact through reciprocal feedback mechanisms, making this cause&amp;amp;ndash;effects sequence difficult to establish. In this research we adopt a data-driven and well-established methodology to identify, with quantifiable statistical precision, the moment when this shift happened, and from there arrive at its possible causes. We will use historical coin hoard data to find out whether such a shift is detected in a peripheral part of the Roman Empire, the Iberian Peninsula. To do so, we will apply different changepoint analysis methods to a time series of trade links created from that data, and conduct a retrospective analysis based on that result, analyzing the structure of the trade networks before and after the link. Thus, we progress from identifying when the shift happened to identifying where it took place, which in turn allows us to get to investigate why it happened, namely, historical events that could have caused it. This methodology can be used to analyze epochal changes in several steps using time-stamped network data, possibly finding disregarded causes or cause&amp;amp;ndash;effect links that could have been overlooked by qualitative methods; in this case, we have applied it to a dataset of coin hoards either found in the Iberian Peninsula or including coins minted there, finding a changepoint in the early 5th century, which, through network analysis, has been linked to a loss of trade with the area of Britannia.</p>
	]]></content:encoded>

	<dc:title>Analyzing Late Antiquity Shifts of Trade Regime in the Iberian Peninsula and Their Causes via Change Point Detection Methods</dc:title>
			<dc:creator>Juan Julián Merelo-Guervós</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2020012</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-04-16</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-04-16</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>12</prism:startingPage>
		<prism:doi>10.3390/complexities2020012</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/2/12</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/2/11">

	<title>Complexities, Vol. 2, Pages 11: Human Mobility and Social Inequality: Limitations of Mobility Data and Future Directions</title>
	<link>https://www.mdpi.com/3042-6448/2/2/11</link>
	<description>Human mobility is a fundamental determinant of urban spatial and social organization, profoundly influencing patterns of social interaction, integration, and inequality. However, prevailing research is constrained by mobility datasets that are often non-representative, reliant on static spatial proxies, and incapable of distinguishing physical co-presence from meaningful social interaction. These limitations impede a mechanistic understanding of how mobility drives core urban social phenomena such as segregation, disparity, and inequity. This perspective critically examines these empirical and theoretical blind spots, framing them around the interconnected dynamics of social mixing, segregation, disparity, inequality, and inequity. We then delineate a research agenda to transcend these limitations, focused on (1) leveraging AI and data fusion to overcome representativeness and validation bottlenecks; (2) incorporating longitudinal dynamics through deep learning models; (3) developing contextualized models of social interactions that move beyond simple co-presence; and (4) harnessing generative models to synthesize realistic mobility flows in data-scarce contexts. We argue that advancements in computational social science are essential to forge a more accurate, dynamic, and equitable understanding of human mobility&amp;amp;rsquo;s role in shaping social inequality.</description>
	<pubDate>2026-04-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 11: Human Mobility and Social Inequality: Limitations of Mobility Data and Future Directions</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/2/11">doi: 10.3390/complexities2020011</a></p>
	<p>Authors:
		Xuan Luo
		Peiran Zhang
		Weipeng Nie
		Pavel L. Kirillov
		Alla G. Makhrova
		Chaoyang Zhang
		Liang Gao
		</p>
	<p>Human mobility is a fundamental determinant of urban spatial and social organization, profoundly influencing patterns of social interaction, integration, and inequality. However, prevailing research is constrained by mobility datasets that are often non-representative, reliant on static spatial proxies, and incapable of distinguishing physical co-presence from meaningful social interaction. These limitations impede a mechanistic understanding of how mobility drives core urban social phenomena such as segregation, disparity, and inequity. This perspective critically examines these empirical and theoretical blind spots, framing them around the interconnected dynamics of social mixing, segregation, disparity, inequality, and inequity. We then delineate a research agenda to transcend these limitations, focused on (1) leveraging AI and data fusion to overcome representativeness and validation bottlenecks; (2) incorporating longitudinal dynamics through deep learning models; (3) developing contextualized models of social interactions that move beyond simple co-presence; and (4) harnessing generative models to synthesize realistic mobility flows in data-scarce contexts. We argue that advancements in computational social science are essential to forge a more accurate, dynamic, and equitable understanding of human mobility&amp;amp;rsquo;s role in shaping social inequality.</p>
	]]></content:encoded>

	<dc:title>Human Mobility and Social Inequality: Limitations of Mobility Data and Future Directions</dc:title>
			<dc:creator>Xuan Luo</dc:creator>
			<dc:creator>Peiran Zhang</dc:creator>
			<dc:creator>Weipeng Nie</dc:creator>
			<dc:creator>Pavel L. Kirillov</dc:creator>
			<dc:creator>Alla G. Makhrova</dc:creator>
			<dc:creator>Chaoyang Zhang</dc:creator>
			<dc:creator>Liang Gao</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2020011</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-04-13</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-04-13</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Perspective</prism:section>
	<prism:startingPage>11</prism:startingPage>
		<prism:doi>10.3390/complexities2020011</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/2/11</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/2/10">

	<title>Complexities, Vol. 2, Pages 10: Resilience, Tipping Points, and Hysteresis</title>
	<link>https://www.mdpi.com/3042-6448/2/2/10</link>
	<description>In the essay we introduce present-day systems concepts, such as resilience, tipping points, and hysteresis effects, via the concept of fast&amp;amp;ndash;slow dynamical systems (whether explicit in the models or implicit through bifurcation and stability behaviours). These lead naturally to ideas first propagated within catastrophe theory, fifty years ago. We discuss the historical catastrophe (the backlash) that befell such an abstract yet mathematically grounded (and thus inescapable) theory within economics and also its subsequent re-appraisal and re-adoption. Finally, we discuss some of the challenges inherent in anticipating tipping points from live systems data (observations), within systems-theoretic interpretations, and whether methods from topological data analysis might respond to them. While it is fashionable for national, governmental and policy institutions to speak of &amp;amp;ldquo;resilience&amp;amp;rdquo; in all manner of national systems contexts, we aver that it is foolishly inadequate to do so without an understanding and consideration of tipping points and hysteresis (sometimes termed &amp;amp;ldquo;path dependence&amp;amp;rdquo;), giving rise to &amp;amp;ldquo;lock-in&amp;amp;rdquo;.</description>
	<pubDate>2026-04-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 10: Resilience, Tipping Points, and Hysteresis</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/2/10">doi: 10.3390/complexities2020010</a></p>
	<p>Authors:
		Peter Grindrod
		</p>
	<p>In the essay we introduce present-day systems concepts, such as resilience, tipping points, and hysteresis effects, via the concept of fast&amp;amp;ndash;slow dynamical systems (whether explicit in the models or implicit through bifurcation and stability behaviours). These lead naturally to ideas first propagated within catastrophe theory, fifty years ago. We discuss the historical catastrophe (the backlash) that befell such an abstract yet mathematically grounded (and thus inescapable) theory within economics and also its subsequent re-appraisal and re-adoption. Finally, we discuss some of the challenges inherent in anticipating tipping points from live systems data (observations), within systems-theoretic interpretations, and whether methods from topological data analysis might respond to them. While it is fashionable for national, governmental and policy institutions to speak of &amp;amp;ldquo;resilience&amp;amp;rdquo; in all manner of national systems contexts, we aver that it is foolishly inadequate to do so without an understanding and consideration of tipping points and hysteresis (sometimes termed &amp;amp;ldquo;path dependence&amp;amp;rdquo;), giving rise to &amp;amp;ldquo;lock-in&amp;amp;rdquo;.</p>
	]]></content:encoded>

	<dc:title>Resilience, Tipping Points, and Hysteresis</dc:title>
			<dc:creator>Peter Grindrod</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2020010</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-04-03</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-04-03</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Perspective</prism:section>
	<prism:startingPage>10</prism:startingPage>
		<prism:doi>10.3390/complexities2020010</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/2/10</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/2/9">

	<title>Complexities, Vol. 2, Pages 9: Toward a Probabilistic Framework of Human Motor Control: Integrating Variability, Entropy, and Complex Systems Principles</title>
	<link>https://www.mdpi.com/3042-6448/2/2/9</link>
	<description>Human motor control has long been described within traditionally deterministic frameworks that emphasize consistency and error minimization. However, accumulating evidence across motor learning, coordination dynamics, and information theory suggests that variability and uncertainty are not merely sources of noise but fundamental resources for adaptive behavior. This review synthesizes theoretical, empirical, and methodological advances to propose an integrative probabilistic framework for motor control. Drawing on complex-systems theory, entropy-based analyses, and hierarchical coordination models, motor behavior is conceptualized as a self-organizing process that continuously balances stability and flexibility under uncertainty. Variability is reinterpreted as functionally regulated, supporting exploration, reorganization, and context-sensitive adaptation rather than reflecting control failure. To formalize this perspective, a Probabilistic Landscape Model is introduced, in which motor behaviors are represented as trajectories within a dynamic landscape of multiple attractors. Within this framework, entropy captures the structured organization of uncertainty, metastability enables rapid transitions between coordination states, and probabilistic stability characterizes the system&amp;amp;rsquo;s capacity to maintain effective performance across changing constraints. Beyond synthesizing existing research, this review introduces the Probabilistic Landscape Model (PLM), a conceptual framework that integrates nonlinear coordination dynamics, entropy-based variability analysis, and probabilistic interpretations of motor behavior. By integrating insights from motor learning, sports performance, rehabilitation, and predictive processing, this review provides a unified account of adaptive motor control as an inherently probabilistic and self-organizing system. The proposed framework offers conceptual and practical implications for training design, rehabilitation strategies, and human&amp;amp;ndash;machine interaction in uncertain environments.</description>
	<pubDate>2026-04-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 9: Toward a Probabilistic Framework of Human Motor Control: Integrating Variability, Entropy, and Complex Systems Principles</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/2/9">doi: 10.3390/complexities2020009</a></p>
	<p>Authors:
		Hiroki Murakami
		</p>
	<p>Human motor control has long been described within traditionally deterministic frameworks that emphasize consistency and error minimization. However, accumulating evidence across motor learning, coordination dynamics, and information theory suggests that variability and uncertainty are not merely sources of noise but fundamental resources for adaptive behavior. This review synthesizes theoretical, empirical, and methodological advances to propose an integrative probabilistic framework for motor control. Drawing on complex-systems theory, entropy-based analyses, and hierarchical coordination models, motor behavior is conceptualized as a self-organizing process that continuously balances stability and flexibility under uncertainty. Variability is reinterpreted as functionally regulated, supporting exploration, reorganization, and context-sensitive adaptation rather than reflecting control failure. To formalize this perspective, a Probabilistic Landscape Model is introduced, in which motor behaviors are represented as trajectories within a dynamic landscape of multiple attractors. Within this framework, entropy captures the structured organization of uncertainty, metastability enables rapid transitions between coordination states, and probabilistic stability characterizes the system&amp;amp;rsquo;s capacity to maintain effective performance across changing constraints. Beyond synthesizing existing research, this review introduces the Probabilistic Landscape Model (PLM), a conceptual framework that integrates nonlinear coordination dynamics, entropy-based variability analysis, and probabilistic interpretations of motor behavior. By integrating insights from motor learning, sports performance, rehabilitation, and predictive processing, this review provides a unified account of adaptive motor control as an inherently probabilistic and self-organizing system. The proposed framework offers conceptual and practical implications for training design, rehabilitation strategies, and human&amp;amp;ndash;machine interaction in uncertain environments.</p>
	]]></content:encoded>

	<dc:title>Toward a Probabilistic Framework of Human Motor Control: Integrating Variability, Entropy, and Complex Systems Principles</dc:title>
			<dc:creator>Hiroki Murakami</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2020009</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-04-01</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-04-01</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>9</prism:startingPage>
		<prism:doi>10.3390/complexities2020009</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/2/9</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/2/8">

	<title>Complexities, Vol. 2, Pages 8: A Hybrid Systems Framework for Electric Vehicle Adoption: Microfoundations, Networks, and Filippov Dynamics</title>
	<link>https://www.mdpi.com/3042-6448/2/2/8</link>
	<description>Electric vehicle(EV) diffusion exhibits nonlinear, path-dependent dynamics shaped by interacting economic, technological, and social constraints. This paper develops a unified hybrid systems framework that captures these complexities by integrating microfounded household choice, capacity-constrained firm behavior, local network spillovers, and multi-level policy intervention within a Filippov differential-inclusion structure. Households face heterogeneous preferences, liquidity limits, and network-mediated moral and informational influences; firms invest irreversibly under learning-by-doing and profitability thresholds; and national and local governments implement distinct financial and infrastructure policies subject to budget constraints. The resulting aggregate adoption dynamics feature endogenous switching, sliding modes at economic bottlenecks, network-amplified tipping, and hysteresis arising from irreversible investment. We establish conditions for the existence of Filippov solutions, derive network-dependent tipping thresholds, characterize sliding regimes at capacity and liquidity constraints, and show how network structure magnifies hysteresis and shapes the effectiveness of local versus national policy. Optimal-control analysis further demonstrates that national subsidies follow bang&amp;amp;ndash;bang patterns and that network-targeted local interventions minimize the fiscal cost of achieving regional tipping. Beyond theoretical characterization, the framework is structurally calibrated to match the order-of-magnitude effects reported in leading empirical and simulation-based studies, including network diffusion models, agent-based simulations, bass-type specifications, and fuel-price shock analyses. The hybrid formulation reproduces short-run percentage-point subsidy effects, long-run forecast dispersion under alternative network assumptions, and policy-induced equilibrium shifts observed in the applied literature while providing a unified geometric interpretation of these heterogeneous results through explicit basin boundaries and regime switching. The framework provides a complex systems perspective on sustainable mobility transitions and clarifies why identical national policies can generate asynchronous regional outcomes. These results offer theoretical foundations for designing coordinated, cost-effective, and network-aware EV transition strategies.</description>
	<pubDate>2026-03-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 8: A Hybrid Systems Framework for Electric Vehicle Adoption: Microfoundations, Networks, and Filippov Dynamics</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/2/8">doi: 10.3390/complexities2020008</a></p>
	<p>Authors:
		Pascal Stiefenhofer
		Jing Qian
		</p>
	<p>Electric vehicle(EV) diffusion exhibits nonlinear, path-dependent dynamics shaped by interacting economic, technological, and social constraints. This paper develops a unified hybrid systems framework that captures these complexities by integrating microfounded household choice, capacity-constrained firm behavior, local network spillovers, and multi-level policy intervention within a Filippov differential-inclusion structure. Households face heterogeneous preferences, liquidity limits, and network-mediated moral and informational influences; firms invest irreversibly under learning-by-doing and profitability thresholds; and national and local governments implement distinct financial and infrastructure policies subject to budget constraints. The resulting aggregate adoption dynamics feature endogenous switching, sliding modes at economic bottlenecks, network-amplified tipping, and hysteresis arising from irreversible investment. We establish conditions for the existence of Filippov solutions, derive network-dependent tipping thresholds, characterize sliding regimes at capacity and liquidity constraints, and show how network structure magnifies hysteresis and shapes the effectiveness of local versus national policy. Optimal-control analysis further demonstrates that national subsidies follow bang&amp;amp;ndash;bang patterns and that network-targeted local interventions minimize the fiscal cost of achieving regional tipping. Beyond theoretical characterization, the framework is structurally calibrated to match the order-of-magnitude effects reported in leading empirical and simulation-based studies, including network diffusion models, agent-based simulations, bass-type specifications, and fuel-price shock analyses. The hybrid formulation reproduces short-run percentage-point subsidy effects, long-run forecast dispersion under alternative network assumptions, and policy-induced equilibrium shifts observed in the applied literature while providing a unified geometric interpretation of these heterogeneous results through explicit basin boundaries and regime switching. The framework provides a complex systems perspective on sustainable mobility transitions and clarifies why identical national policies can generate asynchronous regional outcomes. These results offer theoretical foundations for designing coordinated, cost-effective, and network-aware EV transition strategies.</p>
	]]></content:encoded>

	<dc:title>A Hybrid Systems Framework for Electric Vehicle Adoption: Microfoundations, Networks, and Filippov Dynamics</dc:title>
			<dc:creator>Pascal Stiefenhofer</dc:creator>
			<dc:creator>Jing Qian</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2020008</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-03-29</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-03-29</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>8</prism:startingPage>
		<prism:doi>10.3390/complexities2020008</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/2/8</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/1/7">

	<title>Complexities, Vol. 2, Pages 7: On Importance Sampling and Multilinear Extensions for Approximating Shapley Values with Applications to Explainable Artificial Intelligence</title>
	<link>https://www.mdpi.com/3042-6448/2/1/7</link>
	<description>Shapley values are the most widely used point-valued solution concept for cooperative games and have recently garnered attention for their applicability in explainable machine learning. Due to the complexity of Shapley value computation, users mostly resort to Monte Carlo approximations for large problems. We take a detailed look at an approximation method grounded in multilinear extensions proposed in 2021 under the name &amp;amp;ldquo;Owen sampling&amp;amp;rdquo;. We point out why Owen sampling is biased and propose unbiased alternatives based on combining multilinear extensions with stratified sampling and importance sampling. Finally, we discuss empirical results of the presented algorithms for various cooperative games, including real-world explainability scenarios.</description>
	<pubDate>2026-03-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 7: On Importance Sampling and Multilinear Extensions for Approximating Shapley Values with Applications to Explainable Artificial Intelligence</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/1/7">doi: 10.3390/complexities2010007</a></p>
	<p>Authors:
		Tim Pollmann
		Jochen Staudacher
		</p>
	<p>Shapley values are the most widely used point-valued solution concept for cooperative games and have recently garnered attention for their applicability in explainable machine learning. Due to the complexity of Shapley value computation, users mostly resort to Monte Carlo approximations for large problems. We take a detailed look at an approximation method grounded in multilinear extensions proposed in 2021 under the name &amp;amp;ldquo;Owen sampling&amp;amp;rdquo;. We point out why Owen sampling is biased and propose unbiased alternatives based on combining multilinear extensions with stratified sampling and importance sampling. Finally, we discuss empirical results of the presented algorithms for various cooperative games, including real-world explainability scenarios.</p>
	]]></content:encoded>

	<dc:title>On Importance Sampling and Multilinear Extensions for Approximating Shapley Values with Applications to Explainable Artificial Intelligence</dc:title>
			<dc:creator>Tim Pollmann</dc:creator>
			<dc:creator>Jochen Staudacher</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2010007</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-03-17</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-03-17</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>7</prism:startingPage>
		<prism:doi>10.3390/complexities2010007</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/1/7</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/1/6">

	<title>Complexities, Vol. 2, Pages 6: Why Emergence and Self-Organization Are Conceptually Simple, Common and Natural</title>
	<link>https://www.mdpi.com/3042-6448/2/1/6</link>
	<description>Emergent properties are properties of a whole that cannot be reduced to the properties of its parts. Properties of a system can be defined as relations between a particular input given to a system and its corresponding output. From this perspective, whole systems formed by coupling component systems have properties different from the properties of their components. Wholes tend to arise spontaneously through a process of self-organization, in which components randomly interact until they settle in a stable configuration that in general cannot be predicted from the properties of the components. This configuration constrains the relations between the components, thus defining emergent &amp;amp;ldquo;laws&amp;amp;rdquo; that downwardly cause the further behavior of the components. Thus, emergent wholes and their properties arise in a simple and natural manner.</description>
	<pubDate>2026-03-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 6: Why Emergence and Self-Organization Are Conceptually Simple, Common and Natural</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/1/6">doi: 10.3390/complexities2010006</a></p>
	<p>Authors:
		Francis Heylighen
		</p>
	<p>Emergent properties are properties of a whole that cannot be reduced to the properties of its parts. Properties of a system can be defined as relations between a particular input given to a system and its corresponding output. From this perspective, whole systems formed by coupling component systems have properties different from the properties of their components. Wholes tend to arise spontaneously through a process of self-organization, in which components randomly interact until they settle in a stable configuration that in general cannot be predicted from the properties of the components. This configuration constrains the relations between the components, thus defining emergent &amp;amp;ldquo;laws&amp;amp;rdquo; that downwardly cause the further behavior of the components. Thus, emergent wholes and their properties arise in a simple and natural manner.</p>
	]]></content:encoded>

	<dc:title>Why Emergence and Self-Organization Are Conceptually Simple, Common and Natural</dc:title>
			<dc:creator>Francis Heylighen</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2010006</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-03-13</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-03-13</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>6</prism:startingPage>
		<prism:doi>10.3390/complexities2010006</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/1/6</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/1/5">

	<title>Complexities, Vol. 2, Pages 5: Thermodynamic-Complexity Duality in Constrained Equilibrium Ensembles</title>
	<link>https://www.mdpi.com/3042-6448/2/1/5</link>
	<description>Many complex systems, particularly glasses and disordered materials, exhibit energy landscapes with exponentially many metastable states. Such landscape structure strongly influences equilibrium behavior but is not explicitly represented in standard thermodynamic state spaces. We develop a constrained equilibrium framework in which configurational complexity, defined as the logarithmic density of metastable basins, is treated as an additional macroscopic coordinate. Starting from maximum entropy with simultaneous constraints on energy and complexity, we obtain a generalized Gibbs ensemble characterized by a conjugate bias parameter. Standard thermodynamic structure remains intact, with extended relations arising as constrained equilibrium identities. A mean-field glassy example with explicit complexity function demonstrates how complexity bias shifts the saddle-point structure of the partition function and modifies equilibrium response functions. The geometric formulation further provides a diagnostic of landscape reorganization within an enlarged state space. This framework offers a systematic equilibrium description of how energy-landscape structure influences thermodynamic behavior in systems with rugged configuration spaces.</description>
	<pubDate>2026-03-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 5: Thermodynamic-Complexity Duality in Constrained Equilibrium Ensembles</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/1/5">doi: 10.3390/complexities2010005</a></p>
	<p>Authors:
		Florian Neukart
		</p>
	<p>Many complex systems, particularly glasses and disordered materials, exhibit energy landscapes with exponentially many metastable states. Such landscape structure strongly influences equilibrium behavior but is not explicitly represented in standard thermodynamic state spaces. We develop a constrained equilibrium framework in which configurational complexity, defined as the logarithmic density of metastable basins, is treated as an additional macroscopic coordinate. Starting from maximum entropy with simultaneous constraints on energy and complexity, we obtain a generalized Gibbs ensemble characterized by a conjugate bias parameter. Standard thermodynamic structure remains intact, with extended relations arising as constrained equilibrium identities. A mean-field glassy example with explicit complexity function demonstrates how complexity bias shifts the saddle-point structure of the partition function and modifies equilibrium response functions. The geometric formulation further provides a diagnostic of landscape reorganization within an enlarged state space. This framework offers a systematic equilibrium description of how energy-landscape structure influences thermodynamic behavior in systems with rugged configuration spaces.</p>
	]]></content:encoded>

	<dc:title>Thermodynamic-Complexity Duality in Constrained Equilibrium Ensembles</dc:title>
			<dc:creator>Florian Neukart</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2010005</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-03-08</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-03-08</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>5</prism:startingPage>
		<prism:doi>10.3390/complexities2010005</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/1/5</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/1/4">

	<title>Complexities, Vol. 2, Pages 4: Reproducing Stylized Facts in Artificial Stock Markets with Price-Data-Trained Neural Agents</title>
	<link>https://www.mdpi.com/3042-6448/2/1/4</link>
	<description>Agent-based models of financial markets often rely on a small set of hand-crafted trading rules, making it difficult to relate model heterogeneity to information that is observable in market data. We take a different standpoint and treat the design of heterogeneity as a representation problem under limited observations. In our framework, each agent&amp;amp;rsquo;s decision rule is implemented as a neural-network mapping from recent price histories to order decisions, trained on historical index or stock price series. To describe and manipulate heterogeneity without pre-assigning mechanism labels, we introduce Fit Quality (FQ), an ex post effect-defined index summarizing how strongly each learned rule fits the price patterns it was trained on, and we use FQ solely as a coordinate for organizing agent populations and constructing controlled changes in agent composition, rather than as a measure of forecasting skill or economic performance. Using this representation, we examine whether simulations can reproduce several stylized features of return series. We also perform simple ablation experiments to assess how far the observed properties depend on the data-trained decision rules rather than on the market mechanism alone. Taken together, the framework is intended as a step toward more data-linked, representation-conscious agent-based models, in which alternative ways of organizing heterogeneity can be compared within a common market environment.</description>
	<pubDate>2026-02-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 4: Reproducing Stylized Facts in Artificial Stock Markets with Price-Data-Trained Neural Agents</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/1/4">doi: 10.3390/complexities2010004</a></p>
	<p>Authors:
		Qi Zhang
		Yu Chen
		</p>
	<p>Agent-based models of financial markets often rely on a small set of hand-crafted trading rules, making it difficult to relate model heterogeneity to information that is observable in market data. We take a different standpoint and treat the design of heterogeneity as a representation problem under limited observations. In our framework, each agent&amp;amp;rsquo;s decision rule is implemented as a neural-network mapping from recent price histories to order decisions, trained on historical index or stock price series. To describe and manipulate heterogeneity without pre-assigning mechanism labels, we introduce Fit Quality (FQ), an ex post effect-defined index summarizing how strongly each learned rule fits the price patterns it was trained on, and we use FQ solely as a coordinate for organizing agent populations and constructing controlled changes in agent composition, rather than as a measure of forecasting skill or economic performance. Using this representation, we examine whether simulations can reproduce several stylized features of return series. We also perform simple ablation experiments to assess how far the observed properties depend on the data-trained decision rules rather than on the market mechanism alone. Taken together, the framework is intended as a step toward more data-linked, representation-conscious agent-based models, in which alternative ways of organizing heterogeneity can be compared within a common market environment.</p>
	]]></content:encoded>

	<dc:title>Reproducing Stylized Facts in Artificial Stock Markets with Price-Data-Trained Neural Agents</dc:title>
			<dc:creator>Qi Zhang</dc:creator>
			<dc:creator>Yu Chen</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2010004</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-02-13</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-02-13</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>4</prism:startingPage>
		<prism:doi>10.3390/complexities2010004</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/1/4</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/1/3">

	<title>Complexities, Vol. 2, Pages 3: From Statistical Mechanics to Nonlinear Dynamics and into Complex Systems</title>
	<link>https://www.mdpi.com/3042-6448/2/1/3</link>
	<description>We detail a procedure to transform the current empirical stage in the study of complex systems into a predictive phenomenological one. Our approach starts with the statistical-mechanical Landau-Ginzburg equation for dissipative processes, such as kinetics of phase change. Then, it imposes discrete time evolution to explicit back feeding, and adopts a power-law driving force to incorporate the onset of chaos, or, alternatively, criticality, the guiding principles of complexity. One obtains, in closed analytical form, a nonlinear renormalization-group (RG) fixed-point map descriptive of any of the three known (one-dimensional) transitions to or out of chaos. Furthermore, its Lyapunov function is shown to be the thermodynamic potential in q-statistics, because the regular or multifractal attractors at the transitions to chaos impose a severe impediment to access the system&amp;amp;rsquo;s built-in configurations, leaving only a subset of vanishing measure available. To test the pertinence of our approach, we refer to the following complex systems issues: (i) Basic questions, such as demonstration of paradigms equivalence, illustration of self-organization, thermodynamic viewpoint of diversity, biological or other. (ii) Derivation of empirical laws, e.g., ranked data distributions (Zipf law), biological regularities (Kleiber law), river and cosmological structures (Hack law). (iii) Complex systems methods, for example, evolutionary game theory, self-similar networks, central-limit theorem questions. (iv) Condensed-matter physics complex problems (and their analogs in other disciplines), like, critical fluctuations (catastrophes), glass formation (traffic jams), localization transition (foraging, collective motion).</description>
	<pubDate>2026-02-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 3: From Statistical Mechanics to Nonlinear Dynamics and into Complex Systems</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/1/3">doi: 10.3390/complexities2010003</a></p>
	<p>Authors:
		Alberto Robledo
		</p>
	<p>We detail a procedure to transform the current empirical stage in the study of complex systems into a predictive phenomenological one. Our approach starts with the statistical-mechanical Landau-Ginzburg equation for dissipative processes, such as kinetics of phase change. Then, it imposes discrete time evolution to explicit back feeding, and adopts a power-law driving force to incorporate the onset of chaos, or, alternatively, criticality, the guiding principles of complexity. One obtains, in closed analytical form, a nonlinear renormalization-group (RG) fixed-point map descriptive of any of the three known (one-dimensional) transitions to or out of chaos. Furthermore, its Lyapunov function is shown to be the thermodynamic potential in q-statistics, because the regular or multifractal attractors at the transitions to chaos impose a severe impediment to access the system&amp;amp;rsquo;s built-in configurations, leaving only a subset of vanishing measure available. To test the pertinence of our approach, we refer to the following complex systems issues: (i) Basic questions, such as demonstration of paradigms equivalence, illustration of self-organization, thermodynamic viewpoint of diversity, biological or other. (ii) Derivation of empirical laws, e.g., ranked data distributions (Zipf law), biological regularities (Kleiber law), river and cosmological structures (Hack law). (iii) Complex systems methods, for example, evolutionary game theory, self-similar networks, central-limit theorem questions. (iv) Condensed-matter physics complex problems (and their analogs in other disciplines), like, critical fluctuations (catastrophes), glass formation (traffic jams), localization transition (foraging, collective motion).</p>
	]]></content:encoded>

	<dc:title>From Statistical Mechanics to Nonlinear Dynamics and into Complex Systems</dc:title>
			<dc:creator>Alberto Robledo</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2010003</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-02-13</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-02-13</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Perspective</prism:section>
	<prism:startingPage>3</prism:startingPage>
		<prism:doi>10.3390/complexities2010003</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/1/3</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/1/2">

	<title>Complexities, Vol. 2, Pages 2: Agent-Based Modeling of Urban Agriculture: Decision-Making, Policy Incentives, and Sustainability in Food Systems</title>
	<link>https://www.mdpi.com/3042-6448/2/1/2</link>
	<description>Urban and peri-urban agriculture (UPA) has emerged as a critical strategy to address multidimensional urban challenges, including food insecurity, environmental degradation, and social inequality. Despite its potential benefits, UPA occupies a marginal position in municipal governance frameworks. Understanding how public policies and social influence mechanisms shape consumer behavior and producer viability requires a systems-thinking approach capable of capturing complex socio-economic-ecological interactions. Therefore, we developed an agent-based model (ABM) following the ODD + D protocol to simulate urban agriculture market dynamics, incorporating producer and consumer agents within a spatially explicit grid environment representing the urban landscape. We implemented three policy interventions and conducted six complementary experiments. Education campaigns achieved the highest local market share, demonstrating strict Pareto dominance over all subsidy-based strategies. Production subsidies yielded equivalent outcomes but at a fiscal cost, reducing producer income inequality (Gini). Stress tests revealed moderate resilience to production shocks. The findings demonstrate the power of agent-based modeling to uncover policy dynamics in complex urban food systems, providing actionable evidence for sustainable urban governance.</description>
	<pubDate>2026-02-06</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 2: Agent-Based Modeling of Urban Agriculture: Decision-Making, Policy Incentives, and Sustainability in Food Systems</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/1/2">doi: 10.3390/complexities2010002</a></p>
	<p>Authors:
		Thiago Joel Angrizanes Rossi
		Aline Martins de Carvalho
		Flavia Mori Sarti
		</p>
	<p>Urban and peri-urban agriculture (UPA) has emerged as a critical strategy to address multidimensional urban challenges, including food insecurity, environmental degradation, and social inequality. Despite its potential benefits, UPA occupies a marginal position in municipal governance frameworks. Understanding how public policies and social influence mechanisms shape consumer behavior and producer viability requires a systems-thinking approach capable of capturing complex socio-economic-ecological interactions. Therefore, we developed an agent-based model (ABM) following the ODD + D protocol to simulate urban agriculture market dynamics, incorporating producer and consumer agents within a spatially explicit grid environment representing the urban landscape. We implemented three policy interventions and conducted six complementary experiments. Education campaigns achieved the highest local market share, demonstrating strict Pareto dominance over all subsidy-based strategies. Production subsidies yielded equivalent outcomes but at a fiscal cost, reducing producer income inequality (Gini). Stress tests revealed moderate resilience to production shocks. The findings demonstrate the power of agent-based modeling to uncover policy dynamics in complex urban food systems, providing actionable evidence for sustainable urban governance.</p>
	]]></content:encoded>

	<dc:title>Agent-Based Modeling of Urban Agriculture: Decision-Making, Policy Incentives, and Sustainability in Food Systems</dc:title>
			<dc:creator>Thiago Joel Angrizanes Rossi</dc:creator>
			<dc:creator>Aline Martins de Carvalho</dc:creator>
			<dc:creator>Flavia Mori Sarti</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2010002</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-02-06</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-02-06</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>2</prism:startingPage>
		<prism:doi>10.3390/complexities2010002</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/1/2</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/2/1/1">

	<title>Complexities, Vol. 2, Pages 1: Back Squat Post-Activation Performance Enhancement on Parameters of a 3-Min All-Out Running Test: A Complex Network Analysis Perspective</title>
	<link>https://www.mdpi.com/3042-6448/2/1/1</link>
	<description>This study investigated the impact of post-activation performance enhancement (PAPE) on the parameters of the 3 min all-out test (3MT) in non-motorized tethered running, applying the concept of complex networks for integrative analysis. Ten recreational runners underwent anthropometric assessments, a one-repetition maximum test (1RM), a running ramp test, and 3MT trials under both PAPE and CONTROL conditions across five separate sessions. The conditioning activity consisted of two sets of six back squats at 60% 1RM. For each scenario, complex network graphs were constructed and analyzed using Degree, Eigenvector, PageRank, and Betweenness centrality metrics. In the PAPE condition, anthropometric parameters and parameters related to aerobic efficiency exhibited greater centrality, ranking among the top five nodes. Paired Student&amp;amp;rsquo;s t-tests (p &amp;amp;le; 0.05) revealed significant differences between conditions for end power (EP-W) (CONTROL: 407.83 &amp;amp;plusmn; 119.30 vs. PAPE: 539.33 &amp;amp;plusmn; 177.10 (effect size d = &amp;amp;minus;0.84)) and end power relativized by body mass (rEP-W&amp;amp;middot;kg&amp;amp;minus;1) (CONTROL: 5.38 &amp;amp;plusmn; 1.70 vs. PAPE: 6.91 &amp;amp;plusmn; 2.00 (effect size d = &amp;amp;minus;0.76)), as well as for the absolute and relative values of peak output power, mean output power, peak force, and mean force. These findings suggest that PAPE alters the configuration of complex networks, increasing network density, and may enhance neuromuscular function and running economy. Moreover, PAPE appears to modulate both aerobic and anaerobic contributions to performance. These results highlight the importance of network-based approaches for advancing exercise science and providing individualized strategies for training and performance optimization.</description>
	<pubDate>2026-01-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 2, Pages 1: Back Squat Post-Activation Performance Enhancement on Parameters of a 3-Min All-Out Running Test: A Complex Network Analysis Perspective</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/2/1/1">doi: 10.3390/complexities2010001</a></p>
	<p>Authors:
		Maria Carolina Traina Gama
		Fúlvia Barros Manchado-Gobatto
		Claudio Alexandre Gobatto
		</p>
	<p>This study investigated the impact of post-activation performance enhancement (PAPE) on the parameters of the 3 min all-out test (3MT) in non-motorized tethered running, applying the concept of complex networks for integrative analysis. Ten recreational runners underwent anthropometric assessments, a one-repetition maximum test (1RM), a running ramp test, and 3MT trials under both PAPE and CONTROL conditions across five separate sessions. The conditioning activity consisted of two sets of six back squats at 60% 1RM. For each scenario, complex network graphs were constructed and analyzed using Degree, Eigenvector, PageRank, and Betweenness centrality metrics. In the PAPE condition, anthropometric parameters and parameters related to aerobic efficiency exhibited greater centrality, ranking among the top five nodes. Paired Student&amp;amp;rsquo;s t-tests (p &amp;amp;le; 0.05) revealed significant differences between conditions for end power (EP-W) (CONTROL: 407.83 &amp;amp;plusmn; 119.30 vs. PAPE: 539.33 &amp;amp;plusmn; 177.10 (effect size d = &amp;amp;minus;0.84)) and end power relativized by body mass (rEP-W&amp;amp;middot;kg&amp;amp;minus;1) (CONTROL: 5.38 &amp;amp;plusmn; 1.70 vs. PAPE: 6.91 &amp;amp;plusmn; 2.00 (effect size d = &amp;amp;minus;0.76)), as well as for the absolute and relative values of peak output power, mean output power, peak force, and mean force. These findings suggest that PAPE alters the configuration of complex networks, increasing network density, and may enhance neuromuscular function and running economy. Moreover, PAPE appears to modulate both aerobic and anaerobic contributions to performance. These results highlight the importance of network-based approaches for advancing exercise science and providing individualized strategies for training and performance optimization.</p>
	]]></content:encoded>

	<dc:title>Back Squat Post-Activation Performance Enhancement on Parameters of a 3-Min All-Out Running Test: A Complex Network Analysis Perspective</dc:title>
			<dc:creator>Maria Carolina Traina Gama</dc:creator>
			<dc:creator>Fúlvia Barros Manchado-Gobatto</dc:creator>
			<dc:creator>Claudio Alexandre Gobatto</dc:creator>
		<dc:identifier>doi: 10.3390/complexities2010001</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2026-01-14</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2026-01-14</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>1</prism:startingPage>
		<prism:doi>10.3390/complexities2010001</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/2/1/1</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/1/1/7">

	<title>Complexities, Vol. 1, Pages 7: A Duplication&amp;ndash;Divergence Hypergraph Model for Protein Complex Data</title>
	<link>https://www.mdpi.com/3042-6448/1/1/7</link>
	<description>Hypergraphs, a generalisation of traditional graphs in which hyperedges may connect more than two vertices, provide a natural framework for modeling higher-order interactions in complex biological systems. In the context of protein complexes, hypergraphs capture relationships in which a single protein may participate in multiple complexes simultaneously. A fundamental question is how such protein complex hypergraphs evolve over time. Motivated by duplication&amp;amp;ndash;divergence&amp;amp;ndash;deletion models often used for protein&amp;amp;ndash;protein interaction networks, we propose a novel Duplication&amp;amp;ndash;Divergence Hypergraph (DDH) model for the evolutionary dynamics of protein complex hypergraphs. To evaluate network resilience, we simulate targeted attack strategies analogous to drug treatments or genetic knockouts that remove selected proteins and their associated hyperedges. We measure the resulting structural changes using hypergraph-based efficiency metrics, comparing synthetic networks generated by the DDH model with empirical E. coli protein complex data. This framework demonstrates closer alignment with empirical observations than standard pairwise duplication&amp;amp;ndash;divergence models, suggesting that hypergraphs provide a more realistic representation of protein interactions.</description>
	<pubDate>2025-12-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 1, Pages 7: A Duplication&amp;ndash;Divergence Hypergraph Model for Protein Complex Data</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/1/1/7">doi: 10.3390/complexities1010007</a></p>
	<p>Authors:
		Ruihua Zhang
		Gesine Reinert
		</p>
	<p>Hypergraphs, a generalisation of traditional graphs in which hyperedges may connect more than two vertices, provide a natural framework for modeling higher-order interactions in complex biological systems. In the context of protein complexes, hypergraphs capture relationships in which a single protein may participate in multiple complexes simultaneously. A fundamental question is how such protein complex hypergraphs evolve over time. Motivated by duplication&amp;amp;ndash;divergence&amp;amp;ndash;deletion models often used for protein&amp;amp;ndash;protein interaction networks, we propose a novel Duplication&amp;amp;ndash;Divergence Hypergraph (DDH) model for the evolutionary dynamics of protein complex hypergraphs. To evaluate network resilience, we simulate targeted attack strategies analogous to drug treatments or genetic knockouts that remove selected proteins and their associated hyperedges. We measure the resulting structural changes using hypergraph-based efficiency metrics, comparing synthetic networks generated by the DDH model with empirical E. coli protein complex data. This framework demonstrates closer alignment with empirical observations than standard pairwise duplication&amp;amp;ndash;divergence models, suggesting that hypergraphs provide a more realistic representation of protein interactions.</p>
	]]></content:encoded>

	<dc:title>A Duplication&amp;amp;ndash;Divergence Hypergraph Model for Protein Complex Data</dc:title>
			<dc:creator>Ruihua Zhang</dc:creator>
			<dc:creator>Gesine Reinert</dc:creator>
		<dc:identifier>doi: 10.3390/complexities1010007</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2025-12-03</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2025-12-03</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>7</prism:startingPage>
		<prism:doi>10.3390/complexities1010007</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/1/1/7</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/1/1/6">

	<title>Complexities, Vol. 1, Pages 6: The Concept of Homeodynamics in Systems Theory</title>
	<link>https://www.mdpi.com/3042-6448/1/1/6</link>
	<description>This review traces the historical evolution, conceptual foundations, and contemporary applications of the term homeodynamics across biological, ecological, cognitive, and social systems. Initially coined in the 19th century but largely forgotten, the term re-emerged in the second half of the 20th century as scholars sought to describe dynamic stability in open, self-organizing systems. From Yates&amp;amp;rsquo;s theoretical formalization in biology to Rattan&amp;amp;rsquo;s work in biogerontology and recent applications in psychology and organizational theory, homeodynamics has progressively evolved from a synonym of homeostasis to a distinct systems concept. It now denotes the capacity of complex systems to sustain coherence through transitions between multiple temporary equilibria, integrating feedbacks, bifurcations, and adaptive reconfigurations. By revisiting the term&amp;amp;rsquo;s lineage, this review clarifies its epistemological scope and proposes its use as a heuristic and modeling framework for understanding dynamic stability and regime shifts in living and social systems.</description>
	<pubDate>2025-11-27</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 1, Pages 6: The Concept of Homeodynamics in Systems Theory</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/1/1/6">doi: 10.3390/complexities1010006</a></p>
	<p>Authors:
		Hugues Petitjean
		Serge Finck
		Patrick Schmoll
		Alexandre Charlet
		</p>
	<p>This review traces the historical evolution, conceptual foundations, and contemporary applications of the term homeodynamics across biological, ecological, cognitive, and social systems. Initially coined in the 19th century but largely forgotten, the term re-emerged in the second half of the 20th century as scholars sought to describe dynamic stability in open, self-organizing systems. From Yates&amp;amp;rsquo;s theoretical formalization in biology to Rattan&amp;amp;rsquo;s work in biogerontology and recent applications in psychology and organizational theory, homeodynamics has progressively evolved from a synonym of homeostasis to a distinct systems concept. It now denotes the capacity of complex systems to sustain coherence through transitions between multiple temporary equilibria, integrating feedbacks, bifurcations, and adaptive reconfigurations. By revisiting the term&amp;amp;rsquo;s lineage, this review clarifies its epistemological scope and proposes its use as a heuristic and modeling framework for understanding dynamic stability and regime shifts in living and social systems.</p>
	]]></content:encoded>

	<dc:title>The Concept of Homeodynamics in Systems Theory</dc:title>
			<dc:creator>Hugues Petitjean</dc:creator>
			<dc:creator>Serge Finck</dc:creator>
			<dc:creator>Patrick Schmoll</dc:creator>
			<dc:creator>Alexandre Charlet</dc:creator>
		<dc:identifier>doi: 10.3390/complexities1010006</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2025-11-27</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2025-11-27</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>6</prism:startingPage>
		<prism:doi>10.3390/complexities1010006</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/1/1/6</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/1/1/5">

	<title>Complexities, Vol. 1, Pages 5: Forecasting Chaotic Dynamics Using a Hybrid System</title>
	<link>https://www.mdpi.com/3042-6448/1/1/5</link>
	<description>The literature is rich with studies and examples on parameter estimation obtained by analyzing the evolution of chaotic dynamical systems, even when only partial information is available through observations. However, parameter estimation alone does not resolve prediction challenges, particularly when only a subset of variables is known or when parameters are estimated with a significant uncertainty. In this paper, we introduce a hybrid system specifically designed to address this issue. Our method involves training an artificial intelligence system to predict the dynamics of a measured system by combining a neural network with a simulated system. By training the neural network, it becomes possible to refine the model&amp;amp;rsquo;s predictions so that the simulated dynamics synchronizes with that of the system under investigation. After a brief contextualization of the problem, we introduce the hybrid approach employed, describing the learning technique and testing the results on three chaotic systems inspired by atmospheric dynamics in measurement contexts. Although these systems are low-dimensional, they encompass all the fundamental characteristics and predictability challenges that can be observed in more complex real-world systems.</description>
	<pubDate>2025-11-20</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 1, Pages 5: Forecasting Chaotic Dynamics Using a Hybrid System</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/1/1/5">doi: 10.3390/complexities1010005</a></p>
	<p>Authors:
		Michele Baia
		Franco Bagnoli
		Tommaso Matteuzzi
		</p>
	<p>The literature is rich with studies and examples on parameter estimation obtained by analyzing the evolution of chaotic dynamical systems, even when only partial information is available through observations. However, parameter estimation alone does not resolve prediction challenges, particularly when only a subset of variables is known or when parameters are estimated with a significant uncertainty. In this paper, we introduce a hybrid system specifically designed to address this issue. Our method involves training an artificial intelligence system to predict the dynamics of a measured system by combining a neural network with a simulated system. By training the neural network, it becomes possible to refine the model&amp;amp;rsquo;s predictions so that the simulated dynamics synchronizes with that of the system under investigation. After a brief contextualization of the problem, we introduce the hybrid approach employed, describing the learning technique and testing the results on three chaotic systems inspired by atmospheric dynamics in measurement contexts. Although these systems are low-dimensional, they encompass all the fundamental characteristics and predictability challenges that can be observed in more complex real-world systems.</p>
	]]></content:encoded>

	<dc:title>Forecasting Chaotic Dynamics Using a Hybrid System</dc:title>
			<dc:creator>Michele Baia</dc:creator>
			<dc:creator>Franco Bagnoli</dc:creator>
			<dc:creator>Tommaso Matteuzzi</dc:creator>
		<dc:identifier>doi: 10.3390/complexities1010005</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2025-11-20</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2025-11-20</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>5</prism:startingPage>
		<prism:doi>10.3390/complexities1010005</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/1/1/5</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/1/1/4">

	<title>Complexities, Vol. 1, Pages 4: Extended Gauss Iterative Map: Bistability and Chimera States</title>
	<link>https://www.mdpi.com/3042-6448/1/1/4</link>
	<description>We investigate an extended Gauss iterative map by incorporating the q-exponential function, a key component of the Tsallis framework. This extension enables us to investigate the non-linear dynamics of the Gauss iterative map across a broader range of scenarios, encompassing periodic, chaotic, and bistable behaviors. Regular and chaotic phenomena have been observed in coupled systems. In this context, we propose a network of coupled extended Gauss iterative maps. In our network, we found the emergence of chimera states, characterized by the coexistence of coherent and incoherent behaviors. These states are identified within specific parameter regimes using Gopal&amp;amp;rsquo;s metric. In this work, we show the interplay between chaos and emergent collective dynamics in coupled extended Gauss iterative maps.</description>
	<pubDate>2025-11-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 1, Pages 4: Extended Gauss Iterative Map: Bistability and Chimera States</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/1/1/4">doi: 10.3390/complexities1010004</a></p>
	<p>Authors:
		Derik W. Gryczak
		Ervin K. Lenzi
		Antonio M. Batista
		</p>
	<p>We investigate an extended Gauss iterative map by incorporating the q-exponential function, a key component of the Tsallis framework. This extension enables us to investigate the non-linear dynamics of the Gauss iterative map across a broader range of scenarios, encompassing periodic, chaotic, and bistable behaviors. Regular and chaotic phenomena have been observed in coupled systems. In this context, we propose a network of coupled extended Gauss iterative maps. In our network, we found the emergence of chimera states, characterized by the coexistence of coherent and incoherent behaviors. These states are identified within specific parameter regimes using Gopal&amp;amp;rsquo;s metric. In this work, we show the interplay between chaos and emergent collective dynamics in coupled extended Gauss iterative maps.</p>
	]]></content:encoded>

	<dc:title>Extended Gauss Iterative Map: Bistability and Chimera States</dc:title>
			<dc:creator>Derik W. Gryczak</dc:creator>
			<dc:creator>Ervin K. Lenzi</dc:creator>
			<dc:creator>Antonio M. Batista</dc:creator>
		<dc:identifier>doi: 10.3390/complexities1010004</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2025-11-13</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2025-11-13</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>4</prism:startingPage>
		<prism:doi>10.3390/complexities1010004</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/1/1/4</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/1/1/3">

	<title>Complexities, Vol. 1, Pages 3: A Particle-Based Model of Endothelial Cell Dynamics in the Extracellular Matrix</title>
	<link>https://www.mdpi.com/3042-6448/1/1/3</link>
	<description>Branching structures such as vascular networks are representative morphological patterns in living systems, and they often arise from collective cell migration. Angiogenesis, the sprouting of new blood vessels from pre-existing ones, is a fundamental process in development. Experimental and theoretical studies have demonstrated that sprout formation depends on the collective movements and shapes of endothelial cells, as well as the remodelling of the extracellular matrix. Many discrete models have been proposed to describe cell dynamics, successfully reproducing vascular patterns and collective behaviours. In this study, we present a two-dimensional mathematical model that represents each endothelial cell as an ellipse and incorporates the effects of the extracellular matrix. We performed computer simulations under two scenarios: invasion from a pre-formed sprout and collective advancement into an extracellular matrix region. The results show that the extracellular matrix helps maintain linear sprout extension and suppresses the formation of dispersed or curved branches, while elongated cell shapes promote sprouting more effectively than round cells. The model also reproduces experimentally observed behaviours such as tip-cell replacement and the mixing of cells within sprouts. These findings highlight the importance of integrating cell shape and extracellular matrix remodelling to understand early blood vessel formation.</description>
	<pubDate>2025-11-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 1, Pages 3: A Particle-Based Model of Endothelial Cell Dynamics in the Extracellular Matrix</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/1/1/3">doi: 10.3390/complexities1010003</a></p>
	<p>Authors:
		Kazuma Sakai
		Tatsuya Hayashi
		Jun Mada
		Tetsuji Tokihiro
		</p>
	<p>Branching structures such as vascular networks are representative morphological patterns in living systems, and they often arise from collective cell migration. Angiogenesis, the sprouting of new blood vessels from pre-existing ones, is a fundamental process in development. Experimental and theoretical studies have demonstrated that sprout formation depends on the collective movements and shapes of endothelial cells, as well as the remodelling of the extracellular matrix. Many discrete models have been proposed to describe cell dynamics, successfully reproducing vascular patterns and collective behaviours. In this study, we present a two-dimensional mathematical model that represents each endothelial cell as an ellipse and incorporates the effects of the extracellular matrix. We performed computer simulations under two scenarios: invasion from a pre-formed sprout and collective advancement into an extracellular matrix region. The results show that the extracellular matrix helps maintain linear sprout extension and suppresses the formation of dispersed or curved branches, while elongated cell shapes promote sprouting more effectively than round cells. The model also reproduces experimentally observed behaviours such as tip-cell replacement and the mixing of cells within sprouts. These findings highlight the importance of integrating cell shape and extracellular matrix remodelling to understand early blood vessel formation.</p>
	]]></content:encoded>

	<dc:title>A Particle-Based Model of Endothelial Cell Dynamics in the Extracellular Matrix</dc:title>
			<dc:creator>Kazuma Sakai</dc:creator>
			<dc:creator>Tatsuya Hayashi</dc:creator>
			<dc:creator>Jun Mada</dc:creator>
			<dc:creator>Tetsuji Tokihiro</dc:creator>
		<dc:identifier>doi: 10.3390/complexities1010003</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2025-11-11</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2025-11-11</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>3</prism:startingPage>
		<prism:doi>10.3390/complexities1010003</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/1/1/3</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/1/1/2">

	<title>Complexities, Vol. 1, Pages 2: A Simple Overview of Complex Systems and Complexity Measures</title>
	<link>https://www.mdpi.com/3042-6448/1/1/2</link>
	<description>Defining a complex system and evaluating its complexity typically requires an interdisciplinary approach, integrating information theory, signal processing techniques, principles of dynamical systems, algorithm length analysis, and network science. This overview presents the main characteristics of complex systems and outlines several metrics commonly used to quantify their complexity. Simple examples are provided to illustrate the key concepts. Speculative ideas regarding these topics are also discussed here.</description>
	<pubDate>2025-06-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 1, Pages 2: A Simple Overview of Complex Systems and Complexity Measures</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/1/1/2">doi: 10.3390/complexities1010002</a></p>
	<p>Authors:
		Luiz H. A. Monteiro
		</p>
	<p>Defining a complex system and evaluating its complexity typically requires an interdisciplinary approach, integrating information theory, signal processing techniques, principles of dynamical systems, algorithm length analysis, and network science. This overview presents the main characteristics of complex systems and outlines several metrics commonly used to quantify their complexity. Simple examples are provided to illustrate the key concepts. Speculative ideas regarding these topics are also discussed here.</p>
	]]></content:encoded>

	<dc:title>A Simple Overview of Complex Systems and Complexity Measures</dc:title>
			<dc:creator>Luiz H. A. Monteiro</dc:creator>
		<dc:identifier>doi: 10.3390/complexities1010002</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2025-06-11</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2025-06-11</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>2</prism:startingPage>
		<prism:doi>10.3390/complexities1010002</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/1/1/2</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-6448/1/1/1">

	<title>Complexities, Vol. 1, Pages 1: Complexities: An Open Access Journal for the Field of Complex Systems</title>
	<link>https://www.mdpi.com/3042-6448/1/1/1</link>
	<description>On behalf of the MDPI Editorial Board and Staff, I am pleased to announce the launch of Complexities (ISSN: 3042-6448) [...]</description>
	<pubDate>2025-02-27</pubDate>

	<content:encoded><![CDATA[
	<p><b>Complexities, Vol. 1, Pages 1: Complexities: An Open Access Journal for the Field of Complex Systems</b></p>
	<p>Complexities <a href="https://www.mdpi.com/3042-6448/1/1/1">doi: 10.3390/complexities1010001</a></p>
	<p>Authors:
		José F. F. Mendes
		</p>
	<p>On behalf of the MDPI Editorial Board and Staff, I am pleased to announce the launch of Complexities (ISSN: 3042-6448) [...]</p>
	]]></content:encoded>

	<dc:title>Complexities: An Open Access Journal for the Field of Complex Systems</dc:title>
			<dc:creator>José F. F. Mendes</dc:creator>
		<dc:identifier>doi: 10.3390/complexities1010001</dc:identifier>
	<dc:source>Complexities</dc:source>
	<dc:date>2025-02-27</dc:date>

	<prism:publicationName>Complexities</prism:publicationName>
	<prism:publicationDate>2025-02-27</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Editorial</prism:section>
	<prism:startingPage>1</prism:startingPage>
		<prism:doi>10.3390/complexities1010001</prism:doi>
	<prism:url>https://www.mdpi.com/3042-6448/1/1/1</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
    
<cc:License rdf:about="https://creativecommons.org/licenses/by/4.0/">
	<cc:permits rdf:resource="https://creativecommons.org/ns#Reproduction" />
	<cc:permits rdf:resource="https://creativecommons.org/ns#Distribution" />
	<cc:permits rdf:resource="https://creativecommons.org/ns#DerivativeWorks" />
</cc:License>

</rdf:RDF>
