相关论文: Stability of shortest paths in complex networks wi…

We review results on the scaling of the optimal path length in random networks with weighted links or nodes. In strong disorder we find that the length of the optimal path increases dramatically compared to the known small world result for…

We study the transition between the strong and weak disorder regimes in the scaling properties of the average optimal path $\ell_{\rm opt}$ in a disordered Erd\H{o}s-R\'enyi (ER) random network and scale-free (SF) network. Each link $i$ is…

We prove that the local limit of the weighted spanning trees on any simple connected high degree almost regular sequence of electric networks is the Poisson(1) branching process conditioned to survive forever, by generalizing [NP22] and…

The resiliency of a network is its ability to remain \emph{effectively} functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size, and this conflicts with the…

We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution…

Scale-free (SF) networks and small world networks have been found to occur in very diverse contexts. It is this striking universality which makes one look for widely applicable mechanisms which lead to the formation of such networks. In…

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…

The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate…

Many real networks present a bounded scale-free behavior with a connectivity cut-off due to physical constraints or a finite network size. We study epidemic dynamics in bounded scale-free networks with soft and hard connectivity cut-offs.…

In the recent past, there has been a concerted effort to develop mathematical models for real-world networks and to analyze various dynamics on these models. One particular problem of significant importance is to understand the effect of…

In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large…

We study the dynamics of excitable integrate-and-fire neurons in a small-world network. At low densities $p$ of directed random connections, a localized transient stimulus results in either self-sustained persistent activity or in a brief…

The Contact Process has been studied on complex networks exhibiting different kinds of quenched disorder. Numerical evidence is found for Griffiths phases and other rare region effects, in Erd\H os R\'enyi networks, leading rather…

Spanning trees are an important quantity characterizing the reliability of a network, however, explicitly determining the number of spanning trees in networks is a theoretical challenge. In this paper, we study the number of spanning trees…

We study numerically the mean access times for random walks on hybrid disordered structures formed by embedding scale-free networks into regular lattices, considering different transition rates for steps across lattice bonds ($F$) and…

We consider shallow (single hidden layer) neural networks and characterize their performance when trained with stochastic gradient descent as the number of hidden units $N$ and gradient descent steps grow to infinity. In particular, we…

In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…

The scale-free (SF) networks that have been studied so far contained quenched disorder generated by random dilution which does not vary with the time. In practice, if a SF network is to represent, for example, the worldwide web, then the…

In this thesis, we study a new disordered system called random spanning tree in random environment (RSTRE) across different families of graphs with varying disorder distributions. We examine several observables as functions of the disorder…

I extend a previous work to Susceptible-Infected-Susceptible (SIS) models on weighted Barab\'asi-Albert scale-free networks. Numerical evidence is provided that phases with slow, power-law dynamics emerge as the consequence of quenched…