The jamming constant of uniform random graphs

DOI10.1016/j.spa.2016.10.005zbMath1367.60094arXiv1310.8475OpenAlexW2297747523MaRDI QIDQ2359716

Paola Bermolen, Pascal Moyal, Matthieu Jonckheere

Publication date: 22 June 2017

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.8475

zbMATH Keywords

hydrodynamic limitrandom graphconfiguration modelmeasure-valued Markov processparking process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Continuous-time Markov processes on general state spaces (60J25) Functional limit theorems; invariance principles (60F17) Limit theorems for vector-valued random variables (infinite-dimensional case) (60B12)

Related Items

SIR dynamics with vaccination in a large configuration model, Surprising identities for the greedy independent set on Cayley trees, Markovian online matching algorithms on large bipartite random graphs, Large Deviation Principle for the Greedy Exploration Algorithm over Erd\"os-R\'enyi Graphs, Large deviations for the greedy exploration process on configuration models, Generalized random sequential adsorption on Erdős-Rényi random graphs, Scaling limits and generic bounds for exploration processes, Corrected mean-field model for random sequential adsorption on random geometric graphs, Degree-dependent threshold-based random sequential adsorption on random trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large graph limit for an SIR process in random network with heterogeneous connectivity
• Stopping times and tightness
• Analysis of greedy algorithms on graphs with bounded degrees
• Differential equations for random processes and random graphs
• A functional central limit theorem for the \(M/GI/\infty \) queue
• Construction of the thermodynamic jamming limit for the parking process and other exclusion schemes on \(\mathbb Z^d\)
• Perfect simulation for interacting point processes, loss networks and Ising models.
• Random Graphs and Complex Networks
• Stochastic Modeling and Analysis of Telecom Networks
• Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections
• Weak convergence of sequences of semimartingales with applications to multitype branching processes
• A criterion of convergence of measure‐valued processes: application to measure branching processes
• Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics
• The Greedy Independent Set in a Random Graph with Given Degrees
• Stochastic Geometry and Wireless Networks: Volume I Theory
• The probability that a random multigraph is simple. II
• Random parking, sequential adsorption, and the jamming limit