Searcharxiv⌕ Search

arXiv subjects

Miguel A. Munoz

Publications and source records attributed to Miguel A. Munoz.

At least 37 records · Page 2Linked to original sources
arXiv2008

Critical wetting of a class of nonequilibrium interfaces: A computer simulation study

Critical wetting transitions under nonequilibrium conditions are studied numerically and analytically by means of an interface-displacement model defined by a Kardar-Parisi-Zhang equation, plus some extra terms representing a limiting, short-ranged attractive wall. Its critical behavior is characterized in detail by providing a set of exponents for both the average height and the surface order-parameter in one dimension. The emerging picture is qualitatively and quantitatively different from recently reported mean-field predictions for the same problem. Evidence is shown that the presence of the attractive wall induces an anomalous scaling of the interface local slopes.

cond-mat.stat-mech↗
arXiv2007

Network synchronization: Optimal and Pessimal Scale-Free Topologies

By employing a recently introduced optimization algorithm we explicitely design optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency towards disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting ``pessimal networks'' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability.

cond-mat.dis-nn↗
arXiv2007

Crystallization and melting of bacteria colonies and Brownian Bugs

Motivated by the existence of remarkably ordered cluster arrays of bacteria colonies growing in Petri dishes and related problems, we study the spontaneous emergence of clustering and patterns in a simple nonequilibrium system: the individual-based interacting Brownian bug model. We map this discrete model into a continuous Langevin equation which is the starting point for our extensive numerical analyses. For the two-dimensional case we report on the spontaneous generation of localized clusters of activity as well as a melting/freezing transition from a disordered or isotropic phase to an ordered one characterized by hexagonal patterns. We study in detail the analogies and differences with the well-established Kosterlitz-Thouless-Halperin-Nelson-Young theory of equilibrium melting, as well as with another competing theory. For that, we study translational and orientational correlations and perform a careful defect analysis. We find a non standard one-stage, defect-mediated, transition whose nature is only partially elucidated.

cond-mat.stat-mech↗
arXiv2007

Absorbing states and elastic interfaces in random media: two equivalent descriptions of self-organized criticality

We elucidate a long-standing puzzle about the non-equilibrium universality classes describing self-organized criticality in sandpile models. We show that depinning transitions of linear interfaces in random media and absorbing phase transitions (with a conserved non-diffusive field) are two equivalent languages to describe sandpile criticality. This is so despite the fact that local roughening properties can be radically different in the two pictures, as explained here. Experimental implications of our work as well as promising paths for future theoretical investigations are also discussed.

cond-mat.stat-mech↗
arXiv2007

How to discriminate easily between Directed-percolation and Manna scaling

Here we compare critical properties of systems in the directed-percolation (DP) universality class with those of absorbing-state phase transitions occurring in the presence of a non-diffusive conserved field, i.e. transitions in the so-called Manna or C-DP class. Even if it is clearly established that these constitute two different universality classes, most of their universal features (exponents, moment ratios, scaling functions,...) are very similar, making it difficult to discriminate numerically between them. Nevertheless, as illustrated here, the two classes behave in a rather different way upon introducing a physical boundary or wall. Taking advantage of this, we propose a simple and fast method to discriminate between these two universality classes. This is particularly helpful in solving some existing discrepancies in self-organized critical systems as sandpiles.

cond-mat.stat-mech↗
arXiv2006

Absorbing state phase transitions with a non-accessible vacuum

We analyze from the renormalization group perspective a universality class of reaction-diffusion systems with absorbing states. It describes models where the vacuum state is not accessible, as the set of reactions $2 A \to A$ together with creation processes of the form $A \to n A$ with $n \geq 2$. This class includes the (exactly solvable in one-dimension) {\it reversible} model $2 A \leftrightarrow A$ as a particular example, as well as many other {\it non-reversible} reactions, proving that reversibility is not the main feature of this class as previously thought. By using field theoretical techniques we show that the critical point appears at zero creation-rate (in accordance with exact results), and it is controlled by the well known pair-coagulation renormalization group fixed point, with non-trivial exactly computable critical exponents in any dimension. Finally, we report on Monte-Carlo simulations, confirming all field theoretical predictions in one and two dimensions for various reversible and non-reversible models.

cond-mat.stat-mech↗
arXiv2006

Sticky grains do not change the universality class of isotropic sandpiles

We revisit the sandpile model with ``sticky'' grains introduced by Mohanty and Dhar [Phys. Rev. Lett. {\bf 89}, 104303 (2002)] whose scaling properties were claimed to be in the universality class of directed percolation for both isotropic and directed models. Simulations in the so-called fixed-energy ensemble show that this conclusion is not valid for isotropic sandpiles and that this model shares the same critical properties of other stochastic sandpiles, such as the Manna model. %as expected from the existence of an extra %conservation-law, absent in directed percolation. These results are strengthened by the analysis of the Langevin equations proposed by the same authors to account for this problem which we show to converge, upon coarse-graining, to the well-established set of Langevin equations for the Manna class. Therefore, the presence of a conservation law keeps isotropic sandpiles, with or without stickiness, away from the directed percolation class.

cond-mat.stat-mech↗
arXiv2006

Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that

We report on some recent developments in the search for optimal network topologies. First we review some basic concepts on spectral graph theory, including adjacency and Laplacian matrices, and paying special attention to the topological implications of having large spectral gaps. We also introduce related concepts as ``expanders'', Ramanujan, and Cage graphs. Afterwards, we discuss two different dynamical feautures of networks: synchronizability and flow of random walkers and so that they are optimized if the corresponding Laplacian matrix have a large spectral gap. From this, we show, by developing a numerical optimization algorithm that maximum synchronizability and fast random walk spreading are obtained for a particular type of extremely homogeneous regular networks, with long loops and poor modular structure, that we call entangled networks. These turn out to be related to Ramanujan and Cage graphs. We argue also that these graphs are very good finite-size approximations to Bethe lattices, and provide almost or almost optimal solutions to many other problems as, for instance, searchability in the presence of congestion or performance of neural networks. Finally, we study how these results are modified when studying dynamical processes controlled by a normalized (weighted and directed) dynamics; much more heterogeneous graphs are optimal in this case. Finally, a critical discussion of the limitations and possible extensions of this work is presented.

cond-mat.other↗
arXiv2006

Kardar-Parisi-Zhang interfaces bounded by long-ranged potentials

We study unbinding transitions of a non-equilibrium Kardar-Parisi-Zhang (KPZ) interface in the presence of long-ranged substrates. Both attractive and repulsive substrates, as well as positive and negative Kardar-Parisi-Zhang nonlinearities, are considered, leading to four different physical situations. A detailed comparison with equilibrium wetting transitions as well as with non-equilibrium unbinding transitions in systems with short-ranged forces is presented, yielding a comprehensive picture of unbinding transitions, and of their classification into universality classes. These non-equilibrium transitions may play a crucial role in the dynamics of wetting or growth of systems with intrinsic anisotropies.

cond-mat.stat-mech↗
arXiv2006

Chemical etching of a disordered solid: from experiments to field theory

We present a two-dimensional theoretical model for the slow chemical corrosion of a thin film of a disordered solid by suitable etching solutions. This model explain different experimental results showing that the corrosion stops spontaneously in a situation in which the concentration of the etchant is still finite while the corrosion surface develops clear fractal features. We show that these properties are strictly related to the percolation theory, and in particular to its behavior around the critical point. This task is accomplished both by a direct analysis in terms of a self-organized version of the Gradient Percolation model and by field theoretical arguments.

cond-mat.stat-mech↗
arXiv2006

Synchronization in Network Structures: Entangled Topology as Optimal Architecture for Network Design

In these notes we study synchronizability of dynamical processes defined on complex networks as well as its interplay with network topology. Building from a recent work by Barahona and Pecora [Phys. Rev. Lett. 89, 054101 (2002)], we use a simulated annealing algorithm to construct optimally-synchronizable networks. The resulting structures, known as entangled networks, are characterized by an extremely homogeneous and interwoven topology: degree, distance, and betweenness distributions are all very narrow, with short average distances, large loops, and small modularity. Entangled networks exhibit an excellent (almost optimal) performance with respect to other flow or connectivity properties such as robustness, random walk minimal first-passage times, and good searchability. All this converts entangled networks in a powerful concept with optimal properties in many respects.

cond-mat.dis-nn↗
arXiv2005

Mean-field limit of systems with multiplicative noise

A detailed study of the mean-field solution of Langevin equations with multiplicative noise is presented. Three different regimes depending on noise-intensity (weak, intermediate, and strong-noise) are identified by performing a self-consistent calculation on a fully connected lattice. The most interesting, strong-noise, regime is shown to be intrinsically unstable with respect to the inclusion of fluctuations, as a Ginzburg criterion shows. On the other hand, the self-consistent approach is shown to be valid only in the thermodynamic limit, while for finite systems the critical behavior is found to be different. In this last case, the self-consistent field itself is broadly distributed rather than taking a well defined mean value; its fluctuations, described by an effective zero-dimensional multiplicative noise equation, govern the critical properties. These findings are obtained analytically for a fully connected graph, and verified numerically both on fully connected graphs and on random regular networks. The results presented here shed some doubt on what is the validity and meaning of a standard mean-field approach in systems with multiplicative noise in finite dimensions, where each site does not see an infinite number of neighbors, but a finite one. The implications of all this on the existence of a finite upper critical dimension for multiplicative noise and Kardar-Parisi-Zhang problems are briefly discussed.

cond-mat.stat-mech↗
arXiv2005

Entangled networks, synchronization, and optimal network topology

A new family of graphs, {\it entangled networks}, with optimal properties in many respects, is introduced. By definition, their topology is such that optimizes synchronizability for many dynamical processes. These networks are shown to have an extremely homogeneous structure: degree, node-distance, betweenness, and loop distributions are all very narrow. Also, they are characterized by a very interwoven (entangled) structure with short average distances, large loops, and no well-defined community-structure. This family of nets exhibits an excellent performance with respect to other flow properties such as robustness against errors and attacks, minimal first-passage time of random walks, efficient communication, etc. These remarkable features convert entangled networks in a useful concept, optimal or almost-optimal in many senses, and with plenty of potential applications computer science or neuroscience.

cond-mat.stat-mech↗
arXiv2005

Non-order parameter Langevin equation for a bounded Kardar-Parisi-Zhang universality class

We introduce a Langevin equation describing the pinning-depinning phase transition experienced by Kardar-Parisi-Zhang interfaces in the presence of a bounding ``lower-wall''. This provides a continuous description for this universality class, complementary to the different and already well documented one for the case of an ``upper-wall''. The Langevin equation is written in terms of a field that is not an order-parameter, in contrast to standard approaches, and is studied both by employing a systematic mean-field approximation and by means of a recently introduced efficient integration scheme. Our findings are in good agreement with known results from microscopic models in this class, while the numerical precision is improved. This Langevin equation constitutes a sound starting point for further analytical calculations, beyond mean-field, needed to shed more light on this poorly understood universality class.

cond-mat.stat-mech↗
arXiv2004

Detecting Network Communities: a new systematic and efficient algorithm

An efficient and relatively fast algorithm for the detection of communities in complex networks is introduced. The method exploits spectral properties of the graph Laplacian-matrix combined with hierarchical-clustering techniques, and includes a procedure to maximize the ``modularity'' of the output. Its performance is compared with that of other existing methods, as applied to different well-known instances of complex networks with a community-structure: both computer-generated and from the real-world. Our results are in all the tested cases, at least, as good as the best ones obtained with any other methods, and faster in most of the cases than methods providing similar-quality results. This converts the algorithm in a valuable computational tool for detecting and analyzing communities and modular structures in complex networks.

cond-mat.stat-mech↗
arXiv2003

Influence of topology on the performance of a neural network

We studied the computational properties of an attractor neural network (ANN) with different network topologies. Though fully connected neural networks exhibit, in general, a good performance, they are biologically unrealistic, as it is unlikely that natural evolution leads to such a large connectivity. We demonstrate that, at finite temperature, the capacity to store and retrieve binary patterns is higher for ANN with scale--free (SF) topology than for highly random--diluted Hopfield networks with the same number of synapses. We also show that, at zero temperature, the relative performance of the SF network increases with increasing values of the distribution power-law exponent. Some consequences and possible applications of our findings are discussed.

cond-mat.stat-mech↗
arXiv2003

Multiplicative Noise in Non-equilibrium Phase Transitions: A tutorial

Stochastic phenomena in which the noise amplitude is proportional to the fluctuating variable itself, usually called {\it multiplicative noise}, appear ubiquitously in physics, biology, economy and social sciences. The properties of spatially extended systems with this type of stochasticity, paying special attention to the {\it non-equilibrium phase transitions} these systems may exhibit, are reviewed here. In particular we study and classify the possible universality classes of such transitions, and discuss some specific physical realizations including depinning transitions of non-equilibrium interfaces, non-equilibrium wetting phenomena, synchronization of spatially extended systems and many others.

cond-mat↗