Results 11 to 20 of about 31,009 (261)
Asymptotics of pure dimer coverings on rail yard graphs
We study the asymptotic limit of random pure dimer coverings on rail yard graphs when the mesh sizes of the graphs go to 0. Each pure dimer covering corresponds to a sequence of interlacing partitions starting with an empty partition and ending in an ...
Zhongyang Li, Mirjana Vuletić
doaj +1 more source
On Random Partitions Induced by Random Maps [PDF]
17 ...
Krachun, D., Yakubovich, Yu.
openaire +2 more sources
A random von Neumann theorem for uniformly distributed sequences of partitions
In this paper, we prove a theorem that confirms, under a supplementary condition, a conjecture concerning random permutations of sequences of partitions of the unit interval.
Carbone Ingrid
doaj +1 more source
Random Sampling of Plane Partitions [PDF]
This article presents uniform random generators of plane partitions according to size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are slightly superlinear: the complexity isO(n(lnn)3) in approximate-size sampling andO(n4/3) in exact-size sampling ...
Bodini, Olivier +2 more
openaire +5 more sources
Constrained exchangeable partitions [PDF]
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
Alexander Gnedin
doaj +1 more source
Volume Laws for Boxed Plane Partitions and Area Laws for Ferrers Diagrams [PDF]
We asymptotically analyse the volume random variables of general, symmetric and cyclically symmetric plane partitions fitting inside a box. We consider the respective symmetry class equipped with the uniform distribution.
Uwe Schwerdtfeger
doaj +1 more source
Improved community detection in weighted bipartite networks [PDF]
Real-world complex networks are composed of non-random quantitative interactions. Identifying communities of nodes that tend to interact more with each other than the network as a whole is a key research focus across multiple disciplines, yet many ...
Stephen J. Beckett
doaj +1 more source
On random stable partitions [PDF]
The stable roommates problem does not necessarily have a solution, i.e. a stable matching. We had found that, for the uniformly random instance, the expected number of solutions converges to $e^{1/2}$ as $n$, the number of members, grows, and with Rob Irving we proved that the limiting probability of solvability is $e^{1/2}/2$, at most. Stephan Mertens'
openaire +3 more sources
Analysis of the total costs for variants of the Union-Find algorithm [PDF]
We study the average behavior of variants of the UNION-FIND algorithm to maintain partitions of a finite set under the random spanning tree model. By applying the method of moments we can characterize the limiting distribution of the total costs of the ...
Markus Kuba, Alois Panholzer
doaj +1 more source
Medical diagnostic value of digital PCR (dPCR): A systematic review
Digital polymerase chain reaction (dPCR) is an emerging technique for the absolute quantification of target nucleic acids. dPCR got attention as a precise quantification tool in preclinical research, particularly when used to detect genetic mutations and
Sophia Nazir
doaj +1 more source

