All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

20 375 (0,183s) •

Result

Localization of eigenvectors in random graphs

The question of the existence and strength of localization in random graphs is addressed. We investigate Erdos-Renyi as well as random cubic graphs....

BE - Teoretická fyzika

  • 2012
    • •
  • Jx
    • •
  • Link
Result

When is a random graph projective

We determine thresholds for a random graph with n verstices and m edges to be projective.

BA - Obecná matematika

  • 2006
    • •
  • Jx
Result

Largest Planar Matching in Random Bipartite Graphs

Largest Planar Matching in Random Bipartite Graphs...

BA - Obecná matematika

  • 2002
    • •
  • Jx
Result

A note on random homomorphisms from arbitrary graphs to Z

A note on random homomorphisms from arbitrary graphs to Z...

BA - Obecná matematika

  • 2003
    • •
  • Jx
Result

Improper colouring of (random) unit disk graphs

We study improper colorings of unit disk graphs, and random unit disk graphs. The work is motivated by a channel assignment problem proposed by Alcatel, a French telecommunication company....

BA - Obecná matematika

  • 2008
    • •
  • Jx
Result

Graph-indexed random walks on pseudotrees

We investigate the average range of 1-Lipschitz mappings (graph-indexed random walks) of a given connected graph. This parameter originated in statistical physics, it is connected to the study of random graph

Pure mathematics

  • 2018
    • •
  • JSC
    • •
  • Link
Result

Triangles in random graphs

We prove that the number of tringles (counted modulo an arbitrary prime of order log n) is almost uniquely distributed in random graph on n vertices....

BA - Obecná matematika

  • 2004
    • •
  • Jx
Result

On limits of sparse random graphs

degree graphs, regarding the distribution of r-neighbourhoods of the vertices, and the left-convergence notion for dense graphs, regarding, given any finite graph F, the limit of the probabilities that a random ma...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2016
    • •
  • JSC
    • •
  • Link
Result

Recovering the Structure of Random Linear Graphs

In a random linear graph, vertices are points on a line, and pairs of vertices on the spectrum of the graph, using recent results on random matrices. We demonstrate our method on a particular type of random

Applied mathematics

  • 2018
    • •
  • Jimp
    • •
  • Link
Result

Layout of Random Circulant Graphs

z and (z+d) mod n are adjacent. We call layout of the circulant graph any numbering that witness this definition. A random circulant graph results from deleting the layout of a random circulant graph. We ...

Applied mathematics

  • 2018
    • •
  • Jimp
    • •
  • Link
  • 1 - 10 out of 20 375