相关论文: The continuum limit of the Kuramoto model on spars…
We generalize the Kuramoto model for coupled phase oscillators by allowing the frequencies to drift in time according to Ornstein-Uhlenbeck dynamics. Such drifting frequencies were recently measured in cellular populations of circadian…
Consider a critical Erd\"os-R\'enyi random graph: $n$ is the number of vertices, each one of the $\binom{n}{2}$ possible edges is kept in the graph independently from the others with probability $n^{-1}+\lambda n^{-4/3}$, $\lambda$ being a…
We study Kuramoto phase oscillators with temporal fluctuations in the frequencies. The infinite-dimensional system can be reduced in a Gaussian approximation to two first-order differential equations. This yields a solution for the…
The hypothesis, that cortical dynamics operates near criticality also suggests, that it exhibits universal critical exponents which marks the Kuramoto equation, a fundamental model for synchronization, as a prime candidate for an underlying…
How can we approximate sparse graphs and sequences of sparse graphs (with unbounded average degree)? We consider convergence in the first $k$ moments of the graph spectrum (equivalent to the numbers of closed $k$-walks) appropriately…
Dynamics of complex systems are often driven by interactions that extend beyond pairwise links, underscoring the need to establish a correspondence between interpretable system parameters and emergent phenomena in hypergraph-based networks.…
The global clustering coefficient serves as a powerful metric for the structural analysis and comparison of complex networks. Random geometric graphs offer a realistic framework for representing the spatial constraints and geometry often…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
This paper concerns the large deviations of a system of interacting particles on a random graph. There is no stochasticity, and the only sources of disorder are the random graph connections, and the initial condition. The average number of…
In this paper, we study the inertial Kuramoto-Sakaguchi equation for interacting oscillatory systems. On the one hand, we prove the convergence toward corresponding phase-homogeneous stationary states in weighted Lebesgue norm sense when…
Stochastic dynamics on sparse graphs and disordered systems often lead to complex behaviors characterized by heterogeneity in time and spatial scales, slow relaxation, localization, and aging phenomena. The mathematical tools and…
We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…
Motivated by applications, the last few years have witnessed tremendous interest in understanding the structure as well as the behavior of dynamics for inhomogeneous random graph models. In this study we analyze the maximal components at…
In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…
We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
We consider dynamics of the empirical measure of vertex neighborhood states of Markov interacting jump processes on sparse random graphs, in a suitable asymptotic limit as the graph size goes to infinity. Under the assumption of a certain…
We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs…
We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a…
We study the Kuramoto model (KM) of coupled phase oscillators on graphs approximating the Sierpinski gasket (SG). As the size of the graph tends to infinity, the limit points of the sequence of stable equilibria in the KM correspond to the…