Continuous-time independent edge-Markovian random graph process
From MaRDI portal
Recommendations
Cites work
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Flooding time in edge-Markovian dynamic graphs
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Parsimonious flooding in dynamic graphs
- The degree sequences and spectra of scale-free random graphs
Cited in
(9)- A time-invariant random graph with splitting events
- Data aggregation in mobile wireless sensor networks represented as stationary edge-Markovian evolving graphs
- When Markov chains meet: a continuous-time model of network evolution
- Continuous Time Markov Processes on Graphs
- Filtering Random Graph Processes Over Random Time-Varying Graphs
- IPA for continuous stochastic marked graphs
- Finite family trees of continuous time birth and death processes for evaluating the transmitting speed of information on communication networks
- Continuous Time Graph Processes with Known ERGM Equilibria: Contextual Review, Extensions, and Synthesis
- A continuous-time N -interaction random graph model
This page was built for publication: Continuous-time independent edge-Markovian random graph process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q270157)