Sciweavers

5592 search results - page 135 / 1119
» On Random Betweenness Constraints
Sort
View
CMSB
2006
Springer
14 years 1 months ago
Randomization and Feedback Properties of Directed Graphs Inspired by Gene Networks
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
M. Cosentino Lagomarsino, P. Jona, B. Bassetti
COMBINATORICA
2008
130views more  COMBINATORICA 2008»
13 years 10 months ago
Two-point concentration in random geometric graphs
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
Tobias Müller
DM
2008
104views more  DM 2008»
13 years 10 months ago
On edge-weighted recursive trees and inversions in random permutations
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
Markus Kuba, Alois Panholzer
IJSN
2006
96views more  IJSN 2006»
13 years 10 months ago
A new signature scheme without random oracles
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new ...
Chik How Tan
CORR
2002
Springer
97views Education» more  CORR 2002»
13 years 10 months ago
Classification of Random Boolean Networks
We provide the first classification of different types of Random Boolean Networks (RBNs). We study the differences of RBNs depending on the degree of synchronicity and determinism...
Carlos Gershenson