Skip to main navigation
Skip to search
Skip to main content
the Research Portal - University of Namur Home
English
Français
Home
Profiles
Research units
Projects
Research output
Student theses
Equipment
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Speeding up non-Markovian First Passage Percolation with a few extra edges
Alexey Medvedev
, Gábor Pete
Namur Institute for Complex Systems
Unite de recherche en mathematiques appliquees et complexite
Research output
:
Contribution to journal
›
Article
›
peer-review
42
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Speeding up non-Markovian First Passage Percolation with a few extra edges'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Non-Markovian
100%
Passage Time
100%
First Passage Percolation
100%
Expected Time
66%
Bounded Variables
33%
Complete Graph
33%
Acceleration Effect
33%
Bottleneck Edge
33%
Random Tree
33%
Natural Model
33%
Uniform Spanning Tree
33%
Locally Tree-like
33%
Infinite Mean
33%
Critical Galton-Watson Tree
33%
Identically Distributed
33%
INIS
graphs
100%
markov process
100%
randomness
83%
distribution
16%
interactions
16%
power
16%
roots
16%
size
16%
acceleration
16%
criticality
16%
Mathematics
Edge
100%
Random Graph
75%
Passage Time
75%
Spanning Tree
25%
Tree-Like
25%
Connected Graph
25%
Complete Graph
25%
Real Life
25%
Power Law Distribution
25%