中文
相关论文

相关论文: Mean-field behavior of the negative-weight percola…

200 篇论文

We study numerically the geometrical properties of minimally weighted paths that appear in the negative-weight percolation (NWP) model on two-dimensional lattices assuming a combination of periodic and free boundary conditions (BCs). Each…

无序系统与神经网络 · 物理学 2013-03-27 C. Norrenbrock , O. Melchert , A. K. Hartmann

We study the complete graph equipped with a topology induced by independent and identically distributed edge weights. The focus of our analysis is on the weight W_n and the number of edges H_n of the minimal weight path between two distinct…

We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…

概率论 · 数学 2024-11-01 Chenlin Gu , Jianping Jiang , Yuval Peres , Zhan Shi , Hao Wu , Fan Yang

In this paper we consider first-passage percolation on certain 1-dimensional periodic graphs, such as the $\Z\times\{0,1,\ldots,K-1\}^{d-1}$ nearest neighbour graph for $d,K\geq1$. We find that both length and weight of minimal-weight paths…

概率论 · 数学 2015-04-28 Daniel Ahlberg

The directed bond percolation is a paradigmatic model in nonequilibrium statistical physics. It captures essential physical information on the nature of continuous phase transition between active and absorbing states. In this paper, we…

We study the mean traversal time for a class of random walks on Newman-Watts small-world networks, in which steps around the edge of the network occur with a transition rate F that is different from the rate f for steps across small-world…

无序系统与神经网络 · 物理学 2009-11-11 P. E. Parris , V. M. Kenkre

The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…

无序系统与神经网络 · 物理学 2019-06-05 Satoshi Takabe , Takafumi Nakano , Tadashi Wadayama

We study the trajectory of a simple random walk on a d-regular graph with d>2 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these…

概率论 · 数学 2015-05-20 Jiri Cerny , Augusto Teixeira , David Windisch

We consider self-avoiding walk, percolation and the Ising model with long and finite range. By means of the lace expansion we prove mean-field behavior for these models if $d>2(\alpha\wedge2)$ for self-avoiding walk and the Ising model, and…

概率论 · 数学 2009-11-13 Markus Heydenreich , Remco van der Hofstad , Akira Sakai

We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the…

概率论 · 数学 2023-03-21 Alexander Drewitz , Alexis Prévost , Pierre-François Rodriguez

Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…

概率论 · 数学 2025-12-18 Remco van der Hofstad

In this work we study the dynamics of systems composed of numerous interacting elements interconnected through a random weighted directed graph, such as models of random neural networks. We develop an original theoretical approach based on…

混沌动力学 · 物理学 2015-09-30 Gilles Wainrib , Mathieu Galtier

We study paths of time-length $t$ of a continuous-time random walk on $\mathbb Z^2$ subject to self-interaction that depends on the geometry of the walk range and a collection of random, uniformly positive and finite edge weights. The…

概率论 · 数学 2020-01-06 Marek Biskup , Eviatar B. Procaccia

Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…

概率论 · 数学 2018-09-12 Souvik Dhara

Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…

数据结构与算法 · 计算机科学 2011-02-02 Oksana Denysyuk , Luis Rodrigues

We prove results for first-passage percolation on the configuration model with i.i.d. degrees having finite mean, infinite variance and i.i.d. weights with strictly positive support of the form Y=a+X, where a is a positive constant. We…

概率论 · 数学 2016-09-26 Enrico Baroni , Remco van der Hofstad , Julia Komjathy

We study the critical behavior and phase diagram of the $d$-dimensional random field O(N) model by means of the nonperturbative functional renormalization group approach presented in the preceding paper. We show that the dimensional…

统计力学 · 物理学 2011-07-20 Matthieu Tissier , Gilles Tarjus

Motivated by considerations from neuroscience (macroscopic behavior of large ensembles of interacting neurons), we consider a population of mean field interacting diffusions in $\mathbf {R}^m$ in the presence of a random environment and…

概率论 · 数学 2014-07-03 Eric Luçon , Wilhelm Stannat

We study the critical behavior for percolation on inhomogeneous random networks on $n$ vertices, where the weights of the vertices follow a power-law distribution with exponent $\tau \in (2,3)$. Such networks, often referred to as…

概率论 · 数学 2021-07-12 Shankar Bhamidi , Souvik Dhara , Remco van der Hofstad

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

概率论 · 数学 2022-09-30 Ercan Sönmez , Arnaud Rousselle