Results 31 to 40 of about 31,009 (261)
General Partitioning on Random Graphs [PDF]
Journal of Algorithms, 2002 Summary: Consider the General Partitioning (GP) problem defined as follows: Partition the vertices of a graph into \(k\) parts \(W_1,\dots, W_k\) satisfying a polynomial time verifiable property. In particular, consider properties specified by a pattern of requirements as to which \(W_i\) forms a sparse or dense subgraph and which pairs \(W_i\), \(W_j\)
Subramanian, CR, Madhavan, CEV
openaire +3 more sources
Exploring chromatin hierarchical organization via Markov State Modelling.
PLoS Computational Biology, 2018 We propose a new computational method for exploring chromatin structural organization based on Markov State Modelling of Hi-C data represented as an interaction network between genomic loci. A Markov process describes the random walk of a traveling probe
Zhen Wah Tan +2 more
doaj +1 more source
Stochastic Chaos and Markov Blankets
Entropy, 2021 In this treatment of random dynamical systems, we consider the existence—and identification—of conditional independencies at nonequilibrium steady-state.
Karl Friston +4 more
doaj +1 more source
Partitioning Search Spaces of a Randomized Search [PDF]
Fundamenta Informaticae, 2009 This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what is the best way to use the computers to solve the instance? Two approaches, simple distribution and search space partitioning as well as their combinations are investigated both
Niemelä Ilkka +2 more
openaire +3 more sources
Discrete Mathematics, 1976 AbstractLet S be a finite set with n labeled elements. One of the partitions of S is selected at random each of them has the same probability. Harper determined the expected number of subsets in the random partition. Haigh studied the probability that the random partition has (at least one) subset of a given size.
openaire +1 more source
Matrix models for random partitions [PDF]
Nuclear Physics B, 2011 We derive exact matrix integral representations for different sums over partitions. The characteristic feature of all obtained matrix models is the presence of logarithmic (or, vice versa, exponential) terms in the potential. Our derivation is based on the application of the higher Casimir operators.
openaire +2 more sources
Cores of random r-partite hypergraphs [PDF]
Information Processing Letters, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fabiano C. Botelho +2 more
openaire +2 more sources
Sensors, 2018 Digital Polymerase Chain Reaction (dPCR) is a novel method for the absolute quantification of target nucleic acids. Quantification by dPCR hinges on the fact that the random distribution of molecules in many partitions follows a Poisson distribution ...
Phenix-Lan Quan +2 more
doaj +1 more source
Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We present a bijection between the set $\mathcal{A}_n$ of deterministic and accessible automata with $n$ states on a $k$-letters alphabet and some diagrams, which can themselves be represented as partitions of the set $[\![ 1..(kn+1) ]\!]$ into $n$ non ...
Frédérique Bassino, Cyril Nicaud
doaj +1 more source
NeuroImage, 2021 The identification of community structure in graphs continues to attract great interest in several fields. Network neuroscience is particularly concerned with this problem considering the key roles communities play in brain processes and functionality ...
Lazaro M. Sanchez-Rodriguez +3 more
doaj +1 more source