D
Dieter Mitsche
Researcher at Jean Monnet University
Publications - 146
Citations - 1100
Dieter Mitsche is an academic researcher from Jean Monnet University. The author has contributed to research in topics: Random graph & Vertex (geometry). The author has an hindex of 18, co-authored 138 publications receiving 969 citations. Previous affiliations of Dieter Mitsche include Centre national de la recherche scientifique & University of Nice Sophia Antipolis.
Papers
More filters
Proceedings Article
On the connectivity of dynamic random geometric graphs
TL;DR: The first analytical results for the connectivity of dynamic random geometric graphs --- a model of mobile wireless networks in which vertices move in random directions, and an edge exists between two vertices if their Euclidean distance is below a given value are provided.
Journal ArticleDOI
On the satisfiability threshold of formulas with three literals per clause
TL;DR: It is shown that any random formula over n variables, with a clauses-to-variables ratio of at least 4.4898 is, as n grows large, asymptotically almost surely unsatisfiable.
Journal ArticleDOI
Large Connectivity for Dynamic Random Geometric Graphs
TL;DR: The first rigorous analytical results for the connectivity of dynamic random geometric graphs - a model for mobile wireless networks in which vertices move in random directions in the unit torus are provided.
Journal ArticleDOI
Dimensionality of Social Networks Using Motifs and Eigenvalues
Anthony Bonato,David F. Gleich,Myunghwan Kim,Dieter Mitsche,Paweł Prałat,Yanhua Tian,Stephen J. Young +6 more
TL;DR: It is found that a social network model with nodes and links sampled from an m-dimensional metric space with power-law distributed influence regions best fits samples from real-world networks when m scales logarithmically with the number of nodes of the network.
Journal ArticleDOI
Metric Dimension for Random Graphs
TL;DR: In this article, the authors investigated the metric dimension of the random graph G(n,p) for a wide range of probabilities, where p = p(n) and p =p(n).