1067 search results - page 37 / 214 » Probabilistic regular graphs |
101
click to vote
VLDB
1990
ACM
15 years 4 months ago
1990
ACM
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
CAV
2010
Springer
15 years 2 months ago
2010
Springer
Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with -regular objectives; and (b) synthesizes reasonable environment assumptions f...
122
Voted
CORR
2010
Springer
15 years 17 days ago
2010
Springer
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
99
Voted
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
103
click to vote
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...