#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1992

2017

- This year (1)
- Last five years (10)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Erhard Godehardt, Jerzy Jaworski
- Random Struct. Algorithms
- 1996

- Mindaugas Bloznelis, Jerzy Jaworski, Katarzyna Rybarczyk
- Networks
- 2009

- Jerzy Jaworski, Michal Karonski, Dudley Stark
- Discrete Mathematics
- 2006

- Jerzy Jaworski, Michal Ren, Katarzyna Rybarczyk
- Computing
- 2009

Sensor networks, that is networks of nodes with sensing ability, and wireless communication capacity are proving very useful in fields of environment and industrial monitoring, as well as security. Since the nodes are assumed to be as cheap as possible (with the so far unattained ideal being " smart dust "), and have limited energy capacity (batteries),… (More)

J o u r n a l o f P r o b a b i l i t y Electron. Abstract We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of adjacent nodes (called the assortativity coefficient), the… (More)

- Jerzy Jaworski
- Random Struct. Algorithms
- 1998

- Erhard Godehardt, Jerzy Jaworski
- Electronic Notes in Discrete Mathematics
- 2001

- Jerzy Jaworski, Tomasz Luczak
- Combinatorics, Probability & Computing
- 1992

- Jennie C. Hansen, Jerzy Jaworski
- Random Struct. Algorithms
- 2007

In this paper we consider a cutting process for random mappings. Specifically, for 0 < m < n, we consider the initial (uniform) random mapping digraph G n on n labelled vertices, and we delete (if possible), uniformly and at random, m non-cyclic directed edges from G n. The maximal random digraph consisting of the uni-cyclic components obtained after… (More)