BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Matjaz Perc

Matjaz Perc contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
physics.soc-phPopulations and EvolutionSocial and Information Networkscond-mat.softnlin.AOArtificial Intelligencecond-mat.stat-mecheess.IVeess.SPmath-phmath.MPnlin.CDphysics.app-phphysics.comp-phphysics.data-an

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
14works
0followers
15topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

14 published item(s)

preprint2026arXiv

Bipartite structure and dynamics of political corruption networks

Political corruption is inherently an affiliation process linking agents to corruption cases; yet it is often studied via one-mode projections that connect co-offenders within the same scandal, implying a loss of information that potentially confounds properties of agents and cases. Here, we adopt a bipartite representation to analyze datasets of corruption scandals in Brazil and Spain spanning nearly three decades. By tracking the temporal growth of these networks, we quantify density and redundancy measures to capture partner reuse and co-occurrence across cases. Networks in both countries become progressively sparser over time, and agent redundancy is systematically higher than case redundancy, indicating a small cadre of recidivists who recombine largely with novice partners rather than forming durable co-offending ties. These networks exhibit near-exponential degree distributions, reflecting low recidivism and likely high coordination costs and secrecy constraints of large-scale scandals. Our bipartite view further reveals a moderate cross-mode disassortative degree mixing between agents and cases, with high-degree agents distributing their activity across small cases and large scandals mainly comprising low-degree participants. Finally, identifying atypical individuals within the bipartite structure reveals criminal trajectories marked by a gradual rise in network embeddedness that can appear ordinary in agent-projected networks.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Strategic commitments shape collective cybersecurity under AI inequality

The growing integration of AI into cybersecurity is reshaping the balance between attackers and defenders. When access to advanced AI-enabled defence tools is uneven, resource-limited defenders may be unable to adopt effective protection, creating persistent system vulnerabilities. We study the impact of differential AI access using an evolutionary game-theoretic model in a finite population. We first show that when high-capability defence is costly, the population is driven toward low-cost, weak-defence behaviour, sustaining attacks and weakening long-run security. To address this problem, we introduce differential access to AI defence tools by allowing defenders to choose between low- and high-capability protection based on their resources. We then examine the role of a small group of committed defenders who always adopt strong defence and influence others through social learning. Although commitment increases the prevalence of strong defence, it alone cannot stabilise secure outcomes due to high defence costs. We therefore incorporate a targeted subsidy to remove the cost disadvantage from committed defenders. Our analysis shows that subsidised commitment significantly increases strong defence adoption, suppresses successful attacks, and improves overall system resilience. Simulations across a broad parameter space confirm that subsidies consistently outperform commitment alone. In addition, social-welfare analysis shows improved defender outcomes while keeping attacker gains low. These findings suggest that targeted support for key defenders can be an effective mechanism for stabilising cybersecurity in AI-driven environments and provide a theoretical bridge between cybersecurity policy, AI governance, and strategic allocation of defensive AI capabilities.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Determining liquid crystal properties with ordinal networks and machine learning

Machine learning methods are becoming increasingly important for the development of materials science. In spite of this, the use of image analysis in the development of these systems is still recent and underexplored, especially in materials often studied via optical imaging techniques such as liquid crystals. Here we apply the recently proposed method of ordinal networks to map optical textures obtained from experimental samples of liquid crystals into complex networks and use this representation jointly with a simple statistical learning algorithm to investigate different physical properties of these materials. Our research demonstrates that ordinal networks formed by only 24 nodes encode crucial information about liquid crystal properties, thus allowing us to train simple machine learning models capable of identifying and classifying mesophase transitions, distinguishing among different doping concentrations used to induce chiral mesophases, and predicting sample temperatures with outstanding accuracy. The precision and scalability of our approach indicate it can be used to probe properties of different materials in situations involving large-scale datasets or real-time monitoring systems.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Dynamics on higher-order networks: A review

Network science has evolved into an indispensable platform for studying complex systems. But recent research has identified limits of classical networks, where links connect pairs of nodes, to comprehensively describe group interactions. Higher-order networks, where a link can connect more than two nodes, have therefore emerged as a new frontier in network science. Since group interactions are common in social, biological, and technological systems, higher-order networks have recently led to important new discoveries across many fields of research. We here review these works, focusing in particular on the novel aspects of the dynamics that emerges on higher-order networks. We cover a variety of dynamical processes that have thus far been studied, including different synchronization phenomena, contagion processes, the evolution of cooperation, and consensus formation. We also outline open challenges and promising directions for future research.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Social physics

Recent decades have seen a rise in the use of physics methods to study different societal phenomena. This development has been due to physicists venturing outside of their traditional domains of interest, but also due to scientists from other disciplines taking from physics the methods that have proven so successful throughout the 19th and the 20th century. Here we dub this field 'social physics' and pay our respect to intellectual mavericks who nurtured it to maturity. We do so by reviewing the current state of the art. Starting with a set of topics that are at the heart of modern human societies, we review research dedicated to urban development and traffic, the functioning of financial markets, cooperation as the basis for our evolutionary success, the structure of social networks, and the integration of intelligent machines into these networks. We then shift our attention to a set of topics that explore potential threats to society. These include criminal behaviour, large-scale migrations, epidemics, environmental challenges, and climate change. We end the coverage of each topic with promising directions for future research. Based on this, we conclude that the future for social physics is bright. Physicists studying societal phenomena are no longer a curiosity, but rather a force to be reckoned with. Notwithstanding, it remains of the utmost importance that we continue to foster constructive dialogue and mutual respect at the interfaces of different scientific disciplines.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Swarmalators under competitive time-varying phase interactions

Swarmalators are entities with the simultaneous presence of swarming and synchronization that reveal emergent collective behavior due to the fascinating bidirectional interplay between phase and spatial dynamics. Although different coupling topologies have already been considered, here we introduce time-varying competitive phase interaction among swarmalators where the underlying connectivity for attractive and repulsive coupling varies depending on the vision (sensing) radius. Apart from investigating some fundamental properties like conservation of center of position and collision avoidance, we also scrutinize the cases of extreme limits of vision radius. The concurrence of attractive-repulsive competitive phase coupling allows the exploration of diverse asymptotic states, like static $π$, and mixed phase wave states, and we explore the feasible routes of those states through a detailed numerical analysis. In sole presence of attractive local coupling, we reveal the occurrence of static cluster synchronization where the number of clusters depends crucially on the initial distribution of positions and phases of each swarmalator. In addition, we analytically calculate the sufficient condition for the emergence of the static synchronization state. We further report the appearance of the static ring phase wave state and evaluate its radius theoretically. Finally, we validate our findings using Stuart-Landau oscillators to describe the phase dynamics of swarmalators subject to attractive local coupling.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Universality of political corruption networks

Corruption crimes demand highly coordinated actions among criminal agents to succeed. But research dedicated to corruption networks is still in its infancy and indeed little is known about the properties of these networks. Here we present a comprehensive investigation of corruption networks related to political scandals in Spain and Brazil over nearly three decades. We show that corruption networks of both countries share universal structural and dynamical properties, including similar degree distributions, clustering and assortativity coefficients, modular structure, and a growth process that is marked by the coalescence of network components due to a few recidivist criminals. We propose a simple model that not only reproduces these empirical properties but reveals also that corruption networks operate near a critical recidivism rate below which the network is entirely fragmented and above which it is overly connected. Our research thus indicates that actions focused on decreasing corruption recidivism may substantially mitigate this type of organized crime.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Vector Centrality in Hypergraphs

Identifying the most influential nodes in networked systems is of vital importance to optimize their function and control. Several scalar metrics have been proposed to that effect, but the recent shift in focus towards network structures which go beyond a simple collection of dyadic interactions has rendered them void of performance guarantees. We here introduce a new measure of node's centrality, which is no longer a scalar value, but a vector with dimension one lower than the highest order of interaction in a hypergraph. Such a vectorial measure is linked to the eigenvector centrality for networks containing only dyadic interactions, but it has a significant added value in all other situations where interactions occur at higher-orders. In particular, it is able to unveil different roles which may be played by the same node at different orders of interactions -- information that is otherwise impossible to retrieve by single scalar measures. We demonstrate the efficacy of our measure with applications to synthetic networks and to three real world hypergraphs, and compare our results with those obtained by applying other scalar measures of centrality proposed in the literature.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A novel route to cyclic dominance in voluntary social dilemmas

Cooperation is the backbone of modern human societies, making it a priority to understand how successful cooperation-sustaining mechanisms operate. Cyclic dominance, a non-transitive setup comprising at least three strategies wherein the first strategy overrules the second which overrules the third which, in turn, overrules the first strategy, is known to maintain bio-diversity, drive competition between bacterial strains, and preserve cooperation in social dilemmas. Here, we present a novel route to cyclic dominance in voluntary social dilemmas by adding to the traditional mix of cooperators, defectors, and loners, a fourth player type, risk-averse hedgers, who enact tit-for-tat upon paying a hedging cost to avoid being exploited. When this cost is sufficiently small, cooperators, defectors, and hedgers enter a loop of cyclic dominance that preserves cooperation even under the most adverse conditions. In contrast, when the hedging cost is large, hedgers disappear, consequently reverting to the traditional interplay of cooperators, defectors, and loners. In the interim region of hedging costs, complex evolutionary dynamics ensues, prompting transitions between states with two, three, or four competing strategies. Our results thus reveal that voluntary participation is but one pathway to sustained cooperation via cyclic dominance.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Exit rights open complex pathways to cooperation

We study the evolutionary dynamics of the prisoner's dilemma game in which cooperators and defectors interact with another actor type called exiters. Rather than being exploited by defectors, exiters exit the game in favour of a small payoff. We find that this simple extension of the game allows cooperation to flourish in well-mixed populations when iterations or reputation are added. In networked populations, however, the exit option is less conducive to cooperation. Instead, it enables the coexistence of cooperators, defectors, and exiters through cyclic dominance. Other outcomes are also possible as the exit payoff increases or the network structure changes, including network-wide oscillations in actor abundances that may cause the extinction of exiters and the domination of defectors, although game parameters should favour exiting. The complex dynamics that emerges in the wake of a simple option to exit the game implies that nuances matter even if our analyses are restricted to incentives for rational behaviour.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Learning physical properties of liquid crystals with deep convolutional neural networks

Machine learning algorithms have been available since the 1990s, but it is much more recently that they have come into use also in the physical sciences. While these algorithms have already proven to be useful in uncovering new properties of materials and in simplifying experimental protocols, their usage in liquid crystals research is still limited. This is surprising because optical imaging techniques are often applied in this line of research, and it is precisely with images that machine learning algorithms have achieved major breakthroughs in recent years. Here we use convolutional neural networks to probe several properties of liquid crystals directly from their optical images and without using manual feature engineering. By optimizing simple architectures, we find that convolutional neural networks can predict physical properties of liquid crystals with exceptional accuracy. We show that these deep neural networks identify liquid crystal phases and predict the order parameter of simulated nematic liquid crystals almost perfectly. We also show that convolutional neural networks identify the pitch length of simulated samples of cholesteric liquid crystals and the sample temperature of an experimental liquid crystal with very high precision.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Lying on networks: The role of structure and topology in promoting honesty

Lies can have a negating impact on governments, companies, and the society as a whole. Understanding the dynamics of lying is therefore of crucial importance across different fields of research. While lying has been studied before in well-mixed populations, it is a fact that real interactions are rarely well-mixed. Indeed, they are usually structured and thus best described by networks. Here we therefore use the Monte Carlo method to study the evolution of lying in the sender-receiver game in a one-parameter family of networks, systematically covering complete networks, small-world networks, and one-dimensional rings. We show that lies which benefit the sender at a cost to the receiver, the so-called black lies, are less likely to proliferate on networks than they do in well-mixed populations. Honesty is thus more likely to evolve, but only when the benefit for the sender is smaller than the cost for the receiver. Moreover, this effect is particularly strong in small-world networks, but less so in the one-dimensional ring. For lies that favor the receiver at a cost to the sender, the so-called altruistic white lies, we show that honesty is also more likely to evolve than it is in well-mixed populations. But contrary to black lies, this effect is more expressed in the one-dimensional ring, whereas in small-world networks it is present only when the cost to the sender is greater than the benefit for the receiver. Lastly, for lies that benefit both the sender and the receiver, the so-called Pareto white lies, we show that the network structure actually favors the evolution of lying, but this only when the benefit for the sender is slightly greater than the benefit for the receiver. In this case again the small-world topology acts as an amplifier of the effect, while other network topologies fail to do the same.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

The evolution of trust and trustworthiness

Trust and trustworthiness form the basis for continued social and economic interactions, and they are also fundamental for cooperation, fairness, honesty, and indeed for many other forms of prosocial and moral behavior. However, trust entails risks, and building a trustworthy reputation requires effort. So how did trust and trustworthiness evolve, and under which conditions do they thrive? To find answers, we operationalize trust and trustworthiness using the trust game with the trustor's investment and the trustee's return of the investment as the two key parameters. We study this game on different networks, including the complete network, random and scale-free networks, and in the well-mixed limit. We show that in all but one case the network structure has little effect on the evolution of trust and trustworthiness. Specifically, for well-mixed populations, lattices, random and scale-free networks, we find that trust never evolves, while trustworthiness evolves with some probability depending on the game parameters and the updating dynamics. Only for the scale-free network with degree non-normalized dynamics, we find parameter values for which trust evolves but trustworthiness does not, as well as values for which both trust and trustworthiness evolve. We conclude with a discussion about mechanisms that could lead to the evolution of trust and outline directions for future work.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Time irreversibility and amplitude irreversibility measures for nonequilibrium processes

Time irreversibility, which characterizes nonequilibrium processes, can be measured based on the probabilistic differences between symmetric vectors. To simplify the quantification of time irreversibility, symmetric permutations instead of symmetric vectors have been employed in some studies. However, although effective in practical applications, this approach is conceptually incorrect. Time irreversibility should be measured based on the permutations of symmetric vectors rather than symmetric permutations, whereas symmetric permutations can instead be employed to determine the quantitative amplitude irreversibility -- a novel parameter proposed in this paper for nonequilibrium calculated by means of the probabilistic difference in amplitude fluctuations. Through theoretical and experimental analyses, we highlight the strong similarities and close associations between the time irreversibility and amplitude irreversibility measures. Our paper clarifies the connections of and the differences between the two types of permutation-based parameters for quantitative nonequilibrium, and by doing so, we bridge the concepts of amplitude irreversibility and time irreversibility and broaden the selection of quantitative tools for studying nonequilibrium processes in complex systems.

0 citations0 reviewsNo code linkedOpen access