Imagen de Portada

Scale-free cascading failures: Generalized approach for all simple, connected graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Janicka, Agnieszka, Sloothaak, Fiona, Vlasiou, Maria
Formato:	Preprint
Publicado:	2024
Materias:	Probability
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Emergence of Scale-Free Traffic Jams in Highway Networks: A Probabilistic Approach
por: Janicka, Agnieszka, et al.
Publicado: (2025)

Heavy tails in dynamic flow networks: Universal explanation of their emergence
por: Janicka, Agnieszka, et al.
Publicado: (2026)

Stability conditions of the $N$-model with a waiting time dependent threshold on the diagonal
por: van Kempen, Sanne, et al.
Publicado: (2025)

Learning payoffs while routing in skill-based queues
por: van Kempen, Sanne, et al.
Publicado: (2024)

Asymptotically optimal reinforcement learning in Block Markov Decision Processes
por: van Vuren, Thomas, et al.
Publicado: (2025)

Optimization of inventory and capacity in large-scale assembly systems using extreme-value theory
por: Meijer, Mirjam S., et al.
Publicado: (2021)

Geometric random intersection graphs with general connection probabilities
por: Deijfen, Maria, et al.
Publicado: (2023)

The number of connected components in sub-critical random graph processes
por: Corujo, Josué
Publicado: (2024)

The connectivity and phase transition in inhomogeneous random graphs of finite types
por: Jung, Hamin
Publicado: (2024)

Scaling limits of Lévy walks with random velocities
por: Woszczek, Hubert, et al.
Publicado: (2026)

Condensation in scale-free geometric graphs with excess edges
por: van der Hofstad, Remco, et al.
Publicado: (2024)

Large deviations for triangles in scale-free random graphs
por: Stegehuis, Clara, et al.
Publicado: (2023)

Uniqueness of the infinite connected component for the vacant set of random interlacements on amenable transient graphs
por: Mu, Yingxin, et al.
Publicado: (2023)

The typical structure of dense claw-free graphs
por: Perkins, Will, et al.
Publicado: (2025)

On the chromatic number of random triangle-free graphs
por: Mizgerd, Clayton, et al.
Publicado: (2025)

Quasi-multiplicativity and regularity for metric graph Gaussian free fields
por: Cai, Zhenhao, et al.
Publicado: (2024)

The probability of connection between two vertices cannot be monotone with the distance for Bernoulli Percolation on transitive graphs
por: Campos, Alberto M., et al.
Publicado: (2026)

Microcanonical cascades and random homeomorphisms
por: Chen, Xinxin, et al.
Publicado: (2025)

Heterochromatic two-arm probabilities for metric graph Gaussian free fields
por: Cai, Zhenhao, et al.
Publicado: (2025)

Separation and cut edge in macroscopic clusters for metric graph Gaussian free fields
por: Cai, Zhenhao, et al.
Publicado: (2025)

Sequencing, task failures, and capacity when failures are driven by a non-homogeneous Poisson process
por: Zhu, Lingjiong, et al.
Publicado: (2025)

Localized geometry detection in scale-free random graphs
por: Bet, Gianmarco, et al.
Publicado: (2023)

The largest $K_r$-free set of vertices in a random graph
por: Bohman, Tom, et al.
Publicado: (2026)

Scaled Brownian motion with random anomalous diffusion exponent
por: Woszczek, Hubert, et al.
Publicado: (2024)

Normal approximation of the numbers of isolated edges and isolated 2-stars in uniform simple graphs with given vertex degrees
por: Imai, Ryo
Publicado: (2026)

Infinitesimal generators for a family of polynomial processes -- an algebraic approach
por: Wesołowski, Jacek, et al.
Publicado: (2023)

Incipient infinite clusters and volume growth for Gaussian free fields and loop soups on metric graphs
por: Cai, Zhenhao, et al.
Publicado: (2024)

Residual connections provably mitigate oversmoothing in graph neural networks
por: Chen, Ziang, et al.
Publicado: (2025)

Modularity and partially observed graphs
por: McDiarmid, Colin, et al.
Publicado: (2021)

Triangle-free $d$-degenerate graphs have small fractional chromatic number
por: Martinsson, Anders
Publicado: (2025)

Modularity and random graphs
por: McDiarmid, Colin, et al.
Publicado: (2025)

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
por: Galanis, Andreas, et al.
Publicado: (2023)

$d$-connectivity of the random graph with restricted budget
por: Lichev, Lyuben
Publicado: (2022)

k-connectivity threshold for superpositions of Bernoulli random graphs
por: Ardickas, Daumilas, et al.
Publicado: (2025)

Cyclic fractional Gaussian noise: time and frequency domain properties
por: Woszczek, Hubert, et al.
Publicado: (2026)

A switching identity for cable-graph loop soups and Gaussian free fields
por: Werner, Wendelin
Publicado: (2025)

Conformal field theory of Gaussian free fields in a multiply connected domain
por: Alberts, Tom, et al.
Publicado: (2024)

Hierarchical symmetry selects log-Poisson cascades: classification, uniqueness, and stability
por: Freeburg, E. M.
Publicado: (2026)

Cutoff of the simple exclusion process with inhomogeneous conductances
por: Yang, Shangjie
Publicado: (2024)

Temporal connectivity of Random Geometric Graphs
por: Brandenberger, Anna, et al.
Publicado: (2025)