Journal of Computational Physics, ISSN 0021-9991, 10/2013, Volume 250, pp. 224 - 245

An efficient numerical method based on a probabilistic representation for the Vlasov–Poisson system of equations in the Fourier space has been derived. This...

Parallel computing | Monte Carlo and quasi Monte-Carlo methods | Domain decomposition | Scalable algorithms | Random trees | Vlasov–Poisson system | Vlasov-Poisson system | BOUNDARY-VALUE-PROBLEMS | CASCADES | PHYSICS, MATHEMATICAL | MONTE CARLO METHODS | ELECTRON-PLASMA | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | PARTIAL-DIFFERENTIAL-EQUATIONS | Monte Carlo method | Algorithms | Numerical analysis | Landau damping | Computer simulation | Mathematical analysis | Probability theory | Fourier analysis | Mathematical models | Representations | Modeling and Simulation | Computational Physics | Distributed, Parallel, and Cluster Computing | Analysis of PDEs | Numerical Analysis | Computer Science | Probability | Mathematics | Plasmas | Engineering Sciences | Physics

Parallel computing | Monte Carlo and quasi Monte-Carlo methods | Domain decomposition | Scalable algorithms | Random trees | Vlasov–Poisson system | Vlasov-Poisson system | BOUNDARY-VALUE-PROBLEMS | CASCADES | PHYSICS, MATHEMATICAL | MONTE CARLO METHODS | ELECTRON-PLASMA | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | PARTIAL-DIFFERENTIAL-EQUATIONS | Monte Carlo method | Algorithms | Numerical analysis | Landau damping | Computer simulation | Mathematical analysis | Probability theory | Fourier analysis | Mathematical models | Representations | Modeling and Simulation | Computational Physics | Distributed, Parallel, and Cluster Computing | Analysis of PDEs | Numerical Analysis | Computer Science | Probability | Mathematics | Plasmas | Engineering Sciences | Physics

Journal Article

Nature Reviews Cancer, ISSN 1474-175X, 11/2015, Volume 15, Issue 12, pp. 730 - 745

Mathematical modelling approaches have become increasingly abundant in cancer research. The complexity of cancer is well suited to quantitative approaches as...

BREAST-CANCER | LUNG-CANCER | PASSENGER MUTATIONS | IMMUNE-SYSTEM | ONCOLOGY | TREE MODELS | ACQUIRED-RESISTANCE | DRUG-RESISTANCE | EVOLUTIONARY GAME-THEORY | CHRONIC MYELOID-LEUKEMIA | NONLINEAR TUMOR-GROWTH | Models, Theoretical | Neoplasms - therapy | Animals | Prognosis | Models, Biological | Humans | Neoplasms - diagnosis | Disease Progression | Usage | Oncology, Experimental | Models | Mathematical models | Research | Carcinogenesis | Cancer

BREAST-CANCER | LUNG-CANCER | PASSENGER MUTATIONS | IMMUNE-SYSTEM | ONCOLOGY | TREE MODELS | ACQUIRED-RESISTANCE | DRUG-RESISTANCE | EVOLUTIONARY GAME-THEORY | CHRONIC MYELOID-LEUKEMIA | NONLINEAR TUMOR-GROWTH | Models, Theoretical | Neoplasms - therapy | Animals | Prognosis | Models, Biological | Humans | Neoplasms - diagnosis | Disease Progression | Usage | Oncology, Experimental | Models | Mathematical models | Research | Carcinogenesis | Cancer

Journal Article

Inventiones Mathematicae, ISSN 0020-9910, 2009, Volume 177, Issue 3, pp. 533 - 540

We give a positive answer, in the measurable-group-theory context, to von Neumann's problem of knowing whether a non-amenable countable discrete group contains...

MATHEMATICS | COST | CLUSTERS | PERCOLATION | EQUIVALENCE | MINIMAL SPANNING FORESTS | CAYLEY-GRAPHS | Studies | Group Theory | Probability | Operator Algebras | Dynamical Systems | Mathematics

MATHEMATICS | COST | CLUSTERS | PERCOLATION | EQUIVALENCE | MINIMAL SPANNING FORESTS | CAYLEY-GRAPHS | Studies | Group Theory | Probability | Operator Algebras | Dynamical Systems | Mathematics

Journal Article

1998, ISBN 0198502079, xv, 410

Book

The Annals of Applied Probability, ISSN 1050-5164, 2/2016, Volume 26, Issue 1, pp. 305 - 327

We determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular...

Algorithms | Mathematical monotonicity | Mathematical theorems | Uniqueness | Graph theory | Random variables | Recursion | Density | Vertices | Truncation | Local weak convergence | Objective method | Load balancing | Maximum subgraph density | Pairing model | Unimodularity | local weak convergence | load balancing | SPANNING-TREES | ENUMERATION | STATISTICS & PROBABILITY | LOCAL WEAK-CONVERGENCE | BELIEF PROPAGATION | MATCHINGS | objective method | unimodularity | RANDOM ASSIGNMENT PROBLEM | pairing model | Probability | Mathematics | 60C05 | 90B15 | 05C80

Algorithms | Mathematical monotonicity | Mathematical theorems | Uniqueness | Graph theory | Random variables | Recursion | Density | Vertices | Truncation | Local weak convergence | Objective method | Load balancing | Maximum subgraph density | Pairing model | Unimodularity | local weak convergence | load balancing | SPANNING-TREES | ENUMERATION | STATISTICS & PROBABILITY | LOCAL WEAK-CONVERGENCE | BELIEF PROPAGATION | MATCHINGS | objective method | unimodularity | RANDOM ASSIGNMENT PROBLEM | pairing model | Probability | Mathematics | 60C05 | 90B15 | 05C80

Journal Article

Annals of Probability, ISSN 0091-1798, 2018, Volume 46, Issue 4, pp. 2134 - 2189

We study uniform random permutations in an important class of pattern-avoiding permutations: the separable permutations. We describe the asymptotics of the...

Permutation patterns | Permutons | Brownian excursion | permutons | NUMBER | TREES | OCCURRENCES | STATISTICS & PROBABILITY | PATTERN-AVOIDING PERMUTATIONS | Combinatorics | Mathematics

Permutation patterns | Permutons | Brownian excursion | permutons | NUMBER | TREES | OCCURRENCES | STATISTICS & PROBABILITY | PATTERN-AVOIDING PERMUTATIONS | Combinatorics | Mathematics

Journal Article

Foundations of Computational Mathematics, ISSN 1615-3375, 6/2009, Volume 9, Issue 3, pp. 295 - 316

We provide a refined approach to the classical Magnus (Commun. Pure Appl. Math. 7:649–673, [1954]) and Fer expansion (Bull. Classe Sci. Acad. R. Belg....

Dendriform algebra | Rota–Baxter algebra | Linear differential equation | Linear integral equation | Linear and Multilinear Algebras, Matrix Theory | Mathematics | Pre-Lie algebra | 17D25 | Magnus expansion | Fer expansion | 81T15 | 17A30 | Numerical Analysis | 37C10 | 16W25 | Applications of Mathematics | Math Applications in Computer Science | Computer Science, general | Binary rooted trees | 05C05 | Rota-Baxter algebra | MATHEMATICS, APPLIED | DIFFERENTIAL-EQUATIONS | BAXTER ALGEBRAS | MATHEMATICS | COMBINATORIAL IDENTITIES | EXPANSION | COMPUTER SCIENCE, THEORY & METHODS | Algebra | Linear equations | Mathematical analysis | Differential equations | Combinatorics | Mathematical Physics | Physics | Classical Analysis and ODEs | Rings and Algebras

Dendriform algebra | Rota–Baxter algebra | Linear differential equation | Linear integral equation | Linear and Multilinear Algebras, Matrix Theory | Mathematics | Pre-Lie algebra | 17D25 | Magnus expansion | Fer expansion | 81T15 | 17A30 | Numerical Analysis | 37C10 | 16W25 | Applications of Mathematics | Math Applications in Computer Science | Computer Science, general | Binary rooted trees | 05C05 | Rota-Baxter algebra | MATHEMATICS, APPLIED | DIFFERENTIAL-EQUATIONS | BAXTER ALGEBRAS | MATHEMATICS | COMBINATORIAL IDENTITIES | EXPANSION | COMPUTER SCIENCE, THEORY & METHODS | Algebra | Linear equations | Mathematical analysis | Differential equations | Combinatorics | Mathematical Physics | Physics | Classical Analysis and ODEs | Rings and Algebras

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2011, Volume 159, Issue 12, pp. 1189 - 1195

A subset S of vertices of a graph G is called a k - path vertex cover if every path of order k in G contains at least one vertex from S . Denote by ψ k ( G )...

Path | Vertex cover | NP-complete | Dissociation number | Algorithm | Path vertex cover | MATHEMATICS, APPLIED | INDEPENDENCE NUMBER | HYPERGRAPHS | PROTOCOL | RATIO | BIPARTITE GRAPHS | Trees | Graphs | Mathematical analysis | Upper bounds | Computer Science | Discrete Mathematics

Path | Vertex cover | NP-complete | Dissociation number | Algorithm | Path vertex cover | MATHEMATICS, APPLIED | INDEPENDENCE NUMBER | HYPERGRAPHS | PROTOCOL | RATIO | BIPARTITE GRAPHS | Trees | Graphs | Mathematical analysis | Upper bounds | Computer Science | Discrete Mathematics

Journal Article

Foundations of Computational Mathematics, ISSN 1615-3375, 8/2013, Volume 13, Issue 4, pp. 583 - 613

Pre-Lie (or Vinberg) algebras arise from flat and torsion-free connections on differential manifolds. These algebras have been extensively studied in recent...

Connections | Post-Lie algebras | Economics general | Lie group integrators | B-series | 53C | Linear and Multilinear Algebras, Matrix Theory | Mathematics | 65L | 16T | Lie–Butcher series | Homogeneous spaces | Pre-Lie algebras | Rooted trees | Numerical Analysis | Post-Lie algebroids | Applications of Mathematics | Math Applications in Computer Science | Computer Science, general | Moving frames | Combinatorial Hopf algebras | Lie-Butcher series | MATHEMATICS, APPLIED | COFRAMES | RUNGE-KUTTA METHODS | GROUP INTEGRATORS | MATHEMATICS | MANIFOLDS | COMPUTER SCIENCE, THEORY & METHODS | RENORMALIZATION | Series | Research | Mathematical research | Lie algebras | Sequences (Mathematics) | Computational mathematics | Algebra | Topological manifolds | Lie groups | Manifolds | Frames | Numerical analysis | Computation | Mathematical models | Joints | Invariants

Connections | Post-Lie algebras | Economics general | Lie group integrators | B-series | 53C | Linear and Multilinear Algebras, Matrix Theory | Mathematics | 65L | 16T | Lie–Butcher series | Homogeneous spaces | Pre-Lie algebras | Rooted trees | Numerical Analysis | Post-Lie algebroids | Applications of Mathematics | Math Applications in Computer Science | Computer Science, general | Moving frames | Combinatorial Hopf algebras | Lie-Butcher series | MATHEMATICS, APPLIED | COFRAMES | RUNGE-KUTTA METHODS | GROUP INTEGRATORS | MATHEMATICS | MANIFOLDS | COMPUTER SCIENCE, THEORY & METHODS | RENORMALIZATION | Series | Research | Mathematical research | Lie algebras | Sequences (Mathematics) | Computational mathematics | Algebra | Topological manifolds | Lie groups | Manifolds | Frames | Numerical analysis | Computation | Mathematical models | Joints | Invariants

Journal Article

2004, 1, CRC Press series on discrete mathematics and its applications, ISBN 1584884363, xv, 184

Book

International Journal of Game Theory, ISSN 0020-7276, 06/2019, Volume 48, Issue 2, pp. 491 - 511

The game Arc-Kayles is played on an undirected graph with two players taking turns deleting an edge and its endpoints from the graph. We study a generalization...

Combinatorial games | Arc-Kayles | Graphs | MATHEMATICS, INTERDISCIPLINARY APPLICATIONS | COMPLEXITY | STATISTICS & PROBABILITY | SOCIAL SCIENCES, MATHEMATICAL METHODS | ECONOMICS | Chess | Trees | Queens | Trees (mathematics) | Graph theory | Periodic variations | Game theory | Turntaking | Mathematics | Combinatorics | Computer Science | Discrete Mathematics

Combinatorial games | Arc-Kayles | Graphs | MATHEMATICS, INTERDISCIPLINARY APPLICATIONS | COMPLEXITY | STATISTICS & PROBABILITY | SOCIAL SCIENCES, MATHEMATICAL METHODS | ECONOMICS | Chess | Trees | Queens | Trees (mathematics) | Graph theory | Periodic variations | Game theory | Turntaking | Mathematics | Combinatorics | Computer Science | Discrete Mathematics

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 12/2018, Volume 251, pp. 30 - 39

The main topic of this paper is motivated by a localization problem in cellular networks. Given a graph G we want to localize a walking agent by checking his...

MATHEMATICS, APPLIED | ROBBER | Geometry | Euclidean geometry | Cellular communication | Apexes | Upper bounds | Graphs | Graph theory | Trees (mathematics) | Position (location) | Game theory | Computer Science | Discrete Mathematics

MATHEMATICS, APPLIED | ROBBER | Geometry | Euclidean geometry | Cellular communication | Apexes | Upper bounds | Graphs | Graph theory | Trees (mathematics) | Position (location) | Game theory | Computer Science | Discrete Mathematics

Journal Article

SIAM Review, ISSN 0036-1445, 3/2007, Volume 49, Issue 1, pp. 3 - 31

The grand challenges in biology today are being shaped by powerful high-throughput technologies that have revealed the genomes of many organisms, global...

Algebra | Genes | Phylogenetics | Nucleotide sequences | Coordinate systems | Genomes | Mathematical functions | Polynomials | Codons | Survey and Review | Genetic code | Genomics | Sequence alignment | Hidden Markov model | Algebraic statistics | Ultraconservation | MATHEMATICS, APPLIED | algebraic statistics | hidden Markov model | sequence alignment | genetic code | PREDICTION | ELEMENTS | TREES | ALIGNMENT | SEQUENCE | GENES | genomics | phylogenetics | ultraconservation | VERTEBRATE | GEOMETRY | Markov processes | Cladistic analysis | Phylogeny | Analysis

Algebra | Genes | Phylogenetics | Nucleotide sequences | Coordinate systems | Genomes | Mathematical functions | Polynomials | Codons | Survey and Review | Genetic code | Genomics | Sequence alignment | Hidden Markov model | Algebraic statistics | Ultraconservation | MATHEMATICS, APPLIED | algebraic statistics | hidden Markov model | sequence alignment | genetic code | PREDICTION | ELEMENTS | TREES | ALIGNMENT | SEQUENCE | GENES | genomics | phylogenetics | ultraconservation | VERTEBRATE | GEOMETRY | Markov processes | Cladistic analysis | Phylogeny | Analysis

Journal Article

Ergodic Theory and Dynamical Systems, ISSN 0143-3857, 12/2005, Volume 25, Issue 6, pp. 1809 - 1827

Measure equivalence (ME) is the measure theoretic counterpart of quasi-isometry. This field has grown considerably over the past few years, developing tools to...

MATHEMATICS, APPLIED | HYPERBOLIC GROUPS | SPANNING FORESTS | TREES | COHOMOLOGY | UNIFORM | MEASURE PRESERVING TRANSFORMATIONS | RIGIDITY | ENDS | LATTICES | ORBIT EQUIVALENCE | Group Theory | Probability | Operator Algebras | Dynamical Systems | Mathematics

MATHEMATICS, APPLIED | HYPERBOLIC GROUPS | SPANNING FORESTS | TREES | COHOMOLOGY | UNIFORM | MEASURE PRESERVING TRANSFORMATIONS | RIGIDITY | ENDS | LATTICES | ORBIT EQUIVALENCE | Group Theory | Probability | Operator Algebras | Dynamical Systems | Mathematics

Journal Article

Inventiones mathematicae, ISSN 0020-9910, 9/2007, Volume 169, Issue 3, pp. 621 - 670

We discuss scaling limits of large bipartite planar maps. If p≥2 is a fixed integer, we consider, for every integer n≥2, a random planar map M n which is...

Mathematics, general | Mathematics | MATHEMATICS | TREES | Studies

Mathematics, general | Mathematics | MATHEMATICS | TREES | Studies

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 10/2017, Volume 230, pp. 133 - 145

The bondage number b(G) of a nonempty graph G is the cardinality of a minimum set of edges whose removal from G results in a graph with domination number...

Trees | Bondage number | Strong product | GRAPH | MATHEMATICS, APPLIED | C-N | Mathematics | Combinatorics | Computer Science | Discrete Mathematics

Trees | Bondage number | Strong product | GRAPH | MATHEMATICS, APPLIED | C-N | Mathematics | Combinatorics | Computer Science | Discrete Mathematics

Journal Article

Journal of Mathematical Biology, ISSN 0303-6812, 07/2017, Volume 75, Issue 1, pp. 199 - 237

The concepts of orthology, paralogy, and xenology play a key role in molecular evolution. Orthology and paralogy distinguish whether a pair of genes originated...

Paralogs | Di-cograph | Symbolic ultrametric | NP-completeness | Gene tree | Orthologs | Integer Linear Program | 2-Structures | Uniformly non-prime decomposition | Xenologs | Recognition algorithm | RECOGNITION | ALGORITHM | MODULAR DECOMPOSITION | GRAPHS | BIOLOGY | MATHEMATICAL & COMPUTATIONAL BIOLOGY | HORIZONTAL GENE-TRANSFER | Gene Transfer, Horizontal | Phylogeny | Models, Biological | Evolution, Molecular | Linear programming | Usage | Graph theory | Genetic transformation | Analysis | Trees | Gene transfer | Genes | Biological evolution | Modules | Evolutionary genetics | Genomes | Binary systems (materials) | Structural hierarchy | Molecular evolution | Offspring | Orthology | Computer applications | Speciation

Paralogs | Di-cograph | Symbolic ultrametric | NP-completeness | Gene tree | Orthologs | Integer Linear Program | 2-Structures | Uniformly non-prime decomposition | Xenologs | Recognition algorithm | RECOGNITION | ALGORITHM | MODULAR DECOMPOSITION | GRAPHS | BIOLOGY | MATHEMATICAL & COMPUTATIONAL BIOLOGY | HORIZONTAL GENE-TRANSFER | Gene Transfer, Horizontal | Phylogeny | Models, Biological | Evolution, Molecular | Linear programming | Usage | Graph theory | Genetic transformation | Analysis | Trees | Gene transfer | Genes | Biological evolution | Modules | Evolutionary genetics | Genomes | Binary systems (materials) | Structural hierarchy | Molecular evolution | Offspring | Orthology | Computer applications | Speciation

Journal Article