Random graph dynamics
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Dominant vertices in regulatory networks dynamics
- Rulers and slaves in a random social group
- Autoregressive cascades on random networks
- Symmetric graph properties have independent edges
- Contact processes with random connection weights on regular graphs
- On the convergence rate of diffusion in the bidirectional Erdős-Rényi networks: an \(H^2\)-norm perspective
- Extinction time for the contact process on general graphs
- On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
- A population evolution model and its applications to random networks
- A stochastic SIR network epidemic model with preventive dropping of edges
- Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting
- Calculation of precise constants in a probability model of Zipf's law generation and asymptotics of sums of multinomial coefficients
- Change point detection in network models: preferential attachment and long range dependence
- Cluster tails for critical power-law inhomogeneous random graphs
- Invasion fronts on graphs: the Fisher-KPP equation on homogeneous trees and Erdős-Réyni graphs
- Reducing mosquito-borne disease outbreak size: the relative importance of contact and transmissibility in a network model
- A note on maximizing the spread of influence in social networks
- A network with tunable clustering, degree correlation and degree distribution, and an epidemic thereon
- Large deviations for the degree structure in preferential attachment schemes
- Degree asymptotics with rates for preferential attachment random graphs
- Visualizing bivariate long-tailed data
- Contact processes on scale-free networks
- First passage percolation on random graphs with finite mean degrees
- Controlling the spread of COVID-19 on college campuses
- PageRank on inhomogeneous random digraphs
- Computing exact \(p\)-values for community detection
- Mean first passage time of preferential random walks on complex networks with applications
- On the connectivity of configuration graphs
- A two-stage contact process on scale-free networks
- Persistence of hubs in growing random networks
- Tree builder random walk: recurrence, transience and ballisticity
- A random graph of moderate density
- Susceptible-infected epidemics on evolving graphs
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs
- Asymptotic degree distribution in a homogeneous evolving network model
- A mechanistic model captures livestock trading, disease dynamics, and compensatory behaviour in response to control measures
- On asymptotic properties of Bell polynomials and concentration of vertex degree of large random graphs
- Emergent networks in fractional percolation
- Chaotic fluctuations in graphs with amplification
- Epidemic spreading and equilibrium social distancing in heterogeneous networks
- Sizes of trees in a random forest and configuration graphs
- Root finding algorithms and persistence of Jordan centrality in growing random trees
- Normal approximations for discrete-time occupancy processes
- Mean field dynamics of stochastic cellular automata for random and small-world graphs
- Long paths in first passage percolation on the complete graph II. Global branching dynamics
- Barabási-Albert random graph with multiple type edges and perturbation
- Dense subgraphs of power-law random graphs
- Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit
- Large and moderate deviation principles for susceptible-infected-removed epidemic in a random environment
- PageRank's behavior under degree correlations
- Central limit theorems for SIR epidemics and percolation on configuration model random graphs
- The duration of a supercritical \(\mathit{SIR}\) epidemic on a configuration model
- Dynamics of stochastic epidemics on heterogeneous networks
- Measuring edge importance: a quantitative analysis of the stochastic shielding approximation for random processes on graphs
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- A version of Herbert A. Simon's model with slowly fading memory and its connections to branching processes
- The mystery of the six degrees of separation. I: From order to random
- The mystery of the six degrees of separation. II: Navigability and small worlds
- Mixing time of vertex-weighted exponential random graphs
- Evolutionary dynamics on graphs -- the effect of graph structure and initial placement on mutant spread
- The eternal multiplicative coalescent encoding via excursions of Lévy-type processes
- Scale-free percolation in continuum space
- On the asymptotics of degree structure of configuration graphs with bounded number of edges
- Taylor's power law for the \(N\)-stars network evolution model
- A queueing model with independent arrivals, and its fluid and diffusion limits
- Degree distribution of shortest path trees and bias of network sampling algorithms
- The structure of typical clusters in large sparse random configurations
- Heterogeneous network epidemics: real-time growth, variance and extinction of infection
- Susceptible-infectious-recovered models revisited: from the individual level to the population level
- Epidemics on random intersection graphs
- On certain connectivity properties of the internet topology
- Percolation with constant freezing
- Applications of the variance of final outbreak size for disease spreading in networks
- Evolution of social networks
- Time-varying network models
- Scale-free property for degrees and weights in an \(N\)-interactions random graph model
- Projecting COVID-19 cases and hospital burden in Ohio
- A central limit theorem for diffusion in sparse random graphs
- Random graph dynamics
- First passage percolation on the Newman-Watts small world model
- Almost giant clusters for percolation on large trees with logarithmic heights
- Introduction to Random Graphs
- Asymptotic equivalence and contiguity of some random graphs
- The order of the giant component of random hypergraphs
- Resolvent of large random graphs
- A system of grabbing particles related to Galton-Watson trees
- Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks
- Cooperative assembly systems
- Micro- and macromodels of social networks. I: Theory fundamentals
- Birth of a strongly connected giant in an inhomogeneous random digraph
- Inhomogeneous financial networks and contagious links
- Limit theorems for the weights and the degrees in an N-interactions random graph model
- On the asymptotic behavior of a dynamic version of the Neyman contagious point process
- Metastability: a brief introduction through three examples
- Construction of directed assortative configuration graphs
- Metastability for the contact process on the preferential attachment graph
- Mixing Time of Random Walk on Poisson Geometry Small World
- Symmetric graph properties have independent edges
- Some introductory notes on random graphs
- Two evolving social network models
This page was built for publication: Random graph dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3425140)
